├── COPYING ├── README.md ├── default.nix └── nix-repl.cc /COPYING: -------------------------------------------------------------------------------- 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 | # This repository is obsolete! 2 | 3 | The `nix-repl` program has been merged into Nix. Starting with Nix 4 | 1.12, it is available as the `nix repl` command. 5 | -------------------------------------------------------------------------------- /default.nix: -------------------------------------------------------------------------------- 1 | { nixpkgs ? , system ? builtins.currentSystem }: 2 | 3 | with import nixpkgs { inherit system; }; 4 | 5 | let nix = nixUnstable; in 6 | 7 | runCommandCC "nix-repl" 8 | { buildInputs = [ pkgconfig readline nix boehmgc ]; } 9 | '' 10 | mkdir -p $out/bin 11 | g++ -O3 -Wall -std=c++14 \ 12 | -o $out/bin/nix-repl ${./nix-repl.cc} \ 13 | $(pkg-config --cflags nix-main) \ 14 | -lnixformat -lnixutil -lnixstore -lnixexpr -lnixmain -lreadline -lgc \ 15 | -DNIX_VERSION=\"${(builtins.parseDrvName nix.name).version}\" 16 | '' 17 | -------------------------------------------------------------------------------- /nix-repl.cc: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | #include 4 | #include 5 | 6 | #include 7 | 8 | #include 9 | #include 10 | 11 | #include "shared.hh" 12 | #include "eval.hh" 13 | #include "eval-inline.hh" 14 | #include "store-api.hh" 15 | #include "common-opts.hh" 16 | #include "get-drvs.hh" 17 | #include "derivations.hh" 18 | #include "affinity.hh" 19 | #include "globals.hh" 20 | 21 | using namespace std; 22 | using namespace nix; 23 | 24 | #define ESC_RED "\033[31m" 25 | #define ESC_GRE "\033[32m" 26 | #define ESC_YEL "\033[33m" 27 | #define ESC_BLU "\033[34;1m" 28 | #define ESC_MAG "\033[35m" 29 | #define ESC_CYA "\033[36m" 30 | #define ESC_END "\033[0m" 31 | 32 | string programId = "nix-repl"; 33 | const string historyFile = string(getenv("HOME")) + "/.nix-repl-history"; 34 | 35 | struct NixRepl 36 | { 37 | string curDir; 38 | EvalState state; 39 | 40 | Strings loadedFiles; 41 | 42 | const static int envSize = 32768; 43 | StaticEnv staticEnv; 44 | Env * env; 45 | int displ; 46 | StringSet varNames; 47 | 48 | StringSet completions; 49 | StringSet::iterator curCompletion; 50 | 51 | NixRepl(const Strings & searchPath, nix::ref store); 52 | void mainLoop(const Strings & files); 53 | void completePrefix(string prefix); 54 | bool getLine(string & input, const char * prompt); 55 | Path getDerivationPath(Value & v); 56 | bool processLine(string line); 57 | void loadFile(const Path & path); 58 | void initEnv(); 59 | void reloadFiles(); 60 | void addAttrsToScope(Value & attrs); 61 | void addVarToScope(const Symbol & name, Value & v); 62 | Expr * parseString(string s); 63 | void evalString(string s, Value & v); 64 | 65 | typedef set ValuesSeen; 66 | std::ostream & printValue(std::ostream & str, Value & v, unsigned int maxDepth); 67 | std::ostream & printValue(std::ostream & str, Value & v, unsigned int maxDepth, ValuesSeen & seen); 68 | }; 69 | 70 | 71 | void printHelp() 72 | { 73 | cout << "Usage: nix-repl [--help] [--version] [-I path] paths...\n" 74 | << "\n" 75 | << "nix-repl is a simple read-eval-print loop (REPL) for the Nix package manager.\n" 76 | << "\n" 77 | << "Options:\n" 78 | << " --help\n" 79 | << " Prints out a summary of the command syntax and exits.\n" 80 | << "\n" 81 | << " --version\n" 82 | << " Prints out the Nix version number on standard output and exits.\n" 83 | << "\n" 84 | << " -I path\n" 85 | << " Add a path to the Nix expression search path. This option may be given\n" 86 | << " multiple times. See the NIX_PATH environment variable for information on\n" 87 | << " the semantics of the Nix search path. Paths added through -I take\n" 88 | << " precedence over NIX_PATH.\n" 89 | << "\n" 90 | << " paths...\n" 91 | << " A list of paths to files containing Nix expressions which nix-repl will\n" 92 | << " load and add to its scope.\n" 93 | << "\n" 94 | << " A path surrounded in < and > will be looked up in the Nix expression search\n" 95 | << " path, as in the Nix language itself.\n" 96 | << "\n" 97 | << " If an element of paths starts with http:// or https://, it is interpreted\n" 98 | << " as the URL of a tarball that will be downloaded and unpacked to a temporary\n" 99 | << " location. The tarball must include a single top-level directory containing\n" 100 | << " at least a file named default.nix.\n" 101 | << flush; 102 | } 103 | 104 | 105 | string removeWhitespace(string s) 106 | { 107 | s = chomp(s); 108 | size_t n = s.find_first_not_of(" \n\r\t"); 109 | if (n != string::npos) s = string(s, n); 110 | return s; 111 | } 112 | 113 | 114 | NixRepl::NixRepl(const Strings & searchPath, nix::ref store) 115 | : state(searchPath, store) 116 | , staticEnv(false, &state.staticBaseEnv) 117 | { 118 | curDir = absPath("."); 119 | } 120 | 121 | 122 | void NixRepl::mainLoop(const Strings & files) 123 | { 124 | string error = ANSI_RED "error:" ANSI_NORMAL " "; 125 | std::cout << "Welcome to Nix version " << NIX_VERSION << ". Type :? for help." << std::endl << std::endl; 126 | 127 | for (auto & i : files) 128 | loadedFiles.push_back(i); 129 | 130 | reloadFiles(); 131 | if (!loadedFiles.empty()) std::cout << std::endl; 132 | 133 | // Allow nix-repl specific settings in .inputrc 134 | rl_readline_name = "nix-repl"; 135 | using_history(); 136 | read_history(historyFile.c_str()); 137 | 138 | string input; 139 | 140 | while (true) { 141 | // When continuing input from previous lines, don't print a prompt, just align to the same 142 | // number of chars as the prompt. 143 | const char * prompt = input.empty() ? "nix-repl> " : " "; 144 | if (!getLine(input, prompt)) { 145 | std::cout << std::endl; 146 | break; 147 | } 148 | 149 | try { 150 | if (!removeWhitespace(input).empty() && !processLine(input)) return; 151 | } catch (ParseError & e) { 152 | if (e.msg().find("unexpected $end") != std::string::npos) { 153 | // For parse errors on incomplete input, we continue waiting for the next line of 154 | // input without clearing the input so far. 155 | continue; 156 | } else { 157 | printMsg(lvlError, format(error + "%1%%2%") % (settings.showTrace ? e.prefix() : "") % e.msg()); 158 | } 159 | } catch (Error & e) { 160 | printMsg(lvlError, format(error + "%1%%2%") % (settings.showTrace ? e.prefix() : "") % e.msg()); 161 | } catch (Interrupted & e) { 162 | printMsg(lvlError, format(error + "%1%%2%") % (settings.showTrace ? e.prefix() : "") % e.msg()); 163 | } 164 | 165 | // We handled the current input fully, so we should clear it and read brand new input. 166 | input.clear(); 167 | std::cout << std::endl; 168 | } 169 | } 170 | 171 | 172 | /* Apparently, the only way to get readline() to return on Ctrl-C 173 | (SIGINT) is to use siglongjmp(). That's fucked up... */ 174 | static sigjmp_buf sigintJmpBuf; 175 | 176 | 177 | static void sigintHandler(int signo) 178 | { 179 | siglongjmp(sigintJmpBuf, 1); 180 | } 181 | 182 | 183 | /* Oh, if only g++ had nested functions... */ 184 | NixRepl * curRepl; 185 | 186 | char * completerThunk(const char * s, int state) 187 | { 188 | string prefix(s); 189 | 190 | /* If the prefix has a slash in it, use readline's builtin filename 191 | completer. */ 192 | if (prefix.find('/') != string::npos) 193 | return rl_filename_completion_function(s, state); 194 | 195 | /* Otherwise, return all symbols that start with the prefix. */ 196 | if (state == 0) { 197 | curRepl->completePrefix(s); 198 | curRepl->curCompletion = curRepl->completions.begin(); 199 | } 200 | if (curRepl->curCompletion == curRepl->completions.end()) return 0; 201 | return strdup((curRepl->curCompletion++)->c_str()); 202 | } 203 | 204 | 205 | bool NixRepl::getLine(string & input, const char * prompt) 206 | { 207 | struct sigaction act, old; 208 | act.sa_handler = sigintHandler; 209 | sigfillset(&act.sa_mask); 210 | act.sa_flags = 0; 211 | if (sigaction(SIGINT, &act, &old)) 212 | throw SysError("installing handler for SIGINT"); 213 | 214 | if (sigsetjmp(sigintJmpBuf, 1)) { 215 | input.clear(); 216 | } else { 217 | curRepl = this; 218 | rl_completion_entry_function = completerThunk; 219 | 220 | char * s = readline(prompt); 221 | if (!s) return false; 222 | input.append(s); 223 | input.push_back('\n'); 224 | if (!removeWhitespace(s).empty()) { 225 | add_history(s); 226 | append_history(1, 0); 227 | } 228 | free(s); 229 | } 230 | 231 | _isInterrupted = 0; 232 | 233 | if (sigaction(SIGINT, &old, 0)) 234 | throw SysError("restoring handler for SIGINT"); 235 | 236 | return true; 237 | } 238 | 239 | 240 | void NixRepl::completePrefix(string prefix) 241 | { 242 | completions.clear(); 243 | 244 | size_t dot = prefix.rfind('.'); 245 | 246 | if (dot == string::npos) { 247 | /* This is a variable name; look it up in the current scope. */ 248 | StringSet::iterator i = varNames.lower_bound(prefix); 249 | while (i != varNames.end()) { 250 | if (string(*i, 0, prefix.size()) != prefix) break; 251 | completions.insert(*i); 252 | i++; 253 | } 254 | } else { 255 | try { 256 | /* This is an expression that should evaluate to an 257 | attribute set. Evaluate it to get the names of the 258 | attributes. */ 259 | string expr(prefix, 0, dot); 260 | string prefix2 = string(prefix, dot + 1); 261 | 262 | Expr * e = parseString(expr); 263 | Value v; 264 | e->eval(state, *env, v); 265 | state.forceAttrs(v); 266 | 267 | for (auto & i : *v.attrs) { 268 | string name = i.name; 269 | if (string(name, 0, prefix2.size()) != prefix2) continue; 270 | completions.insert(expr + "." + name); 271 | } 272 | 273 | } catch (ParseError & e) { 274 | // Quietly ignore parse errors. 275 | } catch (EvalError & e) { 276 | // Quietly ignore evaluation errors. 277 | } catch (UndefinedVarError & e) { 278 | // Quietly ignore undefined variable errors. 279 | } 280 | } 281 | } 282 | 283 | 284 | static int runProgram(const string & program, const Strings & args) 285 | { 286 | std::vector cargs; /* careful with c_str()! */ 287 | cargs.push_back(program.c_str()); 288 | for (Strings::const_iterator i = args.begin(); i != args.end(); ++i) 289 | cargs.push_back(i->c_str()); 290 | cargs.push_back(0); 291 | 292 | Pid pid; 293 | pid = fork(); 294 | if (pid == -1) throw SysError("forking"); 295 | if (pid == 0) { 296 | restoreAffinity(); 297 | execvp(program.c_str(), (char * *) &cargs[0]); 298 | _exit(1); 299 | } 300 | 301 | return pid.wait(); 302 | } 303 | 304 | 305 | bool isVarName(const string & s) 306 | { 307 | if (s.size() == 0) return false; 308 | char c = s[0]; 309 | if ((c >= '0' && c <= '9') || c == '-' || c == '\'') return false; 310 | for (auto & i : s) 311 | if (!((i >= 'a' && i <= 'z') || 312 | (i >= 'A' && i <= 'Z') || 313 | (i >= '0' && i <= '9') || 314 | i == '_' || i == '-' || i == '\'')) 315 | return false; 316 | return true; 317 | } 318 | 319 | 320 | Path NixRepl::getDerivationPath(Value & v) { 321 | DrvInfo drvInfo(state); 322 | if (!getDerivation(state, v, drvInfo, false)) 323 | throw Error("expression does not evaluate to a derivation, so I can't build it"); 324 | Path drvPath = drvInfo.queryDrvPath(); 325 | if (drvPath == "" || !state.store->isValidPath(drvPath)) 326 | throw Error("expression did not evaluate to a valid derivation"); 327 | return drvPath; 328 | } 329 | 330 | 331 | bool NixRepl::processLine(string line) 332 | { 333 | if (line == "") return true; 334 | 335 | string command, arg; 336 | 337 | if (line[0] == ':') { 338 | size_t p = line.find_first_of(" \n\r\t"); 339 | command = string(line, 0, p); 340 | if (p != string::npos) arg = removeWhitespace(string(line, p)); 341 | } else { 342 | arg = line; 343 | } 344 | 345 | if (command == ":?" || command == ":help") { 346 | cout << "The following commands are available:\n" 347 | << "\n" 348 | << " Evaluate and print expression\n" 349 | << " = Bind expression to variable\n" 350 | << " :a Add attributes from resulting set to scope\n" 351 | << " :b Build derivation\n" 352 | << " :i Build derivation, then install result into current profile\n" 353 | << " :l Load Nix expression and add it to scope\n" 354 | << " :p Evaluate and print expression recursively\n" 355 | << " :q Exit nix-repl\n" 356 | << " :r Reload all files\n" 357 | << " :s Build dependencies of derivation, then start nix-shell\n" 358 | << " :t Describe result of evaluation\n" 359 | << " :u Build derivation, then start nix-shell\n"; 360 | } 361 | 362 | else if (command == ":a" || command == ":add") { 363 | Value v; 364 | evalString(arg, v); 365 | addAttrsToScope(v); 366 | } 367 | 368 | else if (command == ":l" || command == ":load") { 369 | state.resetFileCache(); 370 | loadFile(arg); 371 | } 372 | 373 | else if (command == ":r" || command == ":reload") { 374 | state.resetFileCache(); 375 | reloadFiles(); 376 | } 377 | 378 | else if (command == ":t") { 379 | Value v; 380 | evalString(arg, v); 381 | std::cout << showType(v) << std::endl; 382 | 383 | } else if (command == ":u") { 384 | Value v, f, result; 385 | evalString(arg, v); 386 | evalString("drv: (import {}).runCommand \"shell\" { buildInputs = [ drv ]; } \"\"", f); 387 | state.callFunction(f, v, result, Pos()); 388 | 389 | Path drvPath = getDerivationPath(result); 390 | runProgram("nix-shell", Strings{drvPath}); 391 | } 392 | 393 | else if (command == ":b" || command == ":i" || command == ":s") { 394 | Value v; 395 | evalString(arg, v); 396 | Path drvPath = getDerivationPath(v); 397 | 398 | if (command == ":b") { 399 | /* We could do the build in this process using buildPaths(), 400 | but doing it in a child makes it easier to recover from 401 | problems / SIGINT. */ 402 | if (runProgram("nix-store", Strings{"-r", drvPath}) == 0) { 403 | Derivation drv = readDerivation(drvPath); 404 | std::cout << std::endl << "this derivation produced the following outputs:" << std::endl; 405 | for (auto & i : drv.outputs) 406 | std::cout << format(" %1% -> %2%") % i.first % i.second.path << std::endl; 407 | } 408 | } else if (command == ":i") { 409 | runProgram("nix-env", Strings{"-i", drvPath}); 410 | } else { 411 | runProgram("nix-shell", Strings{drvPath}); 412 | } 413 | } 414 | 415 | else if (command == ":p" || command == ":print") { 416 | Value v; 417 | evalString(arg, v); 418 | printValue(std::cout, v, 1000000000) << std::endl; 419 | } 420 | 421 | else if (command == ":q" || command == ":quit") 422 | return false; 423 | 424 | else if (command != "") 425 | throw Error(format("unknown command ‘%1%’") % command); 426 | 427 | else { 428 | size_t p = line.find('='); 429 | string name; 430 | if (p != string::npos && 431 | p < line.size() && 432 | line[p + 1] != '=' && 433 | isVarName(name = removeWhitespace(string(line, 0, p)))) 434 | { 435 | Expr * e = parseString(string(line, p + 1)); 436 | Value & v(*state.allocValue()); 437 | v.type = tThunk; 438 | v.thunk.env = env; 439 | v.thunk.expr = e; 440 | addVarToScope(state.symbols.create(name), v); 441 | } else { 442 | Value v; 443 | evalString(line, v); 444 | printValue(std::cout, v, 1) << std::endl; 445 | } 446 | } 447 | 448 | return true; 449 | } 450 | 451 | 452 | void NixRepl::loadFile(const Path & path) 453 | { 454 | loadedFiles.remove(path); 455 | loadedFiles.push_back(path); 456 | Value v, v2; 457 | state.evalFile(lookupFileArg(state, path), v); 458 | Bindings & bindings(*state.allocBindings(0)); 459 | state.autoCallFunction(bindings, v, v2); 460 | addAttrsToScope(v2); 461 | } 462 | 463 | 464 | void NixRepl::initEnv() 465 | { 466 | env = &state.allocEnv(envSize); 467 | env->up = &state.baseEnv; 468 | displ = 0; 469 | staticEnv.vars.clear(); 470 | 471 | varNames.clear(); 472 | for (auto & i : state.staticBaseEnv.vars) 473 | varNames.insert(i.first); 474 | } 475 | 476 | 477 | void NixRepl::reloadFiles() 478 | { 479 | initEnv(); 480 | 481 | Strings old = loadedFiles; 482 | loadedFiles.clear(); 483 | 484 | bool first = true; 485 | for (auto & i : old) { 486 | if (!first) std::cout << std::endl; 487 | first = false; 488 | std::cout << format("Loading ‘%1%’...") % i << std::endl; 489 | loadFile(i); 490 | } 491 | } 492 | 493 | 494 | void NixRepl::addAttrsToScope(Value & attrs) 495 | { 496 | state.forceAttrs(attrs); 497 | for (auto & i : *attrs.attrs) 498 | addVarToScope(i.name, *i.value); 499 | std::cout << format("Added %1% variables.") % attrs.attrs->size() << std::endl; 500 | } 501 | 502 | 503 | void NixRepl::addVarToScope(const Symbol & name, Value & v) 504 | { 505 | if (displ >= envSize) 506 | throw Error("environment full; cannot add more variables"); 507 | staticEnv.vars[name] = displ; 508 | env->values[displ++] = &v; 509 | varNames.insert((string) name); 510 | } 511 | 512 | 513 | Expr * NixRepl::parseString(string s) 514 | { 515 | Expr * e = state.parseExprFromString(s, curDir, staticEnv); 516 | return e; 517 | } 518 | 519 | 520 | void NixRepl::evalString(string s, Value & v) 521 | { 522 | Expr * e = parseString(s); 523 | e->eval(state, *env, v); 524 | state.forceValue(v); 525 | } 526 | 527 | 528 | std::ostream & NixRepl::printValue(std::ostream & str, Value & v, unsigned int maxDepth) 529 | { 530 | ValuesSeen seen; 531 | return printValue(str, v, maxDepth, seen); 532 | } 533 | 534 | 535 | std::ostream & printStringValue(std::ostream & str, const char * string) { 536 | str << "\""; 537 | for (const char * i = string; *i; i++) 538 | if (*i == '\"' || *i == '\\') str << "\\" << *i; 539 | else if (*i == '\n') str << "\\n"; 540 | else if (*i == '\r') str << "\\r"; 541 | else if (*i == '\t') str << "\\t"; 542 | else str << *i; 543 | str << "\""; 544 | return str; 545 | } 546 | 547 | 548 | // FIXME: lot of cut&paste from Nix's eval.cc. 549 | std::ostream & NixRepl::printValue(std::ostream & str, Value & v, unsigned int maxDepth, ValuesSeen & seen) 550 | { 551 | str.flush(); 552 | checkInterrupt(); 553 | 554 | state.forceValue(v); 555 | 556 | switch (v.type) { 557 | 558 | case tInt: 559 | str << ESC_CYA << v.integer << ESC_END; 560 | break; 561 | 562 | case tBool: 563 | str << ESC_CYA << (v.boolean ? "true" : "false") << ESC_END; 564 | break; 565 | 566 | case tString: 567 | str << ESC_YEL; 568 | printStringValue(str, v.string.s); 569 | str << ESC_END; 570 | break; 571 | 572 | case tPath: 573 | str << ESC_GRE << v.path << ESC_END; // !!! escaping? 574 | break; 575 | 576 | case tNull: 577 | str << ESC_CYA "null" ESC_END; 578 | break; 579 | 580 | case tAttrs: { 581 | seen.insert(&v); 582 | 583 | bool isDrv = state.isDerivation(v); 584 | 585 | if (isDrv) { 586 | str << "«derivation "; 587 | Bindings::iterator i = v.attrs->find(state.sDrvPath); 588 | PathSet context; 589 | Path drvPath = i != v.attrs->end() ? state.coerceToPath(*i->pos, *i->value, context) : "???"; 590 | str << drvPath << "»"; 591 | } 592 | 593 | else if (maxDepth > 0) { 594 | str << "{ "; 595 | 596 | typedef std::map Sorted; 597 | Sorted sorted; 598 | for (auto & i : *v.attrs) 599 | sorted[i.name] = i.value; 600 | 601 | /* If this is a derivation, then don't show the 602 | self-references ("all", "out", etc.). */ 603 | StringSet hidden; 604 | if (isDrv) { 605 | hidden.insert("all"); 606 | Bindings::iterator i = v.attrs->find(state.sOutputs); 607 | if (i == v.attrs->end()) 608 | hidden.insert("out"); 609 | else { 610 | state.forceList(*i->value); 611 | for (unsigned int j = 0; j < i->value->listSize(); ++j) 612 | hidden.insert(state.forceStringNoCtx(*i->value->listElems()[j])); 613 | } 614 | } 615 | 616 | for (auto & i : sorted) { 617 | if (isVarName(i.first)) 618 | str << i.first; 619 | else 620 | printStringValue(str, i.first.c_str()); 621 | str << " = "; 622 | if (hidden.find(i.first) != hidden.end()) 623 | str << "«...»"; 624 | else if (seen.find(i.second) != seen.end()) 625 | str << "«repeated»"; 626 | else 627 | try { 628 | printValue(str, *i.second, maxDepth - 1, seen); 629 | } catch (AssertionError & e) { 630 | str << ESC_RED "«error: " << e.msg() << "»" ESC_END; 631 | } 632 | str << "; "; 633 | } 634 | 635 | str << "}"; 636 | } else 637 | str << "{ ... }"; 638 | 639 | break; 640 | } 641 | 642 | case tList1: 643 | case tList2: 644 | case tListN: 645 | seen.insert(&v); 646 | 647 | str << "[ "; 648 | if (maxDepth > 0) 649 | for (unsigned int n = 0; n < v.listSize(); ++n) { 650 | if (seen.find(v.listElems()[n]) != seen.end()) 651 | str << "«repeated»"; 652 | else 653 | try { 654 | printValue(str, *v.listElems()[n], maxDepth - 1, seen); 655 | } catch (AssertionError & e) { 656 | str << ESC_RED "«error: " << e.msg() << "»" ESC_END; 657 | } 658 | str << " "; 659 | } 660 | else 661 | str << "... "; 662 | str << "]"; 663 | break; 664 | 665 | case tLambda: { 666 | std::ostringstream s; 667 | s << v.lambda.fun->pos; 668 | str << ESC_BLU "«lambda @ " << filterANSIEscapes(s.str()) << "»" ESC_END; 669 | break; 670 | } 671 | 672 | case tPrimOp: 673 | str << ESC_MAG "«primop»" ESC_END; 674 | break; 675 | 676 | case tPrimOpApp: 677 | str << ESC_BLU "«primop-app»" ESC_END; 678 | break; 679 | 680 | default: 681 | str << ESC_RED "«unknown»" ESC_END; 682 | break; 683 | } 684 | 685 | return str; 686 | } 687 | 688 | 689 | int main(int argc, char * * argv) 690 | { 691 | return handleExceptions(argv[0], [&]() { 692 | initNix(); 693 | initGC(); 694 | 695 | Strings files, searchPath; 696 | 697 | parseCmdLine(argc, argv, [&](Strings::iterator & arg, const Strings::iterator & end) { 698 | if (*arg == "--version") 699 | printVersion("nix-repl"); 700 | else if (*arg == "--help") { 701 | printHelp(); 702 | // exit with 0 since user asked for help 703 | _exit(0); 704 | } 705 | else if (parseSearchPathArg(arg, end, searchPath)) 706 | ; 707 | else if (*arg != "" && arg->at(0) == '-') 708 | return false; 709 | else 710 | files.push_back(*arg); 711 | return true; 712 | }); 713 | 714 | NixRepl repl(searchPath, openStore()); 715 | repl.mainLoop(files); 716 | 717 | write_history(historyFile.c_str()); 718 | }); 719 | } 720 | --------------------------------------------------------------------------------