├── .gitattributes ├── .github ├── stale.yml └── workflows │ └── CI.yml ├── .gitignore ├── .mocharc.json ├── .prettierrc ├── .waffle.json ├── CITATION.cff ├── LICENSE ├── README.md ├── contracts ├── UniswapV2ERC20.sol ├── UniswapV2Factory.sol ├── UniswapV2Pair.sol ├── interfaces │ ├── IERC20.sol │ ├── IUniswapV2Callee.sol │ ├── IUniswapV2ERC20.sol │ ├── IUniswapV2Factory.sol │ └── IUniswapV2Pair.sol ├── libraries │ ├── Math.sol │ ├── SafeMath.sol │ └── UQ112x112.sol └── test │ └── ERC20.sol ├── package.json ├── test ├── UniswapV2ERC20.spec.ts ├── UniswapV2Factory.spec.ts ├── UniswapV2Pair.spec.ts └── shared │ ├── fixtures.ts │ └── utilities.ts ├── tsconfig.json └── yarn.lock /.gitattributes: -------------------------------------------------------------------------------- 1 | *.sol linguist-language=Solidity -------------------------------------------------------------------------------- /.github/stale.yml: -------------------------------------------------------------------------------- 1 | # Configuration for probot-stale - https://github.com/probot/stale 2 | 3 | issues: 4 | # Number of days of inactivity before an Issue or Pull Request becomes stale 5 | daysUntilStale: 7 6 | 7 | # Number of days of inactivity before an Issue or Pull Request with the stale label is closed. 8 | # Set to false to disable. If disabled, issues still need to be closed manually, but will remain marked as stale. 9 | daysUntilClose: 7 10 | 11 | # Only issues or pull requests with all of these labels are check if stale. Defaults to `[]` (disabled) 12 | onlyLabels: 13 | - question 14 | - autoclose 15 | 16 | # Issues or Pull Requests with these labels will never be considered stale. Set to `[]` to disable 17 | exemptLabels: 18 | - p0 19 | - bug 20 | 21 | # Comment to post when marking as stale. Set to `false` to disable 22 | markComment: > 23 | This issue has been automatically marked as stale because it has not had 24 | recent activity. It will be closed if no further activity occurs. Thank you 25 | for your contributions. 26 | -------------------------------------------------------------------------------- /.github/workflows/CI.yml: -------------------------------------------------------------------------------- 1 | name: CI 2 | 3 | on: 4 | push: 5 | branches: 6 | - master 7 | pull_request: 8 | 9 | jobs: 10 | test: 11 | strategy: 12 | matrix: 13 | node: ['10.x', '12.x'] 14 | os: [ubuntu-latest] 15 | 16 | runs-on: ${{ matrix.os }} 17 | 18 | steps: 19 | - uses: actions/checkout@v1 20 | - uses: actions/setup-node@v1 21 | with: 22 | node-version: ${{ matrix.node }} 23 | 24 | - run: npm install -g yarn 25 | 26 | - id: yarn-cache 27 | run: echo "::set-output name=dir::$(yarn cache dir)" 28 | - uses: actions/cache@v1 29 | with: 30 | path: ${{ steps.yarn-cache.outputs.dir }} 31 | key: ${{ matrix.os }}-yarn-${{ hashFiles('**/yarn.lock') }} 32 | restore-keys: | 33 | ${{ matrix.os }}-yarn- 34 | 35 | - run: yarn 36 | - run: yarn lint 37 | - run: yarn test 38 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | node_modules/ 2 | build/ 3 | -------------------------------------------------------------------------------- /.mocharc.json: -------------------------------------------------------------------------------- 1 | { 2 | "extension": ["ts"], 3 | "spec": "./test/**/*.spec.ts", 4 | "require": "ts-node/register", 5 | "timeout": 12000 6 | } 7 | -------------------------------------------------------------------------------- /.prettierrc: -------------------------------------------------------------------------------- 1 | { 2 | "semi": false, 3 | "singleQuote": true, 4 | "printWidth": 120 5 | } 6 | -------------------------------------------------------------------------------- /.waffle.json: -------------------------------------------------------------------------------- 1 | { 2 | "compilerVersion": "./node_modules/solc", 3 | "outputType": "all", 4 | "compilerOptions": { 5 | "outputSelection": { 6 | "*": { 7 | "*": [ 8 | "evm.bytecode.object", 9 | "evm.deployedBytecode.object", 10 | "abi", 11 | "evm.bytecode.sourceMap", 12 | "evm.deployedBytecode.sourceMap", 13 | "metadata" 14 | ], 15 | "": ["ast"] 16 | } 17 | }, 18 | "evmVersion": "istanbul", 19 | "optimizer": { 20 | "enabled": true, 21 | "runs": 999999 22 | } 23 | } 24 | } 25 | -------------------------------------------------------------------------------- /CITATION.cff: -------------------------------------------------------------------------------- 1 | cff-version: 1.2.0 2 | message: "If you use this software, please cite it as below." 3 | authors: 4 | - family-names: "Zinsmeister" 5 | given-names: "Noah" 6 | - family-names: "Adams" 7 | given-names: "Hayden" 8 | - family-names: "Robinson" 9 | given-names: "Dan" 10 | - family-names: "Salem" 11 | given-names: "Moody" 12 | title: "v2-core" 13 | version: 1.0.1 14 | date-released: 2019-05-03 15 | url: "https://github.com/Uniswap/v2-core" 16 | -------------------------------------------------------------------------------- /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 | # Uniswap V2 2 | 3 | [![Actions Status](https://github.com/Uniswap/uniswap-v2-core/workflows/CI/badge.svg)](https://github.com/Uniswap/uniswap-v2-core/actions) 4 | [![Version](https://img.shields.io/npm/v/@uniswap/v2-core)](https://www.npmjs.com/package/@uniswap/v2-core) 5 | 6 | In-depth documentation on Uniswap V2 is available at [uniswap.org](https://uniswap.org/docs). 7 | 8 | The built contract artifacts can be browsed via [unpkg.com](https://unpkg.com/browse/@uniswap/v2-core@latest/). 9 | 10 | # Local Development 11 | 12 | The following assumes the use of `node@>=10`. 13 | 14 | ## Install Dependencies 15 | 16 | `yarn` 17 | 18 | ## Compile Contracts 19 | 20 | `yarn compile` 21 | 22 | ## Run Tests 23 | 24 | `yarn test` 25 | -------------------------------------------------------------------------------- /contracts/UniswapV2ERC20.sol: -------------------------------------------------------------------------------- 1 | pragma solidity =0.5.16; 2 | 3 | import './interfaces/IUniswapV2ERC20.sol'; 4 | import './libraries/SafeMath.sol'; 5 | 6 | contract UniswapV2ERC20 is IUniswapV2ERC20 { 7 | using SafeMath for uint; 8 | 9 | string public constant name = 'Uniswap V2'; 10 | string public constant symbol = 'UNI-V2'; 11 | uint8 public constant decimals = 18; 12 | uint public totalSupply; 13 | mapping(address => uint) public balanceOf; 14 | mapping(address => mapping(address => uint)) public allowance; 15 | 16 | bytes32 public DOMAIN_SEPARATOR; 17 | // keccak256("Permit(address owner,address spender,uint256 value,uint256 nonce,uint256 deadline)"); 18 | bytes32 public constant PERMIT_TYPEHASH = 0x6e71edae12b1b97f4d1f60370fef10105fa2faae0126114a169c64845d6126c9; 19 | mapping(address => uint) public nonces; 20 | 21 | event Approval(address indexed owner, address indexed spender, uint value); 22 | event Transfer(address indexed from, address indexed to, uint value); 23 | 24 | constructor() public { 25 | uint chainId; 26 | assembly { 27 | chainId := chainid 28 | } 29 | DOMAIN_SEPARATOR = keccak256( 30 | abi.encode( 31 | keccak256('EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)'), 32 | keccak256(bytes(name)), 33 | keccak256(bytes('1')), 34 | chainId, 35 | address(this) 36 | ) 37 | ); 38 | } 39 | 40 | function _mint(address to, uint value) internal { 41 | totalSupply = totalSupply.add(value); 42 | balanceOf[to] = balanceOf[to].add(value); 43 | emit Transfer(address(0), to, value); 44 | } 45 | 46 | function _burn(address from, uint value) internal { 47 | balanceOf[from] = balanceOf[from].sub(value); 48 | totalSupply = totalSupply.sub(value); 49 | emit Transfer(from, address(0), value); 50 | } 51 | 52 | function _approve(address owner, address spender, uint value) private { 53 | allowance[owner][spender] = value; 54 | emit Approval(owner, spender, value); 55 | } 56 | 57 | function _transfer(address from, address to, uint value) private { 58 | balanceOf[from] = balanceOf[from].sub(value); 59 | balanceOf[to] = balanceOf[to].add(value); 60 | emit Transfer(from, to, value); 61 | } 62 | 63 | function approve(address spender, uint value) external returns (bool) { 64 | _approve(msg.sender, spender, value); 65 | return true; 66 | } 67 | 68 | function transfer(address to, uint value) external returns (bool) { 69 | _transfer(msg.sender, to, value); 70 | return true; 71 | } 72 | 73 | function transferFrom(address from, address to, uint value) external returns (bool) { 74 | if (allowance[from][msg.sender] != uint(-1)) { 75 | allowance[from][msg.sender] = allowance[from][msg.sender].sub(value); 76 | } 77 | _transfer(from, to, value); 78 | return true; 79 | } 80 | 81 | function permit(address owner, address spender, uint value, uint deadline, uint8 v, bytes32 r, bytes32 s) external { 82 | require(deadline >= block.timestamp, 'UniswapV2: EXPIRED'); 83 | bytes32 digest = keccak256( 84 | abi.encodePacked( 85 | '\x19\x01', 86 | DOMAIN_SEPARATOR, 87 | keccak256(abi.encode(PERMIT_TYPEHASH, owner, spender, value, nonces[owner]++, deadline)) 88 | ) 89 | ); 90 | address recoveredAddress = ecrecover(digest, v, r, s); 91 | require(recoveredAddress != address(0) && recoveredAddress == owner, 'UniswapV2: INVALID_SIGNATURE'); 92 | _approve(owner, spender, value); 93 | } 94 | } 95 | -------------------------------------------------------------------------------- /contracts/UniswapV2Factory.sol: -------------------------------------------------------------------------------- 1 | pragma solidity =0.5.16; 2 | 3 | import './interfaces/IUniswapV2Factory.sol'; 4 | import './UniswapV2Pair.sol'; 5 | 6 | contract UniswapV2Factory is IUniswapV2Factory { 7 | address public feeTo; 8 | address public feeToSetter; 9 | 10 | mapping(address => mapping(address => address)) public getPair; 11 | address[] public allPairs; 12 | 13 | event PairCreated(address indexed token0, address indexed token1, address pair, uint); 14 | 15 | constructor(address _feeToSetter) public { 16 | feeToSetter = _feeToSetter; 17 | } 18 | 19 | function allPairsLength() external view returns (uint) { 20 | return allPairs.length; 21 | } 22 | 23 | function createPair(address tokenA, address tokenB) external returns (address pair) { 24 | require(tokenA != tokenB, 'UniswapV2: IDENTICAL_ADDRESSES'); 25 | (address token0, address token1) = tokenA < tokenB ? (tokenA, tokenB) : (tokenB, tokenA); 26 | require(token0 != address(0), 'UniswapV2: ZERO_ADDRESS'); 27 | require(getPair[token0][token1] == address(0), 'UniswapV2: PAIR_EXISTS'); // single check is sufficient 28 | bytes memory bytecode = type(UniswapV2Pair).creationCode; 29 | bytes32 salt = keccak256(abi.encodePacked(token0, token1)); 30 | assembly { 31 | pair := create2(0, add(bytecode, 32), mload(bytecode), salt) 32 | } 33 | IUniswapV2Pair(pair).initialize(token0, token1); 34 | getPair[token0][token1] = pair; 35 | getPair[token1][token0] = pair; // populate mapping in the reverse direction 36 | allPairs.push(pair); 37 | emit PairCreated(token0, token1, pair, allPairs.length); 38 | } 39 | 40 | function setFeeTo(address _feeTo) external { 41 | require(msg.sender == feeToSetter, 'UniswapV2: FORBIDDEN'); 42 | feeTo = _feeTo; 43 | } 44 | 45 | function setFeeToSetter(address _feeToSetter) external { 46 | require(msg.sender == feeToSetter, 'UniswapV2: FORBIDDEN'); 47 | feeToSetter = _feeToSetter; 48 | } 49 | } 50 | -------------------------------------------------------------------------------- /contracts/UniswapV2Pair.sol: -------------------------------------------------------------------------------- 1 | pragma solidity =0.5.16; 2 | 3 | import './interfaces/IUniswapV2Pair.sol'; 4 | import './UniswapV2ERC20.sol'; 5 | import './libraries/Math.sol'; 6 | import './libraries/UQ112x112.sol'; 7 | import './interfaces/IERC20.sol'; 8 | import './interfaces/IUniswapV2Factory.sol'; 9 | import './interfaces/IUniswapV2Callee.sol'; 10 | 11 | contract UniswapV2Pair is IUniswapV2Pair, UniswapV2ERC20 { 12 | using SafeMath for uint; 13 | using UQ112x112 for uint224; 14 | 15 | uint public constant MINIMUM_LIQUIDITY = 10**3; 16 | bytes4 private constant SELECTOR = bytes4(keccak256(bytes('transfer(address,uint256)'))); 17 | 18 | address public factory; 19 | address public token0; 20 | address public token1; 21 | 22 | uint112 private reserve0; // uses single storage slot, accessible via getReserves 23 | uint112 private reserve1; // uses single storage slot, accessible via getReserves 24 | uint32 private blockTimestampLast; // uses single storage slot, accessible via getReserves 25 | 26 | uint public price0CumulativeLast; 27 | uint public price1CumulativeLast; 28 | uint public kLast; // reserve0 * reserve1, as of immediately after the most recent liquidity event 29 | 30 | uint private unlocked = 1; 31 | modifier lock() { 32 | require(unlocked == 1, 'UniswapV2: LOCKED'); 33 | unlocked = 0; 34 | _; 35 | unlocked = 1; 36 | } 37 | 38 | function getReserves() public view returns (uint112 _reserve0, uint112 _reserve1, uint32 _blockTimestampLast) { 39 | _reserve0 = reserve0; 40 | _reserve1 = reserve1; 41 | _blockTimestampLast = blockTimestampLast; 42 | } 43 | 44 | function _safeTransfer(address token, address to, uint value) private { 45 | (bool success, bytes memory data) = token.call(abi.encodeWithSelector(SELECTOR, to, value)); 46 | require(success && (data.length == 0 || abi.decode(data, (bool))), 'UniswapV2: TRANSFER_FAILED'); 47 | } 48 | 49 | event Mint(address indexed sender, uint amount0, uint amount1); 50 | event Burn(address indexed sender, uint amount0, uint amount1, address indexed to); 51 | event Swap( 52 | address indexed sender, 53 | uint amount0In, 54 | uint amount1In, 55 | uint amount0Out, 56 | uint amount1Out, 57 | address indexed to 58 | ); 59 | event Sync(uint112 reserve0, uint112 reserve1); 60 | 61 | constructor() public { 62 | factory = msg.sender; 63 | } 64 | 65 | // called once by the factory at time of deployment 66 | function initialize(address _token0, address _token1) external { 67 | require(msg.sender == factory, 'UniswapV2: FORBIDDEN'); // sufficient check 68 | token0 = _token0; 69 | token1 = _token1; 70 | } 71 | 72 | // update reserves and, on the first call per block, price accumulators 73 | function _update(uint balance0, uint balance1, uint112 _reserve0, uint112 _reserve1) private { 74 | require(balance0 <= uint112(-1) && balance1 <= uint112(-1), 'UniswapV2: OVERFLOW'); 75 | uint32 blockTimestamp = uint32(block.timestamp % 2**32); 76 | uint32 timeElapsed = blockTimestamp - blockTimestampLast; // overflow is desired 77 | if (timeElapsed > 0 && _reserve0 != 0 && _reserve1 != 0) { 78 | // * never overflows, and + overflow is desired 79 | price0CumulativeLast += uint(UQ112x112.encode(_reserve1).uqdiv(_reserve0)) * timeElapsed; 80 | price1CumulativeLast += uint(UQ112x112.encode(_reserve0).uqdiv(_reserve1)) * timeElapsed; 81 | } 82 | reserve0 = uint112(balance0); 83 | reserve1 = uint112(balance1); 84 | blockTimestampLast = blockTimestamp; 85 | emit Sync(reserve0, reserve1); 86 | } 87 | 88 | // if fee is on, mint liquidity equivalent to 1/6th of the growth in sqrt(k) 89 | function _mintFee(uint112 _reserve0, uint112 _reserve1) private returns (bool feeOn) { 90 | address feeTo = IUniswapV2Factory(factory).feeTo(); 91 | feeOn = feeTo != address(0); 92 | uint _kLast = kLast; // gas savings 93 | if (feeOn) { 94 | if (_kLast != 0) { 95 | uint rootK = Math.sqrt(uint(_reserve0).mul(_reserve1)); 96 | uint rootKLast = Math.sqrt(_kLast); 97 | if (rootK > rootKLast) { 98 | uint numerator = totalSupply.mul(rootK.sub(rootKLast)); 99 | uint denominator = rootK.mul(5).add(rootKLast); 100 | uint liquidity = numerator / denominator; 101 | if (liquidity > 0) _mint(feeTo, liquidity); 102 | } 103 | } 104 | } else if (_kLast != 0) { 105 | kLast = 0; 106 | } 107 | } 108 | 109 | // this low-level function should be called from a contract which performs important safety checks 110 | function mint(address to) external lock returns (uint liquidity) { 111 | (uint112 _reserve0, uint112 _reserve1,) = getReserves(); // gas savings 112 | uint balance0 = IERC20(token0).balanceOf(address(this)); 113 | uint balance1 = IERC20(token1).balanceOf(address(this)); 114 | uint amount0 = balance0.sub(_reserve0); 115 | uint amount1 = balance1.sub(_reserve1); 116 | 117 | bool feeOn = _mintFee(_reserve0, _reserve1); 118 | uint _totalSupply = totalSupply; // gas savings, must be defined here since totalSupply can update in _mintFee 119 | if (_totalSupply == 0) { 120 | liquidity = Math.sqrt(amount0.mul(amount1)).sub(MINIMUM_LIQUIDITY); 121 | _mint(address(0), MINIMUM_LIQUIDITY); // permanently lock the first MINIMUM_LIQUIDITY tokens 122 | } else { 123 | liquidity = Math.min(amount0.mul(_totalSupply) / _reserve0, amount1.mul(_totalSupply) / _reserve1); 124 | } 125 | require(liquidity > 0, 'UniswapV2: INSUFFICIENT_LIQUIDITY_MINTED'); 126 | _mint(to, liquidity); 127 | 128 | _update(balance0, balance1, _reserve0, _reserve1); 129 | if (feeOn) kLast = uint(reserve0).mul(reserve1); // reserve0 and reserve1 are up-to-date 130 | emit Mint(msg.sender, amount0, amount1); 131 | } 132 | 133 | // this low-level function should be called from a contract which performs important safety checks 134 | function burn(address to) external lock returns (uint amount0, uint amount1) { 135 | (uint112 _reserve0, uint112 _reserve1,) = getReserves(); // gas savings 136 | address _token0 = token0; // gas savings 137 | address _token1 = token1; // gas savings 138 | uint balance0 = IERC20(_token0).balanceOf(address(this)); 139 | uint balance1 = IERC20(_token1).balanceOf(address(this)); 140 | uint liquidity = balanceOf[address(this)]; 141 | 142 | bool feeOn = _mintFee(_reserve0, _reserve1); 143 | uint _totalSupply = totalSupply; // gas savings, must be defined here since totalSupply can update in _mintFee 144 | amount0 = liquidity.mul(balance0) / _totalSupply; // using balances ensures pro-rata distribution 145 | amount1 = liquidity.mul(balance1) / _totalSupply; // using balances ensures pro-rata distribution 146 | require(amount0 > 0 && amount1 > 0, 'UniswapV2: INSUFFICIENT_LIQUIDITY_BURNED'); 147 | _burn(address(this), liquidity); 148 | _safeTransfer(_token0, to, amount0); 149 | _safeTransfer(_token1, to, amount1); 150 | balance0 = IERC20(_token0).balanceOf(address(this)); 151 | balance1 = IERC20(_token1).balanceOf(address(this)); 152 | 153 | _update(balance0, balance1, _reserve0, _reserve1); 154 | if (feeOn) kLast = uint(reserve0).mul(reserve1); // reserve0 and reserve1 are up-to-date 155 | emit Burn(msg.sender, amount0, amount1, to); 156 | } 157 | 158 | // this low-level function should be called from a contract which performs important safety checks 159 | function swap(uint amount0Out, uint amount1Out, address to, bytes calldata data) external lock { 160 | require(amount0Out > 0 || amount1Out > 0, 'UniswapV2: INSUFFICIENT_OUTPUT_AMOUNT'); 161 | (uint112 _reserve0, uint112 _reserve1,) = getReserves(); // gas savings 162 | require(amount0Out < _reserve0 && amount1Out < _reserve1, 'UniswapV2: INSUFFICIENT_LIQUIDITY'); 163 | 164 | uint balance0; 165 | uint balance1; 166 | { // scope for _token{0,1}, avoids stack too deep errors 167 | address _token0 = token0; 168 | address _token1 = token1; 169 | require(to != _token0 && to != _token1, 'UniswapV2: INVALID_TO'); 170 | if (amount0Out > 0) _safeTransfer(_token0, to, amount0Out); // optimistically transfer tokens 171 | if (amount1Out > 0) _safeTransfer(_token1, to, amount1Out); // optimistically transfer tokens 172 | if (data.length > 0) IUniswapV2Callee(to).uniswapV2Call(msg.sender, amount0Out, amount1Out, data); 173 | balance0 = IERC20(_token0).balanceOf(address(this)); 174 | balance1 = IERC20(_token1).balanceOf(address(this)); 175 | } 176 | uint amount0In = balance0 > _reserve0 - amount0Out ? balance0 - (_reserve0 - amount0Out) : 0; 177 | uint amount1In = balance1 > _reserve1 - amount1Out ? balance1 - (_reserve1 - amount1Out) : 0; 178 | require(amount0In > 0 || amount1In > 0, 'UniswapV2: INSUFFICIENT_INPUT_AMOUNT'); 179 | { // scope for reserve{0,1}Adjusted, avoids stack too deep errors 180 | uint balance0Adjusted = balance0.mul(1000).sub(amount0In.mul(3)); 181 | uint balance1Adjusted = balance1.mul(1000).sub(amount1In.mul(3)); 182 | require(balance0Adjusted.mul(balance1Adjusted) >= uint(_reserve0).mul(_reserve1).mul(1000**2), 'UniswapV2: K'); 183 | } 184 | 185 | _update(balance0, balance1, _reserve0, _reserve1); 186 | emit Swap(msg.sender, amount0In, amount1In, amount0Out, amount1Out, to); 187 | } 188 | 189 | // force balances to match reserves 190 | function skim(address to) external lock { 191 | address _token0 = token0; // gas savings 192 | address _token1 = token1; // gas savings 193 | _safeTransfer(_token0, to, IERC20(_token0).balanceOf(address(this)).sub(reserve0)); 194 | _safeTransfer(_token1, to, IERC20(_token1).balanceOf(address(this)).sub(reserve1)); 195 | } 196 | 197 | // force reserves to match balances 198 | function sync() external lock { 199 | _update(IERC20(token0).balanceOf(address(this)), IERC20(token1).balanceOf(address(this)), reserve0, reserve1); 200 | } 201 | } 202 | -------------------------------------------------------------------------------- /contracts/interfaces/IERC20.sol: -------------------------------------------------------------------------------- 1 | pragma solidity >=0.5.0; 2 | 3 | interface IERC20 { 4 | event Approval(address indexed owner, address indexed spender, uint value); 5 | event Transfer(address indexed from, address indexed to, uint value); 6 | 7 | function name() external view returns (string memory); 8 | function symbol() external view returns (string memory); 9 | function decimals() external view returns (uint8); 10 | function totalSupply() external view returns (uint); 11 | function balanceOf(address owner) external view returns (uint); 12 | function allowance(address owner, address spender) external view returns (uint); 13 | 14 | function approve(address spender, uint value) external returns (bool); 15 | function transfer(address to, uint value) external returns (bool); 16 | function transferFrom(address from, address to, uint value) external returns (bool); 17 | } 18 | -------------------------------------------------------------------------------- /contracts/interfaces/IUniswapV2Callee.sol: -------------------------------------------------------------------------------- 1 | pragma solidity >=0.5.0; 2 | 3 | interface IUniswapV2Callee { 4 | function uniswapV2Call(address sender, uint amount0, uint amount1, bytes calldata data) external; 5 | } 6 | -------------------------------------------------------------------------------- /contracts/interfaces/IUniswapV2ERC20.sol: -------------------------------------------------------------------------------- 1 | pragma solidity >=0.5.0; 2 | 3 | interface IUniswapV2ERC20 { 4 | event Approval(address indexed owner, address indexed spender, uint value); 5 | event Transfer(address indexed from, address indexed to, uint value); 6 | 7 | function name() external pure returns (string memory); 8 | function symbol() external pure returns (string memory); 9 | function decimals() external pure returns (uint8); 10 | function totalSupply() external view returns (uint); 11 | function balanceOf(address owner) external view returns (uint); 12 | function allowance(address owner, address spender) external view returns (uint); 13 | 14 | function approve(address spender, uint value) external returns (bool); 15 | function transfer(address to, uint value) external returns (bool); 16 | function transferFrom(address from, address to, uint value) external returns (bool); 17 | 18 | function DOMAIN_SEPARATOR() external view returns (bytes32); 19 | function PERMIT_TYPEHASH() external pure returns (bytes32); 20 | function nonces(address owner) external view returns (uint); 21 | 22 | function permit(address owner, address spender, uint value, uint deadline, uint8 v, bytes32 r, bytes32 s) external; 23 | } 24 | -------------------------------------------------------------------------------- /contracts/interfaces/IUniswapV2Factory.sol: -------------------------------------------------------------------------------- 1 | pragma solidity >=0.5.0; 2 | 3 | interface IUniswapV2Factory { 4 | event PairCreated(address indexed token0, address indexed token1, address pair, uint); 5 | 6 | function feeTo() external view returns (address); 7 | function feeToSetter() external view returns (address); 8 | 9 | function getPair(address tokenA, address tokenB) external view returns (address pair); 10 | function allPairs(uint) external view returns (address pair); 11 | function allPairsLength() external view returns (uint); 12 | 13 | function createPair(address tokenA, address tokenB) external returns (address pair); 14 | 15 | function setFeeTo(address) external; 16 | function setFeeToSetter(address) external; 17 | } 18 | -------------------------------------------------------------------------------- /contracts/interfaces/IUniswapV2Pair.sol: -------------------------------------------------------------------------------- 1 | pragma solidity >=0.5.0; 2 | 3 | interface IUniswapV2Pair { 4 | event Approval(address indexed owner, address indexed spender, uint value); 5 | event Transfer(address indexed from, address indexed to, uint value); 6 | 7 | function name() external pure returns (string memory); 8 | function symbol() external pure returns (string memory); 9 | function decimals() external pure returns (uint8); 10 | function totalSupply() external view returns (uint); 11 | function balanceOf(address owner) external view returns (uint); 12 | function allowance(address owner, address spender) external view returns (uint); 13 | 14 | function approve(address spender, uint value) external returns (bool); 15 | function transfer(address to, uint value) external returns (bool); 16 | function transferFrom(address from, address to, uint value) external returns (bool); 17 | 18 | function DOMAIN_SEPARATOR() external view returns (bytes32); 19 | function PERMIT_TYPEHASH() external pure returns (bytes32); 20 | function nonces(address owner) external view returns (uint); 21 | 22 | function permit(address owner, address spender, uint value, uint deadline, uint8 v, bytes32 r, bytes32 s) external; 23 | 24 | event Mint(address indexed sender, uint amount0, uint amount1); 25 | event Burn(address indexed sender, uint amount0, uint amount1, address indexed to); 26 | event Swap( 27 | address indexed sender, 28 | uint amount0In, 29 | uint amount1In, 30 | uint amount0Out, 31 | uint amount1Out, 32 | address indexed to 33 | ); 34 | event Sync(uint112 reserve0, uint112 reserve1); 35 | 36 | function MINIMUM_LIQUIDITY() external pure returns (uint); 37 | function factory() external view returns (address); 38 | function token0() external view returns (address); 39 | function token1() external view returns (address); 40 | function getReserves() external view returns (uint112 reserve0, uint112 reserve1, uint32 blockTimestampLast); 41 | function price0CumulativeLast() external view returns (uint); 42 | function price1CumulativeLast() external view returns (uint); 43 | function kLast() external view returns (uint); 44 | 45 | function mint(address to) external returns (uint liquidity); 46 | function burn(address to) external returns (uint amount0, uint amount1); 47 | function swap(uint amount0Out, uint amount1Out, address to, bytes calldata data) external; 48 | function skim(address to) external; 49 | function sync() external; 50 | 51 | function initialize(address, address) external; 52 | } 53 | -------------------------------------------------------------------------------- /contracts/libraries/Math.sol: -------------------------------------------------------------------------------- 1 | pragma solidity =0.5.16; 2 | 3 | // a library for performing various math operations 4 | 5 | library Math { 6 | function min(uint x, uint y) internal pure returns (uint z) { 7 | z = x < y ? x : y; 8 | } 9 | 10 | // babylonian method (https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method) 11 | function sqrt(uint y) internal pure returns (uint z) { 12 | if (y > 3) { 13 | z = y; 14 | uint x = y / 2 + 1; 15 | while (x < z) { 16 | z = x; 17 | x = (y / x + x) / 2; 18 | } 19 | } else if (y != 0) { 20 | z = 1; 21 | } 22 | } 23 | } 24 | -------------------------------------------------------------------------------- /contracts/libraries/SafeMath.sol: -------------------------------------------------------------------------------- 1 | pragma solidity =0.5.16; 2 | 3 | // a library for performing overflow-safe math, courtesy of DappHub (https://github.com/dapphub/ds-math) 4 | 5 | library SafeMath { 6 | function add(uint x, uint y) internal pure returns (uint z) { 7 | require((z = x + y) >= x, 'ds-math-add-overflow'); 8 | } 9 | 10 | function sub(uint x, uint y) internal pure returns (uint z) { 11 | require((z = x - y) <= x, 'ds-math-sub-underflow'); 12 | } 13 | 14 | function mul(uint x, uint y) internal pure returns (uint z) { 15 | require(y == 0 || (z = x * y) / y == x, 'ds-math-mul-overflow'); 16 | } 17 | } 18 | -------------------------------------------------------------------------------- /contracts/libraries/UQ112x112.sol: -------------------------------------------------------------------------------- 1 | pragma solidity =0.5.16; 2 | 3 | // a library for handling binary fixed point numbers (https://en.wikipedia.org/wiki/Q_(number_format)) 4 | 5 | // range: [0, 2**112 - 1] 6 | // resolution: 1 / 2**112 7 | 8 | library UQ112x112 { 9 | uint224 constant Q112 = 2**112; 10 | 11 | // encode a uint112 as a UQ112x112 12 | function encode(uint112 y) internal pure returns (uint224 z) { 13 | z = uint224(y) * Q112; // never overflows 14 | } 15 | 16 | // divide a UQ112x112 by a uint112, returning a UQ112x112 17 | function uqdiv(uint224 x, uint112 y) internal pure returns (uint224 z) { 18 | z = x / uint224(y); 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /contracts/test/ERC20.sol: -------------------------------------------------------------------------------- 1 | pragma solidity =0.5.16; 2 | 3 | import '../UniswapV2ERC20.sol'; 4 | 5 | contract ERC20 is UniswapV2ERC20 { 6 | constructor(uint _totalSupply) public { 7 | _mint(msg.sender, _totalSupply); 8 | } 9 | } 10 | -------------------------------------------------------------------------------- /package.json: -------------------------------------------------------------------------------- 1 | { 2 | "name": "@uniswap/v2-core", 3 | "description": "🎛 Core contracts for the UniswapV2 protocol", 4 | "version": "1.0.1", 5 | "homepage": "https://uniswap.org", 6 | "repository": { 7 | "type": "git", 8 | "url": "https://github.com/Uniswap/uniswap-v2-core" 9 | }, 10 | "keywords": [ 11 | "uniswap", 12 | "ethereum", 13 | "v2", 14 | "core", 15 | "uniswap-v2" 16 | ], 17 | "files": [ 18 | "contracts", 19 | "build" 20 | ], 21 | "engines": { 22 | "node": ">=10" 23 | }, 24 | "devDependencies": { 25 | "@types/chai": "^4.2.6", 26 | "@types/mocha": "^5.2.7", 27 | "chai": "^4.2.0", 28 | "ethereum-waffle": "^2.4.1", 29 | "ethereumjs-util": "^6.2.0", 30 | "mocha": "^6.2.2", 31 | "prettier": "^1.19.1", 32 | "rimraf": "^3.0.0", 33 | "solc": "0.5.16", 34 | "ts-node": "^8.5.4", 35 | "typescript": "^3.7.3" 36 | }, 37 | "scripts": { 38 | "lint": "yarn prettier ./test/*.ts --check", 39 | "lint:fix": "yarn prettier ./test/*.ts --write", 40 | "clean": "rimraf ./build/", 41 | "precompile": "yarn clean", 42 | "compile": "waffle .waffle.json", 43 | "pretest": "yarn compile", 44 | "test": "mocha", 45 | "prepublishOnly": "yarn test" 46 | }, 47 | "license": "GPL-3.0-or-later" 48 | } 49 | -------------------------------------------------------------------------------- /test/UniswapV2ERC20.spec.ts: -------------------------------------------------------------------------------- 1 | import chai, { expect } from 'chai' 2 | import { Contract } from 'ethers' 3 | import { MaxUint256 } from 'ethers/constants' 4 | import { bigNumberify, hexlify, keccak256, defaultAbiCoder, toUtf8Bytes } from 'ethers/utils' 5 | import { solidity, MockProvider, deployContract } from 'ethereum-waffle' 6 | import { ecsign } from 'ethereumjs-util' 7 | 8 | import { expandTo18Decimals, getApprovalDigest } from './shared/utilities' 9 | 10 | import ERC20 from '../build/ERC20.json' 11 | 12 | chai.use(solidity) 13 | 14 | const TOTAL_SUPPLY = expandTo18Decimals(10000) 15 | const TEST_AMOUNT = expandTo18Decimals(10) 16 | 17 | describe('UniswapV2ERC20', () => { 18 | const provider = new MockProvider({ 19 | hardfork: 'istanbul', 20 | mnemonic: 'horn horn horn horn horn horn horn horn horn horn horn horn', 21 | gasLimit: 9999999 22 | }) 23 | const [wallet, other] = provider.getWallets() 24 | 25 | let token: Contract 26 | beforeEach(async () => { 27 | token = await deployContract(wallet, ERC20, [TOTAL_SUPPLY]) 28 | }) 29 | 30 | it('name, symbol, decimals, totalSupply, balanceOf, DOMAIN_SEPARATOR, PERMIT_TYPEHASH', async () => { 31 | const name = await token.name() 32 | expect(name).to.eq('Uniswap V2') 33 | expect(await token.symbol()).to.eq('UNI-V2') 34 | expect(await token.decimals()).to.eq(18) 35 | expect(await token.totalSupply()).to.eq(TOTAL_SUPPLY) 36 | expect(await token.balanceOf(wallet.address)).to.eq(TOTAL_SUPPLY) 37 | expect(await token.DOMAIN_SEPARATOR()).to.eq( 38 | keccak256( 39 | defaultAbiCoder.encode( 40 | ['bytes32', 'bytes32', 'bytes32', 'uint256', 'address'], 41 | [ 42 | keccak256( 43 | toUtf8Bytes('EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)') 44 | ), 45 | keccak256(toUtf8Bytes(name)), 46 | keccak256(toUtf8Bytes('1')), 47 | 1, 48 | token.address 49 | ] 50 | ) 51 | ) 52 | ) 53 | expect(await token.PERMIT_TYPEHASH()).to.eq( 54 | keccak256(toUtf8Bytes('Permit(address owner,address spender,uint256 value,uint256 nonce,uint256 deadline)')) 55 | ) 56 | }) 57 | 58 | it('approve', async () => { 59 | await expect(token.approve(other.address, TEST_AMOUNT)) 60 | .to.emit(token, 'Approval') 61 | .withArgs(wallet.address, other.address, TEST_AMOUNT) 62 | expect(await token.allowance(wallet.address, other.address)).to.eq(TEST_AMOUNT) 63 | }) 64 | 65 | it('transfer', async () => { 66 | await expect(token.transfer(other.address, TEST_AMOUNT)) 67 | .to.emit(token, 'Transfer') 68 | .withArgs(wallet.address, other.address, TEST_AMOUNT) 69 | expect(await token.balanceOf(wallet.address)).to.eq(TOTAL_SUPPLY.sub(TEST_AMOUNT)) 70 | expect(await token.balanceOf(other.address)).to.eq(TEST_AMOUNT) 71 | }) 72 | 73 | it('transfer:fail', async () => { 74 | await expect(token.transfer(other.address, TOTAL_SUPPLY.add(1))).to.be.reverted // ds-math-sub-underflow 75 | await expect(token.connect(other).transfer(wallet.address, 1)).to.be.reverted // ds-math-sub-underflow 76 | }) 77 | 78 | it('transferFrom', async () => { 79 | await token.approve(other.address, TEST_AMOUNT) 80 | await expect(token.connect(other).transferFrom(wallet.address, other.address, TEST_AMOUNT)) 81 | .to.emit(token, 'Transfer') 82 | .withArgs(wallet.address, other.address, TEST_AMOUNT) 83 | expect(await token.allowance(wallet.address, other.address)).to.eq(0) 84 | expect(await token.balanceOf(wallet.address)).to.eq(TOTAL_SUPPLY.sub(TEST_AMOUNT)) 85 | expect(await token.balanceOf(other.address)).to.eq(TEST_AMOUNT) 86 | }) 87 | 88 | it('transferFrom:max', async () => { 89 | await token.approve(other.address, MaxUint256) 90 | await expect(token.connect(other).transferFrom(wallet.address, other.address, TEST_AMOUNT)) 91 | .to.emit(token, 'Transfer') 92 | .withArgs(wallet.address, other.address, TEST_AMOUNT) 93 | expect(await token.allowance(wallet.address, other.address)).to.eq(MaxUint256) 94 | expect(await token.balanceOf(wallet.address)).to.eq(TOTAL_SUPPLY.sub(TEST_AMOUNT)) 95 | expect(await token.balanceOf(other.address)).to.eq(TEST_AMOUNT) 96 | }) 97 | 98 | it('permit', async () => { 99 | const nonce = await token.nonces(wallet.address) 100 | const deadline = MaxUint256 101 | const digest = await getApprovalDigest( 102 | token, 103 | { owner: wallet.address, spender: other.address, value: TEST_AMOUNT }, 104 | nonce, 105 | deadline 106 | ) 107 | 108 | const { v, r, s } = ecsign(Buffer.from(digest.slice(2), 'hex'), Buffer.from(wallet.privateKey.slice(2), 'hex')) 109 | 110 | await expect(token.permit(wallet.address, other.address, TEST_AMOUNT, deadline, v, hexlify(r), hexlify(s))) 111 | .to.emit(token, 'Approval') 112 | .withArgs(wallet.address, other.address, TEST_AMOUNT) 113 | expect(await token.allowance(wallet.address, other.address)).to.eq(TEST_AMOUNT) 114 | expect(await token.nonces(wallet.address)).to.eq(bigNumberify(1)) 115 | }) 116 | }) 117 | -------------------------------------------------------------------------------- /test/UniswapV2Factory.spec.ts: -------------------------------------------------------------------------------- 1 | import chai, { expect } from 'chai' 2 | import { Contract } from 'ethers' 3 | import { AddressZero } from 'ethers/constants' 4 | import { bigNumberify } from 'ethers/utils' 5 | import { solidity, MockProvider, createFixtureLoader } from 'ethereum-waffle' 6 | 7 | import { getCreate2Address } from './shared/utilities' 8 | import { factoryFixture } from './shared/fixtures' 9 | 10 | import UniswapV2Pair from '../build/UniswapV2Pair.json' 11 | 12 | chai.use(solidity) 13 | 14 | const TEST_ADDRESSES: [string, string] = [ 15 | '0x1000000000000000000000000000000000000000', 16 | '0x2000000000000000000000000000000000000000' 17 | ] 18 | 19 | describe('UniswapV2Factory', () => { 20 | const provider = new MockProvider({ 21 | hardfork: 'istanbul', 22 | mnemonic: 'horn horn horn horn horn horn horn horn horn horn horn horn', 23 | gasLimit: 9999999 24 | }) 25 | const [wallet, other] = provider.getWallets() 26 | const loadFixture = createFixtureLoader(provider, [wallet, other]) 27 | 28 | let factory: Contract 29 | beforeEach(async () => { 30 | const fixture = await loadFixture(factoryFixture) 31 | factory = fixture.factory 32 | }) 33 | 34 | it('feeTo, feeToSetter, allPairsLength', async () => { 35 | expect(await factory.feeTo()).to.eq(AddressZero) 36 | expect(await factory.feeToSetter()).to.eq(wallet.address) 37 | expect(await factory.allPairsLength()).to.eq(0) 38 | }) 39 | 40 | async function createPair(tokens: [string, string]) { 41 | const bytecode = `0x${UniswapV2Pair.evm.bytecode.object}` 42 | const create2Address = getCreate2Address(factory.address, tokens, bytecode) 43 | await expect(factory.createPair(...tokens)) 44 | .to.emit(factory, 'PairCreated') 45 | .withArgs(TEST_ADDRESSES[0], TEST_ADDRESSES[1], create2Address, bigNumberify(1)) 46 | 47 | await expect(factory.createPair(...tokens)).to.be.reverted // UniswapV2: PAIR_EXISTS 48 | await expect(factory.createPair(...tokens.slice().reverse())).to.be.reverted // UniswapV2: PAIR_EXISTS 49 | expect(await factory.getPair(...tokens)).to.eq(create2Address) 50 | expect(await factory.getPair(...tokens.slice().reverse())).to.eq(create2Address) 51 | expect(await factory.allPairs(0)).to.eq(create2Address) 52 | expect(await factory.allPairsLength()).to.eq(1) 53 | 54 | const pair = new Contract(create2Address, JSON.stringify(UniswapV2Pair.abi), provider) 55 | expect(await pair.factory()).to.eq(factory.address) 56 | expect(await pair.token0()).to.eq(TEST_ADDRESSES[0]) 57 | expect(await pair.token1()).to.eq(TEST_ADDRESSES[1]) 58 | } 59 | 60 | it('createPair', async () => { 61 | await createPair(TEST_ADDRESSES) 62 | }) 63 | 64 | it('createPair:reverse', async () => { 65 | await createPair(TEST_ADDRESSES.slice().reverse() as [string, string]) 66 | }) 67 | 68 | it('createPair:gas', async () => { 69 | const tx = await factory.createPair(...TEST_ADDRESSES) 70 | const receipt = await tx.wait() 71 | expect(receipt.gasUsed).to.eq(2512920) 72 | }) 73 | 74 | it('setFeeTo', async () => { 75 | await expect(factory.connect(other).setFeeTo(other.address)).to.be.revertedWith('UniswapV2: FORBIDDEN') 76 | await factory.setFeeTo(wallet.address) 77 | expect(await factory.feeTo()).to.eq(wallet.address) 78 | }) 79 | 80 | it('setFeeToSetter', async () => { 81 | await expect(factory.connect(other).setFeeToSetter(other.address)).to.be.revertedWith('UniswapV2: FORBIDDEN') 82 | await factory.setFeeToSetter(other.address) 83 | expect(await factory.feeToSetter()).to.eq(other.address) 84 | await expect(factory.setFeeToSetter(wallet.address)).to.be.revertedWith('UniswapV2: FORBIDDEN') 85 | }) 86 | }) 87 | -------------------------------------------------------------------------------- /test/UniswapV2Pair.spec.ts: -------------------------------------------------------------------------------- 1 | import chai, { expect } from 'chai' 2 | import { Contract } from 'ethers' 3 | import { solidity, MockProvider, createFixtureLoader } from 'ethereum-waffle' 4 | import { BigNumber, bigNumberify } from 'ethers/utils' 5 | 6 | import { expandTo18Decimals, mineBlock, encodePrice } from './shared/utilities' 7 | import { pairFixture } from './shared/fixtures' 8 | import { AddressZero } from 'ethers/constants' 9 | 10 | const MINIMUM_LIQUIDITY = bigNumberify(10).pow(3) 11 | 12 | chai.use(solidity) 13 | 14 | const overrides = { 15 | gasLimit: 9999999 16 | } 17 | 18 | describe('UniswapV2Pair', () => { 19 | const provider = new MockProvider({ 20 | hardfork: 'istanbul', 21 | mnemonic: 'horn horn horn horn horn horn horn horn horn horn horn horn', 22 | gasLimit: 9999999 23 | }) 24 | const [wallet, other] = provider.getWallets() 25 | const loadFixture = createFixtureLoader(provider, [wallet]) 26 | 27 | let factory: Contract 28 | let token0: Contract 29 | let token1: Contract 30 | let pair: Contract 31 | beforeEach(async () => { 32 | const fixture = await loadFixture(pairFixture) 33 | factory = fixture.factory 34 | token0 = fixture.token0 35 | token1 = fixture.token1 36 | pair = fixture.pair 37 | }) 38 | 39 | it('mint', async () => { 40 | const token0Amount = expandTo18Decimals(1) 41 | const token1Amount = expandTo18Decimals(4) 42 | await token0.transfer(pair.address, token0Amount) 43 | await token1.transfer(pair.address, token1Amount) 44 | 45 | const expectedLiquidity = expandTo18Decimals(2) 46 | await expect(pair.mint(wallet.address, overrides)) 47 | .to.emit(pair, 'Transfer') 48 | .withArgs(AddressZero, AddressZero, MINIMUM_LIQUIDITY) 49 | .to.emit(pair, 'Transfer') 50 | .withArgs(AddressZero, wallet.address, expectedLiquidity.sub(MINIMUM_LIQUIDITY)) 51 | .to.emit(pair, 'Sync') 52 | .withArgs(token0Amount, token1Amount) 53 | .to.emit(pair, 'Mint') 54 | .withArgs(wallet.address, token0Amount, token1Amount) 55 | 56 | expect(await pair.totalSupply()).to.eq(expectedLiquidity) 57 | expect(await pair.balanceOf(wallet.address)).to.eq(expectedLiquidity.sub(MINIMUM_LIQUIDITY)) 58 | expect(await token0.balanceOf(pair.address)).to.eq(token0Amount) 59 | expect(await token1.balanceOf(pair.address)).to.eq(token1Amount) 60 | const reserves = await pair.getReserves() 61 | expect(reserves[0]).to.eq(token0Amount) 62 | expect(reserves[1]).to.eq(token1Amount) 63 | }) 64 | 65 | async function addLiquidity(token0Amount: BigNumber, token1Amount: BigNumber) { 66 | await token0.transfer(pair.address, token0Amount) 67 | await token1.transfer(pair.address, token1Amount) 68 | await pair.mint(wallet.address, overrides) 69 | } 70 | const swapTestCases: BigNumber[][] = [ 71 | [1, 5, 10, '1662497915624478906'], 72 | [1, 10, 5, '453305446940074565'], 73 | 74 | [2, 5, 10, '2851015155847869602'], 75 | [2, 10, 5, '831248957812239453'], 76 | 77 | [1, 10, 10, '906610893880149131'], 78 | [1, 100, 100, '987158034397061298'], 79 | [1, 1000, 1000, '996006981039903216'] 80 | ].map(a => a.map(n => (typeof n === 'string' ? bigNumberify(n) : expandTo18Decimals(n)))) 81 | swapTestCases.forEach((swapTestCase, i) => { 82 | it(`getInputPrice:${i}`, async () => { 83 | const [swapAmount, token0Amount, token1Amount, expectedOutputAmount] = swapTestCase 84 | await addLiquidity(token0Amount, token1Amount) 85 | await token0.transfer(pair.address, swapAmount) 86 | await expect(pair.swap(0, expectedOutputAmount.add(1), wallet.address, '0x', overrides)).to.be.revertedWith( 87 | 'UniswapV2: K' 88 | ) 89 | await pair.swap(0, expectedOutputAmount, wallet.address, '0x', overrides) 90 | }) 91 | }) 92 | 93 | const optimisticTestCases: BigNumber[][] = [ 94 | ['997000000000000000', 5, 10, 1], // given amountIn, amountOut = floor(amountIn * .997) 95 | ['997000000000000000', 10, 5, 1], 96 | ['997000000000000000', 5, 5, 1], 97 | [1, 5, 5, '1003009027081243732'] // given amountOut, amountIn = ceiling(amountOut / .997) 98 | ].map(a => a.map(n => (typeof n === 'string' ? bigNumberify(n) : expandTo18Decimals(n)))) 99 | optimisticTestCases.forEach((optimisticTestCase, i) => { 100 | it(`optimistic:${i}`, async () => { 101 | const [outputAmount, token0Amount, token1Amount, inputAmount] = optimisticTestCase 102 | await addLiquidity(token0Amount, token1Amount) 103 | await token0.transfer(pair.address, inputAmount) 104 | await expect(pair.swap(outputAmount.add(1), 0, wallet.address, '0x', overrides)).to.be.revertedWith( 105 | 'UniswapV2: K' 106 | ) 107 | await pair.swap(outputAmount, 0, wallet.address, '0x', overrides) 108 | }) 109 | }) 110 | 111 | it('swap:token0', async () => { 112 | const token0Amount = expandTo18Decimals(5) 113 | const token1Amount = expandTo18Decimals(10) 114 | await addLiquidity(token0Amount, token1Amount) 115 | 116 | const swapAmount = expandTo18Decimals(1) 117 | const expectedOutputAmount = bigNumberify('1662497915624478906') 118 | await token0.transfer(pair.address, swapAmount) 119 | await expect(pair.swap(0, expectedOutputAmount, wallet.address, '0x', overrides)) 120 | .to.emit(token1, 'Transfer') 121 | .withArgs(pair.address, wallet.address, expectedOutputAmount) 122 | .to.emit(pair, 'Sync') 123 | .withArgs(token0Amount.add(swapAmount), token1Amount.sub(expectedOutputAmount)) 124 | .to.emit(pair, 'Swap') 125 | .withArgs(wallet.address, swapAmount, 0, 0, expectedOutputAmount, wallet.address) 126 | 127 | const reserves = await pair.getReserves() 128 | expect(reserves[0]).to.eq(token0Amount.add(swapAmount)) 129 | expect(reserves[1]).to.eq(token1Amount.sub(expectedOutputAmount)) 130 | expect(await token0.balanceOf(pair.address)).to.eq(token0Amount.add(swapAmount)) 131 | expect(await token1.balanceOf(pair.address)).to.eq(token1Amount.sub(expectedOutputAmount)) 132 | const totalSupplyToken0 = await token0.totalSupply() 133 | const totalSupplyToken1 = await token1.totalSupply() 134 | expect(await token0.balanceOf(wallet.address)).to.eq(totalSupplyToken0.sub(token0Amount).sub(swapAmount)) 135 | expect(await token1.balanceOf(wallet.address)).to.eq(totalSupplyToken1.sub(token1Amount).add(expectedOutputAmount)) 136 | }) 137 | 138 | it('swap:token1', async () => { 139 | const token0Amount = expandTo18Decimals(5) 140 | const token1Amount = expandTo18Decimals(10) 141 | await addLiquidity(token0Amount, token1Amount) 142 | 143 | const swapAmount = expandTo18Decimals(1) 144 | const expectedOutputAmount = bigNumberify('453305446940074565') 145 | await token1.transfer(pair.address, swapAmount) 146 | await expect(pair.swap(expectedOutputAmount, 0, wallet.address, '0x', overrides)) 147 | .to.emit(token0, 'Transfer') 148 | .withArgs(pair.address, wallet.address, expectedOutputAmount) 149 | .to.emit(pair, 'Sync') 150 | .withArgs(token0Amount.sub(expectedOutputAmount), token1Amount.add(swapAmount)) 151 | .to.emit(pair, 'Swap') 152 | .withArgs(wallet.address, 0, swapAmount, expectedOutputAmount, 0, wallet.address) 153 | 154 | const reserves = await pair.getReserves() 155 | expect(reserves[0]).to.eq(token0Amount.sub(expectedOutputAmount)) 156 | expect(reserves[1]).to.eq(token1Amount.add(swapAmount)) 157 | expect(await token0.balanceOf(pair.address)).to.eq(token0Amount.sub(expectedOutputAmount)) 158 | expect(await token1.balanceOf(pair.address)).to.eq(token1Amount.add(swapAmount)) 159 | const totalSupplyToken0 = await token0.totalSupply() 160 | const totalSupplyToken1 = await token1.totalSupply() 161 | expect(await token0.balanceOf(wallet.address)).to.eq(totalSupplyToken0.sub(token0Amount).add(expectedOutputAmount)) 162 | expect(await token1.balanceOf(wallet.address)).to.eq(totalSupplyToken1.sub(token1Amount).sub(swapAmount)) 163 | }) 164 | 165 | it('swap:gas', async () => { 166 | const token0Amount = expandTo18Decimals(5) 167 | const token1Amount = expandTo18Decimals(10) 168 | await addLiquidity(token0Amount, token1Amount) 169 | 170 | // ensure that setting price{0,1}CumulativeLast for the first time doesn't affect our gas math 171 | await mineBlock(provider, (await provider.getBlock('latest')).timestamp + 1) 172 | await pair.sync(overrides) 173 | 174 | const swapAmount = expandTo18Decimals(1) 175 | const expectedOutputAmount = bigNumberify('453305446940074565') 176 | await token1.transfer(pair.address, swapAmount) 177 | await mineBlock(provider, (await provider.getBlock('latest')).timestamp + 1) 178 | const tx = await pair.swap(expectedOutputAmount, 0, wallet.address, '0x', overrides) 179 | const receipt = await tx.wait() 180 | expect(receipt.gasUsed).to.eq(73462) 181 | }) 182 | 183 | it('burn', async () => { 184 | const token0Amount = expandTo18Decimals(3) 185 | const token1Amount = expandTo18Decimals(3) 186 | await addLiquidity(token0Amount, token1Amount) 187 | 188 | const expectedLiquidity = expandTo18Decimals(3) 189 | await pair.transfer(pair.address, expectedLiquidity.sub(MINIMUM_LIQUIDITY)) 190 | await expect(pair.burn(wallet.address, overrides)) 191 | .to.emit(pair, 'Transfer') 192 | .withArgs(pair.address, AddressZero, expectedLiquidity.sub(MINIMUM_LIQUIDITY)) 193 | .to.emit(token0, 'Transfer') 194 | .withArgs(pair.address, wallet.address, token0Amount.sub(1000)) 195 | .to.emit(token1, 'Transfer') 196 | .withArgs(pair.address, wallet.address, token1Amount.sub(1000)) 197 | .to.emit(pair, 'Sync') 198 | .withArgs(1000, 1000) 199 | .to.emit(pair, 'Burn') 200 | .withArgs(wallet.address, token0Amount.sub(1000), token1Amount.sub(1000), wallet.address) 201 | 202 | expect(await pair.balanceOf(wallet.address)).to.eq(0) 203 | expect(await pair.totalSupply()).to.eq(MINIMUM_LIQUIDITY) 204 | expect(await token0.balanceOf(pair.address)).to.eq(1000) 205 | expect(await token1.balanceOf(pair.address)).to.eq(1000) 206 | const totalSupplyToken0 = await token0.totalSupply() 207 | const totalSupplyToken1 = await token1.totalSupply() 208 | expect(await token0.balanceOf(wallet.address)).to.eq(totalSupplyToken0.sub(1000)) 209 | expect(await token1.balanceOf(wallet.address)).to.eq(totalSupplyToken1.sub(1000)) 210 | }) 211 | 212 | it('price{0,1}CumulativeLast', async () => { 213 | const token0Amount = expandTo18Decimals(3) 214 | const token1Amount = expandTo18Decimals(3) 215 | await addLiquidity(token0Amount, token1Amount) 216 | 217 | const blockTimestamp = (await pair.getReserves())[2] 218 | await mineBlock(provider, blockTimestamp + 1) 219 | await pair.sync(overrides) 220 | 221 | const initialPrice = encodePrice(token0Amount, token1Amount) 222 | expect(await pair.price0CumulativeLast()).to.eq(initialPrice[0]) 223 | expect(await pair.price1CumulativeLast()).to.eq(initialPrice[1]) 224 | expect((await pair.getReserves())[2]).to.eq(blockTimestamp + 1) 225 | 226 | const swapAmount = expandTo18Decimals(3) 227 | await token0.transfer(pair.address, swapAmount) 228 | await mineBlock(provider, blockTimestamp + 10) 229 | // swap to a new price eagerly instead of syncing 230 | await pair.swap(0, expandTo18Decimals(1), wallet.address, '0x', overrides) // make the price nice 231 | 232 | expect(await pair.price0CumulativeLast()).to.eq(initialPrice[0].mul(10)) 233 | expect(await pair.price1CumulativeLast()).to.eq(initialPrice[1].mul(10)) 234 | expect((await pair.getReserves())[2]).to.eq(blockTimestamp + 10) 235 | 236 | await mineBlock(provider, blockTimestamp + 20) 237 | await pair.sync(overrides) 238 | 239 | const newPrice = encodePrice(expandTo18Decimals(6), expandTo18Decimals(2)) 240 | expect(await pair.price0CumulativeLast()).to.eq(initialPrice[0].mul(10).add(newPrice[0].mul(10))) 241 | expect(await pair.price1CumulativeLast()).to.eq(initialPrice[1].mul(10).add(newPrice[1].mul(10))) 242 | expect((await pair.getReserves())[2]).to.eq(blockTimestamp + 20) 243 | }) 244 | 245 | it('feeTo:off', async () => { 246 | const token0Amount = expandTo18Decimals(1000) 247 | const token1Amount = expandTo18Decimals(1000) 248 | await addLiquidity(token0Amount, token1Amount) 249 | 250 | const swapAmount = expandTo18Decimals(1) 251 | const expectedOutputAmount = bigNumberify('996006981039903216') 252 | await token1.transfer(pair.address, swapAmount) 253 | await pair.swap(expectedOutputAmount, 0, wallet.address, '0x', overrides) 254 | 255 | const expectedLiquidity = expandTo18Decimals(1000) 256 | await pair.transfer(pair.address, expectedLiquidity.sub(MINIMUM_LIQUIDITY)) 257 | await pair.burn(wallet.address, overrides) 258 | expect(await pair.totalSupply()).to.eq(MINIMUM_LIQUIDITY) 259 | }) 260 | 261 | it('feeTo:on', async () => { 262 | await factory.setFeeTo(other.address) 263 | 264 | const token0Amount = expandTo18Decimals(1000) 265 | const token1Amount = expandTo18Decimals(1000) 266 | await addLiquidity(token0Amount, token1Amount) 267 | 268 | const swapAmount = expandTo18Decimals(1) 269 | const expectedOutputAmount = bigNumberify('996006981039903216') 270 | await token1.transfer(pair.address, swapAmount) 271 | await pair.swap(expectedOutputAmount, 0, wallet.address, '0x', overrides) 272 | 273 | const expectedLiquidity = expandTo18Decimals(1000) 274 | await pair.transfer(pair.address, expectedLiquidity.sub(MINIMUM_LIQUIDITY)) 275 | await pair.burn(wallet.address, overrides) 276 | expect(await pair.totalSupply()).to.eq(MINIMUM_LIQUIDITY.add('249750499251388')) 277 | expect(await pair.balanceOf(other.address)).to.eq('249750499251388') 278 | 279 | // using 1000 here instead of the symbolic MINIMUM_LIQUIDITY because the amounts only happen to be equal... 280 | // ...because the initial liquidity amounts were equal 281 | expect(await token0.balanceOf(pair.address)).to.eq(bigNumberify(1000).add('249501683697445')) 282 | expect(await token1.balanceOf(pair.address)).to.eq(bigNumberify(1000).add('250000187312969')) 283 | }) 284 | }) 285 | -------------------------------------------------------------------------------- /test/shared/fixtures.ts: -------------------------------------------------------------------------------- 1 | import { Contract, Wallet } from 'ethers' 2 | import { Web3Provider } from 'ethers/providers' 3 | import { deployContract } from 'ethereum-waffle' 4 | 5 | import { expandTo18Decimals } from './utilities' 6 | 7 | import ERC20 from '../../build/ERC20.json' 8 | import UniswapV2Factory from '../../build/UniswapV2Factory.json' 9 | import UniswapV2Pair from '../../build/UniswapV2Pair.json' 10 | 11 | interface FactoryFixture { 12 | factory: Contract 13 | } 14 | 15 | const overrides = { 16 | gasLimit: 9999999 17 | } 18 | 19 | export async function factoryFixture(_: Web3Provider, [wallet]: Wallet[]): Promise { 20 | const factory = await deployContract(wallet, UniswapV2Factory, [wallet.address], overrides) 21 | return { factory } 22 | } 23 | 24 | interface PairFixture extends FactoryFixture { 25 | token0: Contract 26 | token1: Contract 27 | pair: Contract 28 | } 29 | 30 | export async function pairFixture(provider: Web3Provider, [wallet]: Wallet[]): Promise { 31 | const { factory } = await factoryFixture(provider, [wallet]) 32 | 33 | const tokenA = await deployContract(wallet, ERC20, [expandTo18Decimals(10000)], overrides) 34 | const tokenB = await deployContract(wallet, ERC20, [expandTo18Decimals(10000)], overrides) 35 | 36 | await factory.createPair(tokenA.address, tokenB.address, overrides) 37 | const pairAddress = await factory.getPair(tokenA.address, tokenB.address) 38 | const pair = new Contract(pairAddress, JSON.stringify(UniswapV2Pair.abi), provider).connect(wallet) 39 | 40 | const token0Address = (await pair.token0()).address 41 | const token0 = tokenA.address === token0Address ? tokenA : tokenB 42 | const token1 = tokenA.address === token0Address ? tokenB : tokenA 43 | 44 | return { factory, token0, token1, pair } 45 | } 46 | -------------------------------------------------------------------------------- /test/shared/utilities.ts: -------------------------------------------------------------------------------- 1 | import { Contract } from 'ethers' 2 | import { Web3Provider } from 'ethers/providers' 3 | import { 4 | BigNumber, 5 | bigNumberify, 6 | getAddress, 7 | keccak256, 8 | defaultAbiCoder, 9 | toUtf8Bytes, 10 | solidityPack 11 | } from 'ethers/utils' 12 | 13 | const PERMIT_TYPEHASH = keccak256( 14 | toUtf8Bytes('Permit(address owner,address spender,uint256 value,uint256 nonce,uint256 deadline)') 15 | ) 16 | 17 | export function expandTo18Decimals(n: number): BigNumber { 18 | return bigNumberify(n).mul(bigNumberify(10).pow(18)) 19 | } 20 | 21 | function getDomainSeparator(name: string, tokenAddress: string) { 22 | return keccak256( 23 | defaultAbiCoder.encode( 24 | ['bytes32', 'bytes32', 'bytes32', 'uint256', 'address'], 25 | [ 26 | keccak256(toUtf8Bytes('EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)')), 27 | keccak256(toUtf8Bytes(name)), 28 | keccak256(toUtf8Bytes('1')), 29 | 1, 30 | tokenAddress 31 | ] 32 | ) 33 | ) 34 | } 35 | 36 | export function getCreate2Address( 37 | factoryAddress: string, 38 | [tokenA, tokenB]: [string, string], 39 | bytecode: string 40 | ): string { 41 | const [token0, token1] = tokenA < tokenB ? [tokenA, tokenB] : [tokenB, tokenA] 42 | const create2Inputs = [ 43 | '0xff', 44 | factoryAddress, 45 | keccak256(solidityPack(['address', 'address'], [token0, token1])), 46 | keccak256(bytecode) 47 | ] 48 | const sanitizedInputs = `0x${create2Inputs.map(i => i.slice(2)).join('')}` 49 | return getAddress(`0x${keccak256(sanitizedInputs).slice(-40)}`) 50 | } 51 | 52 | export async function getApprovalDigest( 53 | token: Contract, 54 | approve: { 55 | owner: string 56 | spender: string 57 | value: BigNumber 58 | }, 59 | nonce: BigNumber, 60 | deadline: BigNumber 61 | ): Promise { 62 | const name = await token.name() 63 | const DOMAIN_SEPARATOR = getDomainSeparator(name, token.address) 64 | return keccak256( 65 | solidityPack( 66 | ['bytes1', 'bytes1', 'bytes32', 'bytes32'], 67 | [ 68 | '0x19', 69 | '0x01', 70 | DOMAIN_SEPARATOR, 71 | keccak256( 72 | defaultAbiCoder.encode( 73 | ['bytes32', 'address', 'address', 'uint256', 'uint256', 'uint256'], 74 | [PERMIT_TYPEHASH, approve.owner, approve.spender, approve.value, nonce, deadline] 75 | ) 76 | ) 77 | ] 78 | ) 79 | ) 80 | } 81 | 82 | export async function mineBlock(provider: Web3Provider, timestamp: number): Promise { 83 | await new Promise(async (resolve, reject) => { 84 | ;(provider._web3Provider.sendAsync as any)( 85 | { jsonrpc: '2.0', method: 'evm_mine', params: [timestamp] }, 86 | (error: any, result: any): void => { 87 | if (error) { 88 | reject(error) 89 | } else { 90 | resolve(result) 91 | } 92 | } 93 | ) 94 | }) 95 | } 96 | 97 | export function encodePrice(reserve0: BigNumber, reserve1: BigNumber) { 98 | return [reserve1.mul(bigNumberify(2).pow(112)).div(reserve0), reserve0.mul(bigNumberify(2).pow(112)).div(reserve1)] 99 | } 100 | -------------------------------------------------------------------------------- /tsconfig.json: -------------------------------------------------------------------------------- 1 | { 2 | "compilerOptions": { 3 | "target": "es5", 4 | "module": "commonjs", 5 | "strict": true, 6 | "esModuleInterop": true, 7 | "resolveJsonModule": true 8 | } 9 | } 10 | --------------------------------------------------------------------------------