├── .github └── workflows │ └── ci.yml ├── .gitignore ├── .travis.yml ├── LICENSE ├── Makefile.am ├── README.md ├── configure.ac ├── man ├── Makefile.am └── btfs.1 ├── scripts ├── Makefile.am ├── btplay └── build-libtorrent └── src ├── Makefile.am ├── btfs.cc ├── btfs.h ├── btfsstat.cc └── btfsstat.h /.github/workflows/ci.yml: -------------------------------------------------------------------------------- 1 | name: btfs CI 2 | 3 | on: 4 | push: 5 | branches: [ 'master' ] 6 | pull_request: 7 | branches: [ 'master' ] 8 | schedule: 9 | - cron: '0 12 1 * *' 10 | 11 | jobs: 12 | ubuntu: 13 | runs-on: ubuntu-latest 14 | name: 'Ubuntu (${{ matrix.image }})' 15 | timeout-minutes: 10 16 | 17 | strategy: 18 | matrix: 19 | image: 20 | - 'ubuntu:latest' 21 | - 'ubuntu:rolling' 22 | - 'ubuntu:devel' 23 | fail-fast: false 24 | 25 | container: 26 | image: ${{ matrix.image }} 27 | 28 | steps: 29 | - name: Checkout 30 | uses: actions/checkout@v4 31 | - name: Install dependencies 32 | env: 33 | DEBIAN_FRONTEND: noninteractive 34 | run: | 35 | apt-get update 36 | apt-get -y install build-essential g++ autoconf autoconf-archive automake libtool libtorrent-rasterbar-dev libfuse3-dev libcurl4-openssl-dev 37 | - name: Build 38 | run: | 39 | autoreconf -i 40 | ./configure 41 | make 42 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | *.o 2 | btfs 3 | btfsstat 4 | 5 | # generated files 6 | Makefile 7 | Makefile.in 8 | .deps 9 | /aclocal.m4 10 | /autom4te.cache 11 | /compile 12 | /config.log 13 | /config.status 14 | /configure 15 | /depcomp 16 | /install-sh 17 | /missing 18 | -------------------------------------------------------------------------------- /.travis.yml: -------------------------------------------------------------------------------- 1 | language: cpp 2 | os: linux 3 | dist: focal 4 | arch: 5 | - AMD64 6 | - ppc64le 7 | env: 8 | global: 9 | - MAKEFLAGS=-j2 10 | - PKG_CONFIG_PATH=/tmp/lib/pkgconfig 11 | - LD_LIBRARY_PATH=/tmp/lib 12 | jobs: 13 | - LIBTORRENT_BRANCH=RC_1_1 14 | - LIBTORRENT_BRANCH=RC_1_2 15 | - LIBTORRENT_BRANCH=RC_2_0 16 | addons: 17 | apt: 18 | packages: 19 | - libboost-all-dev 20 | - libfuse-dev 21 | - libcurl4-openssl-dev 22 | install: 23 | - env CXXFLAGS="-fpermissive -w" ./scripts/build-libtorrent $LIBTORRENT_BRANCH /tmp 24 | script: 25 | - autoreconf -i && ./configure && make && make test 26 | -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /Makefile.am: -------------------------------------------------------------------------------- 1 | AUTOMAKE_OPTIONS = foreign 2 | SUBDIRS = src scripts man 3 | EXTRA_DIST = LICENSE README.md 4 | 5 | # Alias test target to make Travis CI happy 6 | .PHONY: test 7 | test: check 8 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # BTFS (bittorrent filesystem) 2 | 3 | ## What is this? 4 | 5 | With BTFS, you can mount any **.torrent** file or **magnet link** and then use it as any read-only directory in your file tree. The contents of the files will be downloaded on-demand as they are read by applications. Tools like **ls**, **cat** and **cp** works as expected. Applications like **vlc** and **mplayer** can also work without changes. 6 | 7 | ## Example usage 8 | 9 | $ mkdir mnt 10 | $ btfs video.torrent mnt 11 | $ cd mnt 12 | $ vlc video.mp4 13 | 14 | To unmount and shutdown: 15 | 16 | $ fusermount -u mnt 17 | 18 | ## Installing on Debian/Ubuntu 19 | 20 | # apt-get install btfs 21 | 22 | ## Installing on Arch Linux 23 | 24 | # pacman -S btfs 25 | 26 | ## Installing on Gentoo 27 | 28 | # emerge -av btfs 29 | 30 | ## Installing on Fedora 31 | 32 | # dnf install fuse-btfs 33 | 34 | ## Installing on Fedora OSTree 35 | 36 | $ rpm-ostree install fuse-btfs 37 | 38 | ## OpenSUSE 39 | 40 | # zypper install btfs 41 | 42 | ## Installing on macOS 43 | 44 | Use [`brew`](https://brew.sh) to install on macOS. 45 | 46 | $ brew install btfs 47 | 48 | ## Dependencies (on Linux) 49 | 50 | * fuse3 ("fuse3" in Ubuntu 22.04) 51 | * libtorrent ("libtorrent-rasterbar8" in Ubuntu 22.04) 52 | * libcurl ("libcurl4" in Ubuntu 22.04) 53 | 54 | ## Building from git on a recent Debian/Ubuntu 55 | 56 | $ sudo apt-get install autoconf automake libfuse3-dev libtorrent-rasterbar-dev libcurl4-openssl-dev g++ 57 | $ git clone https://github.com/johang/btfs.git btfs 58 | $ cd btfs 59 | $ autoreconf -i 60 | $ ./configure 61 | $ make 62 | 63 | And optionally, if you want to install it: 64 | 65 | $ make install 66 | 67 | ## Building on macOS 68 | 69 | Use [`brew`](https://brew.sh) to get the dependencies. 70 | 71 | $ brew install --cask macfuse libtorrent-rasterbar autoconf automake pkg-config 72 | $ git clone https://github.com/johang/btfs.git btfs 73 | $ cd btfs 74 | $ autoreconf -i 75 | $ ./configure 76 | $ make 77 | 78 | And optionally, if you want to install it: 79 | 80 | $ make install 81 | -------------------------------------------------------------------------------- /configure.ac: -------------------------------------------------------------------------------- 1 | AC_PREREQ([2.69]) 2 | AC_INIT([btfs],[3.1],[johan.gunnarsson@gmail.com],[btfs],[https://github.com/johang/btfs]) 3 | AC_CONFIG_SRCDIR([src/btfs.cc]) 4 | 5 | AM_INIT_AUTOMAKE 6 | 7 | # Checks for programs. 8 | AC_PROG_CXX 9 | 10 | # Checks for libraries. 11 | PKG_CHECK_MODULES(FUSE, fuse3 >= 3.0) 12 | PKG_CHECK_MODULES(LIBTORRENT, libtorrent-rasterbar >= 1.0.0) 13 | PKG_CHECK_MODULES(LIBCURL, libcurl >= 7.22.0) 14 | 15 | # Checks for typedefs, structures, and compiler characteristics. 16 | AC_TYPE_OFF_T 17 | AC_TYPE_SIZE_T 18 | 19 | # Checks for library functions. 20 | AC_CHECK_FUNCS([memset memcpy strcmp mkdir strdup realpath getxattr dirname basename]) 21 | 22 | # Check for unportable pthread_setname_np() 23 | AC_CHECK_LIB(pthread, pthread_setname_np) 24 | 25 | # Check if -latomic is needed. 26 | AC_SEARCH_LIBS(__atomic_load, atomic) 27 | 28 | AC_CONFIG_FILES([Makefile src/Makefile scripts/Makefile man/Makefile]) 29 | AC_OUTPUT 30 | -------------------------------------------------------------------------------- /man/Makefile.am: -------------------------------------------------------------------------------- 1 | dist_man_MANS = btfs.1 2 | -------------------------------------------------------------------------------- /man/btfs.1: -------------------------------------------------------------------------------- 1 | .TH BTFS 1 2 | .SH NAME 3 | btfs \- mount torrent files or magnet links as a file system 4 | .SH SYNOPSIS 5 | .B btfs 6 | [\fIoptions\fP] 7 | \fBmetadata\fP 8 | \fBmountpoint\fP 9 | .SH DESCRIPTION 10 | .B btfs 11 | allows one to mount any torrent file or a magnet link as a file 12 | system. The contents of the files will be downloaded on-demand 13 | as they are read by applications. 14 | .SH OPTIONS 15 | .TP 16 | \fB\-v\fR \fB\-\-version\fR 17 | print version 18 | .TP 19 | \fB\-h\fR \fB\-\-help\fR 20 | print help 21 | .TP 22 | \fB\-b\fR \fB\-\-browse-only\fR 23 | download metadata only 24 | .TP 25 | \fB\-k\fR \fB\-\-keep\fR 26 | keep files after unmount 27 | .TP 28 | \fB\-s\fR \fB\-\-silent\fR 29 | do not create logs 30 | .TP 31 | \fB\-\-utp\-only\fR 32 | do not use TCP 33 | .TP 34 | \fB\-\-data-directory=\fIDIRECTORY\fR 35 | directory in which to put btfs download data. will by default use $XDG_DATA_HOME if defined else use $HOME/btfs, or /tmp/btfs if the latter is unavailable 36 | .TP 37 | \fB\-\-min-port=\fIPORT\fR 38 | start of listen port range 39 | .TP 40 | \fB\-\-max-port=\fIPORT\fR 41 | end of listen port range 42 | .TP 43 | \fB\-\-max-download-rate=\fIRATE\fR 44 | maximum download rate (in kilobytes per second) 45 | .TP 46 | \fB\-\-max-upload-rate=\fIRATE\fR 47 | maximum upload rate (in kilobytes per second) 48 | .SH EXAMPLES 49 | mounting a torrent file: 50 | btfs video.torrent ~/mnt 51 | 52 | mounting a magnet link: 53 | btfs 'magnet:?xt=urn:btih:...' ~/mnt 54 | 55 | unmounting: 56 | fusermount -u ~/mnt 57 | .SH BUGS 58 | Please report any bugs to https://github.com/johang/btfs. 59 | .PD 60 | .SH "AUTHORS" 61 | .LP 62 | BTFS has been written by Johan Gunnarsson 63 | .LP 64 | This man page was written by Donat Kh. 65 | -------------------------------------------------------------------------------- /scripts/Makefile.am: -------------------------------------------------------------------------------- 1 | dist_bin_SCRIPTS = btplay 2 | -------------------------------------------------------------------------------- /scripts/btplay: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python3 2 | # Copyright 2015 Johan Gunnarsson 3 | # 4 | # This file is part of BTFS. 5 | # 6 | # BTFS is free software: you can redistribute it and/or modify 7 | # it under the terms of the GNU General Public License as published by 8 | # the Free Software Foundation, either version 3 of the License, or 9 | # (at your option) any later version. 10 | # 11 | # BTFS is distributed in the hope that it will be useful, 12 | # but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | # GNU General Public License for more details. 15 | # 16 | # You should have received a copy of the GNU General Public License 17 | # along with BTFS. If not, see . 18 | 19 | from __future__ import print_function 20 | 21 | import sys 22 | import os 23 | import os.path 24 | import tempfile 25 | import shutil 26 | import time 27 | import subprocess 28 | import argparse 29 | 30 | 31 | extensions = ("mp4", "m4v", "mkv", "avi", 32 | "mpg", "mpeg", "flv", "webm") 33 | 34 | players = (("omxplayer", "--timeout", "60"), 35 | ("vlc", "--file-caching", "10000"), 36 | ("mpv", ), 37 | ("mplayer", ), 38 | ("totem", ), 39 | ("parole", ), 40 | ("dragon", )) 41 | 42 | 43 | def which(x): 44 | for d in os.getenv("PATH", "").split(":"): 45 | if os.path.exists(os.path.join(d, x)): 46 | return os.path.join(d, x) 47 | 48 | 49 | def find_player(players): 50 | for player in players: 51 | if which(player[0]): 52 | return player 53 | 54 | 55 | def find_files(filepath): 56 | for dirpath, dnames, fnames in os.walk(filepath): 57 | for f in fnames: 58 | yield os.path.join(dirpath, f) 59 | 60 | 61 | def is_sample(filename): 62 | return "sample" in os.path.basename(filename).lower() 63 | 64 | 65 | def is_video(filename): 66 | return any(filename.lower().endswith(i) for i in extensions) 67 | 68 | 69 | def exit(tempdir, status): 70 | shutil.rmtree(tempdir) 71 | sys.exit(status) 72 | 73 | 74 | def main(): 75 | parser = argparse.ArgumentParser() 76 | parser.add_argument("-p", "--player", 77 | action="store", help="player to launch") 78 | parser.add_argument("URI", action="store", 79 | help="magnet link or HTTP metadata URL to play") 80 | args = parser.parse_args() 81 | 82 | player = find_player([args.player.split()] if args.player else players) 83 | 84 | if not player: 85 | print("Could not find a player", file=sys.stderr) 86 | sys.exit(1) 87 | 88 | mountpoint = tempfile.mkdtemp(prefix="btplay-") 89 | failed = subprocess.call(["btfs", args.URI, mountpoint]) 90 | 91 | if failed: 92 | exit(mountpoint, failed) 93 | 94 | try: 95 | while not os.listdir(mountpoint): 96 | time.sleep(0.25) 97 | 98 | media = sorted(i for i in find_files(mountpoint) 99 | if not is_sample(i) and is_video(i)) 100 | 101 | if media: 102 | status = subprocess.call(list(player) + media, stdin=sys.stdin) 103 | else: 104 | print("No video media found", file=sys.stderr) 105 | status = 3 106 | except KeyboardInterrupt: 107 | status = 1 108 | except Exception as e: 109 | print("Error:", e, file=sys.stderr) 110 | status = 2 111 | finally: 112 | subprocess.call(["fusermount", "-z", "-u", mountpoint]) 113 | 114 | exit(mountpoint, status) 115 | 116 | 117 | if __name__ == '__main__': 118 | main() 119 | -------------------------------------------------------------------------------- /scripts/build-libtorrent: -------------------------------------------------------------------------------- 1 | #!/bin/sh 2 | # Copyright 2017 Johan Gunnarsson 3 | # 4 | # This file is part of BTFS. 5 | # 6 | # BTFS is free software: you can redistribute it and/or modify 7 | # it under the terms of the GNU General Public License as published by 8 | # the Free Software Foundation, either version 3 of the License, or 9 | # (at your option) any later version. 10 | # 11 | # BTFS is distributed in the hope that it will be useful, 12 | # but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | # GNU General Public License for more details. 15 | # 16 | # You should have received a copy of the GNU General Public License 17 | # along with BTFS. If not, see . 18 | 19 | git clone --recurse-submodules -b "${1:-master}" https://github.com/arvidn/libtorrent.git && 20 | cd libtorrent && 21 | mkdir build && 22 | cd build && 23 | cmake -DCMAKE_INSTALL_PREFIX="${2:-/tmp}" -G "Unix Makefiles" .. && 24 | make && 25 | make install 26 | -------------------------------------------------------------------------------- /src/Makefile.am: -------------------------------------------------------------------------------- 1 | EXTRACXXFLAGS = -std=c++14 \ 2 | -Wall \ 3 | -Wextra \ 4 | -Wconversion \ 5 | -Wsign-compare \ 6 | -Wsign-conversion \ 7 | -Wno-unused-parameter 8 | bin_PROGRAMS = btfs btfsstat 9 | btfs_SOURCES = btfs.cc btfs.h 10 | btfs_CXXFLAGS = $(EXTRACXXFLAGS) $(FUSE_CFLAGS) $(LIBTORRENT_CFLAGS) $(LIBCURL_CFLAGS) 11 | btfs_LDADD = $(FUSE_LIBS) $(LIBTORRENT_LIBS) $(LIBCURL_LIBS) 12 | btfsstat_SOURCES = btfsstat.cc btfsstat.h 13 | btfsstat_CXXFLAGS = $(EXTRACXXFLAGS) 14 | btfsstat_LDADD = 15 | -------------------------------------------------------------------------------- /src/btfs.cc: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright 2015 Johan Gunnarsson 3 | 4 | This file is part of BTFS. 5 | 6 | BTFS is free software: you can redistribute it and/or modify 7 | it under the terms of the GNU General Public License as published by 8 | the Free Software Foundation, either version 3 of the License, or 9 | (at your option) any later version. 10 | 11 | BTFS is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU General Public License for more details. 15 | 16 | You should have received a copy of the GNU General Public License 17 | along with BTFS. If not, see . 18 | */ 19 | 20 | #define FUSE_USE_VERSION 31 21 | 22 | #include 23 | #include 24 | #include 25 | 26 | #include 27 | #include 28 | #include 29 | 30 | #include 31 | #include 32 | 33 | // The below pragma lines will silence lots of compiler warnings in the 34 | // libtorrent headers file. Not btfs' fault. 35 | #pragma GCC diagnostic push 36 | #pragma GCC diagnostic ignored "-Wsign-conversion" 37 | #pragma GCC diagnostic ignored "-Wconversion" 38 | #pragma GCC diagnostic ignored "-Wdeprecated-declarations" 39 | #include 40 | #include 41 | #include 42 | #include 43 | #include 44 | #include 45 | #include 46 | #if LIBTORRENT_VERSION_NUM >= 10200 47 | #include 48 | #endif 49 | #pragma GCC diagnostic pop 50 | 51 | #include 52 | 53 | #include "btfs.h" 54 | 55 | #define RETV(s, v) { s; return v; }; 56 | #define STRINGIFY(s) #s 57 | 58 | using namespace btfs; 59 | 60 | libtorrent::session *session = NULL; 61 | 62 | libtorrent::torrent_handle handle; 63 | 64 | pthread_t alert_thread; 65 | 66 | std::list reads; 67 | 68 | // First piece index of the current sliding window 69 | int cursor; 70 | 71 | std::map files; 72 | std::map > dirs; 73 | 74 | pthread_mutex_t lock = PTHREAD_MUTEX_INITIALIZER; 75 | pthread_cond_t signal_cond = PTHREAD_COND_INITIALIZER; 76 | 77 | // Time used as "last modified" time 78 | time_t time_of_mount; 79 | 80 | static struct btfs_params params; 81 | 82 | static bool 83 | move_to_next_unfinished(int& piece, int num_pieces) { 84 | for (; piece < num_pieces; piece++) { 85 | if (!handle.have_piece(piece)) 86 | return true; 87 | } 88 | 89 | return false; 90 | } 91 | 92 | static void 93 | jump(int piece, int size) { 94 | auto ti = handle.torrent_file(); 95 | 96 | int tail = piece; 97 | 98 | if (!move_to_next_unfinished(tail, ti->num_pieces())) 99 | return; 100 | 101 | cursor = tail; 102 | 103 | for (int i = 0; i < 16; i++) { 104 | handle.piece_priority(tail++, 7); 105 | } 106 | } 107 | 108 | static void 109 | advance() { 110 | jump(cursor, 0); 111 | } 112 | 113 | Read::Read(char *buf, int index, off_t offset, size_t size) { 114 | auto ti = handle.torrent_file(); 115 | 116 | #if LIBTORRENT_VERSION_NUM < 10100 117 | int64_t file_size = ti->file_at(index).size; 118 | #else 119 | int64_t file_size = ti->files().file_size(index); 120 | #endif 121 | 122 | while (size > 0 && offset < file_size) { 123 | libtorrent::peer_request part = ti->map_file(index, offset, 124 | (int) size); 125 | 126 | part.length = std::min( 127 | ti->piece_size(part.piece) - part.start, 128 | part.length); 129 | 130 | parts.push_back(Part(part, buf)); 131 | 132 | size -= (size_t) part.length; 133 | offset += part.length; 134 | buf += part.length; 135 | } 136 | } 137 | 138 | void Read::fail(int piece) { 139 | for (parts_iter i = parts.begin(); i != parts.end(); ++i) { 140 | if (i->part.piece == piece && !i->filled) 141 | failed = true; 142 | } 143 | } 144 | 145 | void Read::copy(int piece, char *buffer, int size) { 146 | for (parts_iter i = parts.begin(); i != parts.end(); ++i) { 147 | if (i->part.piece == piece && !i->filled) 148 | i->filled = (memcpy(i->buf, buffer + i->part.start, 149 | (size_t) i->part.length)) != NULL; 150 | } 151 | } 152 | 153 | void Read::trigger() { 154 | for (parts_iter i = parts.begin(); i != parts.end(); ++i) { 155 | if (handle.have_piece(i->part.piece)) 156 | handle.read_piece(i->part.piece); 157 | } 158 | } 159 | 160 | bool Read::finished() { 161 | for (parts_iter i = parts.begin(); i != parts.end(); ++i) { 162 | if (!i->filled) 163 | return false; 164 | } 165 | 166 | return true; 167 | } 168 | 169 | int Read::size() { 170 | int s = 0; 171 | 172 | for (parts_iter i = parts.begin(); i != parts.end(); ++i) { 173 | s += i->part.length; 174 | } 175 | 176 | return s; 177 | } 178 | 179 | int Read::read() { 180 | if (size() <= 0) 181 | return 0; 182 | 183 | // Trigger reads of finished pieces 184 | trigger(); 185 | 186 | // Move sliding window to first piece to serve this request 187 | jump(parts.front().part.piece, size()); 188 | 189 | while (!finished() && !failed) 190 | // Wait for any piece to downloaded 191 | pthread_cond_wait(&signal_cond, &lock); 192 | 193 | if (failed) 194 | return -EIO; 195 | else 196 | return size(); 197 | } 198 | 199 | static void 200 | setup() { 201 | printf("Got metadata. Now ready to start downloading.\n"); 202 | 203 | auto ti = handle.torrent_file(); 204 | 205 | if (params.browse_only) 206 | handle.pause(); 207 | 208 | for (int i = 0; i < ti->num_files(); ++i) { 209 | std::string parent(""); 210 | 211 | #if LIBTORRENT_VERSION_NUM < 10100 212 | char *p = strdup(ti->file_at(i).path.c_str()); 213 | #else 214 | char *p = strdup(ti->files().file_path(i).c_str()); 215 | #endif 216 | 217 | if (!p) 218 | continue; 219 | 220 | for (char *x = strtok(p, "/"); x; x = strtok(NULL, "/")) { 221 | if (strlen(x) <= 0) 222 | continue; 223 | 224 | if (parent.length() <= 0) 225 | // Root dir <-> children mapping 226 | dirs["/"].insert(x); 227 | else 228 | // Non-root dir <-> children mapping 229 | dirs[parent].insert(x); 230 | 231 | parent += "/"; 232 | parent += x; 233 | } 234 | 235 | free(p); 236 | 237 | // Path <-> file index mapping 238 | #if LIBTORRENT_VERSION_NUM < 10100 239 | files["/" + ti->file_at(i).path] = i; 240 | #else 241 | files["/" + ti->files().file_path(i)] = i; 242 | #endif 243 | } 244 | } 245 | 246 | static void 247 | handle_read_piece_alert(libtorrent::read_piece_alert *a, Log *log) { 248 | printf("%s: piece %d size %d\n", __func__, static_cast(a->piece), 249 | a->size); 250 | 251 | pthread_mutex_lock(&lock); 252 | 253 | if (a->ec) { 254 | *log << a->message() << std::endl; 255 | 256 | for (reads_iter i = reads.begin(); i != reads.end(); ++i) { 257 | (*i)->fail(a->piece); 258 | } 259 | } else { 260 | for (reads_iter i = reads.begin(); i != reads.end(); ++i) { 261 | (*i)->copy(a->piece, a->buffer.get(), a->size); 262 | } 263 | } 264 | 265 | pthread_mutex_unlock(&lock); 266 | 267 | // Wake up all threads waiting for download 268 | pthread_cond_broadcast(&signal_cond); 269 | } 270 | 271 | static void 272 | handle_piece_finished_alert(libtorrent::piece_finished_alert *a, Log *log) { 273 | printf("%s: %d\n", __func__, static_cast(a->piece_index)); 274 | 275 | pthread_mutex_lock(&lock); 276 | 277 | for (reads_iter i = reads.begin(); i != reads.end(); ++i) { 278 | (*i)->trigger(); 279 | } 280 | 281 | // Advance sliding window 282 | advance(); 283 | 284 | pthread_mutex_unlock(&lock); 285 | } 286 | 287 | static void 288 | handle_torrent_added_alert(libtorrent::torrent_added_alert *a, Log *log) { 289 | pthread_mutex_lock(&lock); 290 | 291 | handle = a->handle; 292 | 293 | if (a->handle.status().has_metadata) 294 | setup(); 295 | 296 | pthread_mutex_unlock(&lock); 297 | } 298 | 299 | static void 300 | handle_metadata_received_alert(libtorrent::metadata_received_alert *a, 301 | Log *log) { 302 | pthread_mutex_lock(&lock); 303 | 304 | handle = a->handle; 305 | 306 | setup(); 307 | 308 | pthread_mutex_unlock(&lock); 309 | } 310 | 311 | static void 312 | handle_alert(libtorrent::alert *a, Log *log) { 313 | switch (a->type()) { 314 | case libtorrent::read_piece_alert::alert_type: 315 | handle_read_piece_alert( 316 | (libtorrent::read_piece_alert *) a, log); 317 | break; 318 | case libtorrent::piece_finished_alert::alert_type: 319 | *log << a->message() << std::endl; 320 | handle_piece_finished_alert( 321 | (libtorrent::piece_finished_alert *) a, log); 322 | break; 323 | case libtorrent::metadata_received_alert::alert_type: 324 | *log << a->message() << std::endl; 325 | handle_metadata_received_alert( 326 | (libtorrent::metadata_received_alert *) a, log); 327 | break; 328 | case libtorrent::torrent_added_alert::alert_type: 329 | *log << a->message() << std::endl; 330 | handle_torrent_added_alert( 331 | (libtorrent::torrent_added_alert *) a, log); 332 | break; 333 | case libtorrent::dht_bootstrap_alert::alert_type: 334 | *log << a->message() << std::endl; 335 | // Force DHT announce because libtorrent won't by itself 336 | handle.force_dht_announce(); 337 | break; 338 | case libtorrent::dht_announce_alert::alert_type: 339 | case libtorrent::dht_reply_alert::alert_type: 340 | case libtorrent::metadata_failed_alert::alert_type: 341 | case libtorrent::tracker_announce_alert::alert_type: 342 | case libtorrent::tracker_reply_alert::alert_type: 343 | case libtorrent::tracker_warning_alert::alert_type: 344 | case libtorrent::tracker_error_alert::alert_type: 345 | case libtorrent::lsd_peer_alert::alert_type: 346 | *log << a->message() << std::endl; 347 | break; 348 | case libtorrent::stats_alert::alert_type: 349 | //*log << a->message() << std::endl; 350 | break; 351 | default: 352 | break; 353 | } 354 | 355 | #if LIBTORRENT_VERSION_NUM < 10100 356 | delete a; 357 | #endif 358 | } 359 | 360 | 361 | static void 362 | alert_queue_loop_destroy(void *data) { 363 | Log *log = (Log *) data; 364 | 365 | if (log) 366 | delete log; 367 | } 368 | 369 | static void* 370 | alert_queue_loop(void *data) { 371 | int oldstate, oldtype; 372 | 373 | pthread_setcancelstate(PTHREAD_CANCEL_ENABLE, &oldstate); 374 | pthread_setcanceltype(PTHREAD_CANCEL_DEFERRED, &oldtype); 375 | 376 | pthread_cleanup_push(&alert_queue_loop_destroy, data); 377 | 378 | while (1) { 379 | if (!session->wait_for_alert(libtorrent::seconds(1))) 380 | continue; 381 | 382 | #if LIBTORRENT_VERSION_NUM < 10100 383 | std::deque alerts; 384 | 385 | session->pop_alerts(&alerts); 386 | 387 | for (std::deque::iterator i = 388 | alerts.begin(); i != alerts.end(); ++i) { 389 | handle_alert(*i, (Log *) data); 390 | } 391 | #else 392 | std::vector alerts; 393 | 394 | session->pop_alerts(&alerts); 395 | 396 | for (std::vector::iterator i = 397 | alerts.begin(); i != alerts.end(); ++i) { 398 | handle_alert(*i, (Log *) data); 399 | } 400 | #endif 401 | } 402 | 403 | pthread_cleanup_pop(1); 404 | 405 | return NULL; 406 | } 407 | 408 | static bool 409 | is_root(const char *path) { 410 | return strcmp(path, "/") == 0; 411 | } 412 | 413 | static bool 414 | is_dir(const char *path) { 415 | return dirs.find(path) != dirs.end(); 416 | } 417 | 418 | static bool 419 | is_file(const char *path) { 420 | return files.find(path) != files.end(); 421 | } 422 | 423 | static int 424 | btfs_getattr(const char *path, struct stat *stbuf, 425 | struct fuse_file_info *fi) { 426 | (void) fi; 427 | if (!is_dir(path) && !is_file(path) && !is_root(path)) 428 | return -ENOENT; 429 | 430 | pthread_mutex_lock(&lock); 431 | 432 | memset(stbuf, 0, sizeof (*stbuf)); 433 | 434 | stbuf->st_uid = getuid(); 435 | stbuf->st_gid = getgid(); 436 | stbuf->st_mtime = time_of_mount; 437 | 438 | if (is_root(path) || is_dir(path)) { 439 | stbuf->st_mode = S_IFDIR | 0755; 440 | } else { 441 | auto ti = handle.torrent_file(); 442 | 443 | #if LIBTORRENT_VERSION_NUM < 10100 444 | int64_t file_size = ti->file_at(files[path]).size; 445 | #else 446 | int64_t file_size = ti->files().file_size(files[path]); 447 | #endif 448 | 449 | #if LIBTORRENT_VERSION_NUM < 10200 450 | std::vector progress; 451 | #else 452 | std::vector progress; 453 | #endif 454 | 455 | // Get number of bytes downloaded of each file 456 | handle.file_progress(progress, 457 | libtorrent::torrent_handle::piece_granularity); 458 | 459 | stbuf->st_blocks = progress[(size_t) files[path]] / 512; 460 | stbuf->st_mode = S_IFREG | 0444; 461 | stbuf->st_size = file_size; 462 | } 463 | 464 | pthread_mutex_unlock(&lock); 465 | 466 | return 0; 467 | } 468 | 469 | static int 470 | btfs_readdir(const char *path, void *buf, fuse_fill_dir_t filler, 471 | off_t offset, struct fuse_file_info *fi, 472 | enum fuse_readdir_flags flags) { 473 | (void)flags; 474 | if (!is_dir(path) && !is_file(path) && !is_root(path)) 475 | return -ENOENT; 476 | 477 | if (is_file(path)) 478 | return -ENOTDIR; 479 | 480 | pthread_mutex_lock(&lock); 481 | 482 | filler(buf, ".", NULL, 0, (enum fuse_fill_dir_flags)0); 483 | filler(buf, "..", NULL, 0, (enum fuse_fill_dir_flags)0); 484 | 485 | for (std::set::iterator i = dirs[path].begin(); 486 | i != dirs[path].end(); ++i) { 487 | filler(buf, i->c_str(), NULL, 0, (enum fuse_fill_dir_flags)0); 488 | } 489 | 490 | pthread_mutex_unlock(&lock); 491 | 492 | return 0; 493 | } 494 | 495 | static int 496 | btfs_open(const char *path, struct fuse_file_info *fi) { 497 | if (!is_dir(path) && !is_file(path)) 498 | return -ENOENT; 499 | 500 | if (is_dir(path)) 501 | return -EISDIR; 502 | 503 | if ((fi->flags & 3) != O_RDONLY) 504 | return -EACCES; 505 | 506 | return 0; 507 | } 508 | 509 | static int 510 | btfs_read(const char *path, char *buf, size_t size, off_t offset, 511 | struct fuse_file_info *fi) { 512 | if (!is_dir(path) && !is_file(path)) 513 | return -ENOENT; 514 | 515 | if (is_dir(path)) 516 | return -EISDIR; 517 | 518 | if (params.browse_only) 519 | return -EACCES; 520 | 521 | pthread_mutex_lock(&lock); 522 | 523 | Read *r = new Read(buf, files[path], offset, size); 524 | 525 | reads.push_back(r); 526 | 527 | // Wait for read to finish 528 | int s = r->read(); 529 | 530 | reads.remove(r); 531 | 532 | delete r; 533 | 534 | pthread_mutex_unlock(&lock); 535 | 536 | return s; 537 | } 538 | 539 | static int 540 | btfs_statfs(const char *path, struct statvfs *stbuf) { 541 | if (!handle.is_valid()) 542 | return -ENOENT; 543 | 544 | libtorrent::torrent_status st = handle.status(); 545 | 546 | if (!st.has_metadata) 547 | return -ENOENT; 548 | 549 | auto ti = handle.torrent_file(); 550 | 551 | stbuf->f_bsize = 4096; 552 | stbuf->f_frsize = 512; 553 | stbuf->f_blocks = (fsblkcnt_t) (ti->total_size() / 512); 554 | stbuf->f_bfree = (fsblkcnt_t) ((ti->total_size() - st.total_done) / 512); 555 | stbuf->f_bavail = (fsblkcnt_t) ((ti->total_size() - st.total_done) / 512); 556 | stbuf->f_files = (fsfilcnt_t) (files.size() + dirs.size()); 557 | stbuf->f_ffree = 0; 558 | 559 | return 0; 560 | } 561 | 562 | static void * 563 | btfs_init(struct fuse_conn_info *conn, 564 | struct fuse_config *cfg) { 565 | pthread_mutex_lock(&lock); 566 | 567 | time_of_mount = time(NULL); 568 | 569 | libtorrent::add_torrent_params *p = (libtorrent::add_torrent_params *) 570 | fuse_get_context()->private_data; 571 | 572 | #if LIBTORRENT_VERSION_NUM < 10200 573 | int flags = 574 | #else 575 | libtorrent::session_flags_t flags = 576 | #endif 577 | libtorrent::session::add_default_plugins | 578 | libtorrent::session::start_default_features; 579 | 580 | #if LIBTORRENT_VERSION_NUM < 10200 581 | int alerts = 582 | #else 583 | libtorrent::alert_category_t alerts = 584 | #endif 585 | libtorrent::alert::tracker_notification | 586 | libtorrent::alert::stats_notification | 587 | libtorrent::alert::storage_notification | 588 | libtorrent::alert::progress_notification | 589 | libtorrent::alert::status_notification | 590 | libtorrent::alert::error_notification | 591 | libtorrent::alert::dht_notification | 592 | libtorrent::alert::peer_notification; 593 | 594 | #if LIBTORRENT_VERSION_NUM < 10100 595 | session = new libtorrent::session( 596 | libtorrent::fingerprint( 597 | "LT", 598 | LIBTORRENT_VERSION_MAJOR, 599 | LIBTORRENT_VERSION_MINOR, 600 | 0, 601 | 0), 602 | std::make_pair(params.min_port, params.max_port), 603 | "0.0.0.0", 604 | flags, 605 | alerts); 606 | 607 | libtorrent::session_settings se = session->settings(); 608 | 609 | se.request_timeout = 10; 610 | se.strict_end_game_mode = false; 611 | se.announce_to_all_trackers = true; 612 | se.announce_to_all_tiers = true; 613 | se.enable_incoming_tcp = !params.utp_only; 614 | se.enable_outgoing_tcp = !params.utp_only; 615 | se.download_rate_limit = params.max_download_rate * 1024; 616 | se.upload_rate_limit = params.max_upload_rate * 1024; 617 | 618 | session->set_settings(se); 619 | session->add_dht_router(std::make_pair("router.bittorrent.com", 6881)); 620 | session->add_dht_router(std::make_pair("router.utorrent.com", 6881)); 621 | session->add_dht_router(std::make_pair("dht.transmissionbt.com", 6881)); 622 | session->async_add_torrent(*p); 623 | #else 624 | libtorrent::settings_pack pack; 625 | 626 | std::ostringstream interfaces; 627 | 628 | // First port 629 | interfaces << "0.0.0.0:" << params.min_port; 630 | 631 | // Possibly more ports, but at most 5 632 | for (int i = params.min_port + 1; i <= params.max_port && 633 | i < params.min_port + 5; i++) 634 | interfaces << ",0.0.0.0:" << i; 635 | 636 | std::string fingerprint = 637 | "LT" 638 | STRINGIFY(LIBTORRENT_VERSION_MAJOR) 639 | STRINGIFY(LIBTORRENT_VERSION_MINOR) 640 | "00"; 641 | 642 | #if LIBTORRENT_VERSION_NUM >= 10101 643 | pack.set_str(pack.dht_bootstrap_nodes, 644 | "router.bittorrent.com:6881," 645 | "router.utorrent.com:6881," 646 | "dht.transmissionbt.com:6881"); 647 | #endif 648 | 649 | pack.set_int(pack.request_timeout, 10); 650 | pack.set_str(pack.listen_interfaces, interfaces.str()); 651 | pack.set_bool(pack.strict_end_game_mode, false); 652 | pack.set_bool(pack.announce_to_all_trackers, true); 653 | pack.set_bool(pack.announce_to_all_tiers, true); 654 | pack.set_bool(pack.enable_incoming_tcp, !params.utp_only); 655 | pack.set_bool(pack.enable_outgoing_tcp, !params.utp_only); 656 | pack.set_int(pack.download_rate_limit, params.max_download_rate * 1024); 657 | pack.set_int(pack.upload_rate_limit, params.max_upload_rate * 1024); 658 | pack.set_int(pack.alert_mask, alerts); 659 | 660 | session = new libtorrent::session(pack, flags); 661 | 662 | #if LIBTORRENT_VERSION_NUM < 10101 663 | session->add_dht_router(std::make_pair("router.bittorrent.com", 6881)); 664 | session->add_dht_router(std::make_pair("router.utorrent.com", 6881)); 665 | session->add_dht_router(std::make_pair("dht.transmissionbt.com", 6881)); 666 | #endif 667 | 668 | session->add_torrent(*p); 669 | #endif 670 | 671 | pthread_create(&alert_thread, NULL, alert_queue_loop, 672 | new Log(params.silent ? std::string() : (p->save_path + "/../log.txt"))); 673 | 674 | #ifdef HAVE_PTHREAD_SETNAME_NP 675 | pthread_setname_np(alert_thread, "alert"); 676 | #endif 677 | 678 | pthread_mutex_unlock(&lock); 679 | 680 | return NULL; 681 | } 682 | 683 | static void 684 | btfs_destroy(void *user_data) { 685 | pthread_mutex_lock(&lock); 686 | 687 | pthread_cancel(alert_thread); 688 | pthread_join(alert_thread, NULL); 689 | 690 | #if LIBTORRENT_VERSION_NUM < 10200 691 | int flags = 0; 692 | #else 693 | libtorrent::remove_flags_t flags = {}; 694 | #endif 695 | 696 | if (!params.keep) 697 | flags |= libtorrent::session::delete_files; 698 | 699 | session->remove_torrent(handle, flags); 700 | 701 | delete session; 702 | 703 | pthread_mutex_unlock(&lock); 704 | } 705 | 706 | static int 707 | btfs_listxattr(const char *path, char *data, size_t len) { 708 | const char *xattrs = NULL; 709 | int xattrslen = 0; 710 | 711 | if (is_root(path)) { 712 | xattrs = XATTR_IS_BTFS "\0" XATTR_IS_BTFS_ROOT; 713 | xattrslen = sizeof (XATTR_IS_BTFS "\0" XATTR_IS_BTFS_ROOT); 714 | } else if (is_dir(path)) { 715 | xattrs = XATTR_IS_BTFS; 716 | xattrslen = sizeof (XATTR_IS_BTFS); 717 | } else if (is_file(path)) { 718 | xattrs = XATTR_IS_BTFS "\0" XATTR_FILE_INDEX; 719 | xattrslen = sizeof (XATTR_IS_BTFS "\0" XATTR_FILE_INDEX); 720 | } else { 721 | return -ENOENT; 722 | } 723 | 724 | // The minimum required length 725 | if (len == 0) 726 | return xattrslen; 727 | 728 | if (len < (size_t) xattrslen) 729 | return -ERANGE; 730 | 731 | memcpy(data, xattrs, (size_t) xattrslen); 732 | 733 | return xattrslen; 734 | } 735 | 736 | #ifdef __APPLE__ 737 | static int 738 | btfs_getxattr(const char *path, const char *key, char *value, size_t len, 739 | uint32_t position) { 740 | #else 741 | static int 742 | btfs_getxattr(const char *path, const char *key, char *value, size_t len) { 743 | uint32_t position = 0; 744 | #endif 745 | char xattr[16]; 746 | int xattrlen = 0; 747 | 748 | std::string k(key); 749 | 750 | if (is_file(path) && k == XATTR_FILE_INDEX) { 751 | xattrlen = snprintf(xattr, sizeof (xattr), "%d", files[path]); 752 | } else if (is_root(path) && k == XATTR_IS_BTFS_ROOT) { 753 | xattrlen = 0; 754 | } else if (k == XATTR_IS_BTFS) { 755 | xattrlen = 0; 756 | } else { 757 | return -ENODATA; 758 | } 759 | 760 | // The minimum required length 761 | if (len == 0) 762 | return xattrlen; 763 | 764 | if (position >= (uint32_t) xattrlen) 765 | return 0; 766 | 767 | if (len < (size_t) xattrlen - position) 768 | return -ERANGE; 769 | 770 | memcpy(value, xattr + position, (size_t) xattrlen - position); 771 | 772 | return xattrlen - (int) position; 773 | } 774 | 775 | static bool 776 | populate_target(std::string& target, char *arg) { 777 | std::string templ; 778 | 779 | if (arg) { 780 | templ += arg; 781 | } else if (getenv("XDG_DATA_HOME")) { 782 | templ += getenv("XDG_DATA_HOME"); 783 | templ += "/btfs"; 784 | } else if (getenv("HOME")) { 785 | templ += getenv("HOME"); 786 | templ += "/btfs"; 787 | } else { 788 | templ += "/tmp/btfs"; 789 | } 790 | 791 | if (mkdir(templ.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH) < 0) { 792 | if (errno != EEXIST) 793 | RETV(perror("Failed to create target"), false); 794 | } 795 | 796 | templ += "/btfs-XXXXXX"; 797 | 798 | char *s = strdup(templ.c_str()); 799 | 800 | if (s != NULL && mkdtemp(s) != NULL) { 801 | char *x = realpath(s, NULL); 802 | 803 | if (x) 804 | target = x; 805 | else 806 | perror("Failed to expand target"); 807 | 808 | free(x); 809 | } else { 810 | perror("Failed to generate target"); 811 | } 812 | 813 | free(s); 814 | 815 | return target.length() > 0; 816 | } 817 | 818 | static size_t 819 | handle_http(void *contents, size_t size, size_t nmemb, void *userp) { 820 | Array *output = (Array *) userp; 821 | 822 | // Offset into buffer to write to 823 | size_t off = output->size; 824 | 825 | output->expand(nmemb * size); 826 | 827 | memcpy(output->buf + off, contents, nmemb * size); 828 | 829 | // Must return number of bytes copied 830 | return nmemb * size; 831 | } 832 | 833 | static bool 834 | populate_metadata(libtorrent::add_torrent_params& p, const char *arg) { 835 | std::string uri(arg); 836 | 837 | if (uri.find("http:") == 0 || uri.find("https:") == 0) { 838 | Array output; 839 | 840 | CURL *ch = curl_easy_init(); 841 | 842 | curl_easy_setopt(ch, CURLOPT_URL, uri.c_str()); 843 | curl_easy_setopt(ch, CURLOPT_WRITEFUNCTION, handle_http); 844 | curl_easy_setopt(ch, CURLOPT_WRITEDATA, (void *) &output); 845 | curl_easy_setopt(ch, CURLOPT_USERAGENT, "btfs/" VERSION); 846 | curl_easy_setopt(ch, CURLOPT_FOLLOWLOCATION, 1); 847 | 848 | CURLcode res = curl_easy_perform(ch); 849 | 850 | if(res != CURLE_OK) 851 | RETV(fprintf(stderr, "Download metadata failed: %s\n", 852 | curl_easy_strerror(res)), false); 853 | 854 | curl_easy_cleanup(ch); 855 | 856 | libtorrent::error_code ec; 857 | 858 | #if LIBTORRENT_VERSION_NUM < 10100 859 | p.ti = new libtorrent::torrent_info((const char *) output.buf, 860 | (int) output.size, ec); 861 | #elif LIBTORRENT_VERSION_NUM < 10200 862 | p.ti = boost::make_shared( 863 | (const char *) output.buf, (int) output.size, 864 | boost::ref(ec)); 865 | #else 866 | p.ti = std::make_shared( 867 | (const char *) output.buf, (int) output.size, 868 | std::ref(ec)); 869 | #endif 870 | 871 | if (ec) 872 | RETV(fprintf(stderr, "Parse metadata failed: %s\n", 873 | ec.message().c_str()), false); 874 | 875 | if (params.browse_only) 876 | #if LIBTORRENT_VERSION_NUM < 10200 877 | p.flags |= libtorrent::add_torrent_params::flag_paused; 878 | #else 879 | p.flags |= libtorrent::torrent_flags::paused; 880 | #endif 881 | } else if (uri.find("magnet:") == 0) { 882 | libtorrent::error_code ec; 883 | 884 | parse_magnet_uri(uri, p, ec); 885 | 886 | if (ec) 887 | RETV(fprintf(stderr, "Parse magnet failed: %s\n", 888 | ec.message().c_str()), false); 889 | } else { 890 | char *r = realpath(uri.c_str(), NULL); 891 | 892 | if (!r) 893 | RETV(perror("Find metadata failed"), false); 894 | 895 | libtorrent::error_code ec; 896 | 897 | #if LIBTORRENT_VERSION_NUM < 10100 898 | p.ti = new libtorrent::torrent_info(r, ec); 899 | #elif LIBTORRENT_VERSION_NUM < 10200 900 | p.ti = boost::make_shared(r, 901 | boost::ref(ec)); 902 | #else 903 | p.ti = std::make_shared(r, 904 | std::ref(ec)); 905 | #endif 906 | 907 | free(r); 908 | 909 | if (ec) 910 | RETV(fprintf(stderr, "Parse metadata failed: %s\n", 911 | ec.message().c_str()), false); 912 | 913 | if (params.browse_only) 914 | #if LIBTORRENT_VERSION_NUM < 10200 915 | p.flags |= libtorrent::add_torrent_params::flag_paused; 916 | #else 917 | p.flags |= libtorrent::torrent_flags::paused; 918 | #endif 919 | } 920 | 921 | return true; 922 | } 923 | 924 | #define BTFS_OPT(t, p, v) { t, offsetof(struct btfs_params, p), v } 925 | 926 | static const struct fuse_opt btfs_opts[] = { 927 | BTFS_OPT("-v", version, 1), 928 | BTFS_OPT("--version", version, 1), 929 | BTFS_OPT("-h", help, 1), 930 | BTFS_OPT("--help", help, 1), 931 | BTFS_OPT("--help-fuse", help_fuse, 1), 932 | BTFS_OPT("-b", browse_only, 1), 933 | BTFS_OPT("--browse-only", browse_only, 1), 934 | BTFS_OPT("-k", keep, 1), 935 | BTFS_OPT("--keep", keep, 1), 936 | BTFS_OPT("-s", silent, 1), 937 | BTFS_OPT("--silent", silent, 1), 938 | BTFS_OPT("--utp-only", utp_only, 1), 939 | BTFS_OPT("--data-directory=%s", data_directory, 4), 940 | BTFS_OPT("--min-port=%lu", min_port, 4), 941 | BTFS_OPT("--max-port=%lu", max_port, 4), 942 | BTFS_OPT("--max-download-rate=%lu", max_download_rate, 4), 943 | BTFS_OPT("--max-upload-rate=%lu", max_upload_rate, 4), 944 | FUSE_OPT_END 945 | }; 946 | 947 | static int 948 | btfs_process_arg(void *data, const char *arg, int key, 949 | struct fuse_args *outargs) { 950 | // Number of NONOPT options so far 951 | static int n = 0; 952 | 953 | struct btfs_params *params = (struct btfs_params *) data; 954 | 955 | if (key == FUSE_OPT_KEY_NONOPT) { 956 | if (n++ == 0) 957 | params->metadata = arg; 958 | 959 | return n <= 1 ? 0 : 1; 960 | } 961 | 962 | return 1; 963 | } 964 | 965 | static void 966 | print_help() { 967 | printf("usage: " PACKAGE " [options] metadata mountpoint\n"); 968 | printf("\n"); 969 | printf("btfs options:\n"); 970 | printf(" --version -v show version information\n"); 971 | printf(" --help -h show this message\n"); 972 | printf(" --help-fuse print all fuse options\n"); 973 | printf(" --browse-only -b download metadata only\n"); 974 | printf(" --keep -k keep files after unmount\n"); 975 | printf(" --silent -s do not create logs\n"); 976 | printf(" --utp-only do not use TCP\n"); 977 | printf(" --data-directory=dir directory in which to put btfs data\n"); 978 | printf(" --min-port=N start of listen port range\n"); 979 | printf(" --max-port=N end of listen port range\n"); 980 | printf(" --max-download-rate=N max download rate (in kB/s)\n"); 981 | printf(" --max-upload-rate=N max upload rate (in kB/s)\n"); 982 | } 983 | 984 | int 985 | main(int argc, char *argv[]) { 986 | struct fuse_operations btfs_ops; 987 | memset(&btfs_ops, 0, sizeof (btfs_ops)); 988 | 989 | btfs_ops.getattr = btfs_getattr; 990 | btfs_ops.readdir = btfs_readdir; 991 | btfs_ops.open = btfs_open; 992 | btfs_ops.read = btfs_read; 993 | btfs_ops.statfs = btfs_statfs; 994 | btfs_ops.listxattr = btfs_listxattr; 995 | btfs_ops.getxattr = btfs_getxattr; 996 | btfs_ops.init = btfs_init; 997 | btfs_ops.destroy = btfs_destroy; 998 | 999 | struct fuse_args args = FUSE_ARGS_INIT(argc, argv); 1000 | 1001 | if (fuse_opt_parse(&args, ¶ms, btfs_opts, btfs_process_arg)) 1002 | RETV(fprintf(stderr, "Failed to parse options\n"), -1); 1003 | 1004 | if (!params.metadata) 1005 | params.help = 1; 1006 | 1007 | if (params.version) { 1008 | printf(PACKAGE " version: " VERSION "\n"); 1009 | printf("libtorrent version: " LIBTORRENT_VERSION "\n"); 1010 | 1011 | // Let FUSE print more versions 1012 | fuse_opt_add_arg(&args, "--version"); 1013 | fuse_main(args.argc, args.argv, &btfs_ops, NULL); 1014 | 1015 | return 0; 1016 | } 1017 | 1018 | if (params.help || params.help_fuse) { 1019 | // Print info about btfs' command line options 1020 | print_help(); 1021 | 1022 | if (params.help_fuse) { 1023 | printf("\n"); 1024 | 1025 | // Let FUSE print more help 1026 | fuse_opt_add_arg(&args, "-ho"); 1027 | fuse_main(args.argc, args.argv, &btfs_ops, NULL); 1028 | } 1029 | 1030 | return 0; 1031 | } 1032 | 1033 | if (params.min_port == 0 && params.max_port == 0) { 1034 | // Default ports are the standard Bittorrent range 1035 | params.min_port = 6881; 1036 | params.max_port = 6889; 1037 | } else if (params.min_port == 0) { 1038 | params.min_port = 1024; 1039 | } else if (params.max_port == 0) { 1040 | params.max_port = 65535; 1041 | } 1042 | 1043 | if (params.min_port > params.max_port) 1044 | RETV(fprintf(stderr, "Invalid port range\n"), -1); 1045 | 1046 | std::string target; 1047 | 1048 | if (!populate_target(target, params.data_directory)) 1049 | return -1; 1050 | 1051 | libtorrent::add_torrent_params p; 1052 | 1053 | #if LIBTORRENT_VERSION_NUM < 10200 1054 | p.flags &= ~libtorrent::add_torrent_params::flag_auto_managed; 1055 | p.flags &= ~libtorrent::add_torrent_params::flag_paused; 1056 | #else 1057 | p.flags &= ~libtorrent::torrent_flags::auto_managed; 1058 | p.flags &= ~libtorrent::torrent_flags::paused; 1059 | #endif 1060 | p.save_path = target + "/files"; 1061 | 1062 | if (mkdir(p.save_path.c_str(), 0777) < 0) 1063 | RETV(perror("Failed to create files directory"), -1); 1064 | 1065 | curl_global_init(CURL_GLOBAL_ALL); 1066 | 1067 | if (!populate_metadata(p, params.metadata)) 1068 | return -1; 1069 | 1070 | fuse_main(args.argc, args.argv, &btfs_ops, (void *) &p); 1071 | 1072 | curl_global_cleanup(); 1073 | 1074 | if (!params.keep) { 1075 | if (rmdir(p.save_path.c_str())) 1076 | RETV(perror("Failed to remove files directory"), -1); 1077 | 1078 | if (rmdir(target.c_str())) 1079 | RETV(perror("Failed to remove target directory"), -1); 1080 | } 1081 | 1082 | return 0; 1083 | } 1084 | -------------------------------------------------------------------------------- /src/btfs.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright 2015 Johan Gunnarsson 3 | 4 | This file is part of BTFS. 5 | 6 | BTFS is free software: you can redistribute it and/or modify 7 | it under the terms of the GNU General Public License as published by 8 | the Free Software Foundation, either version 3 of the License, or 9 | (at your option) any later version. 10 | 11 | BTFS is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU General Public License for more details. 15 | 16 | You should have received a copy of the GNU General Public License 17 | along with BTFS. If not, see . 18 | */ 19 | 20 | #ifndef BTFS_H 21 | #define BTFS_H 22 | 23 | #include 24 | #include 25 | #include 26 | 27 | #include "libtorrent/config.hpp" 28 | #include 29 | 30 | #include "btfsstat.h" 31 | 32 | namespace btfs 33 | { 34 | 35 | class Part; 36 | class Read; 37 | 38 | typedef std::vector::iterator parts_iter; 39 | typedef std::list::iterator reads_iter; 40 | 41 | class Part 42 | { 43 | friend class Read; 44 | 45 | public: 46 | Part(libtorrent::peer_request p, char *b) : part(p), buf(b), 47 | filled(false) { 48 | } 49 | 50 | private: 51 | libtorrent::peer_request part; 52 | 53 | char *buf; 54 | 55 | bool filled; 56 | }; 57 | 58 | class Read 59 | { 60 | public: 61 | Read(char *buf, int index, off_t offset, size_t size); 62 | 63 | void fail(int piece); 64 | 65 | void copy(int piece, char *buffer, int size); 66 | 67 | void trigger(); 68 | 69 | bool finished(); 70 | 71 | int size(); 72 | 73 | int read(); 74 | 75 | private: 76 | bool failed = false; 77 | 78 | std::vector parts; 79 | }; 80 | 81 | class Array 82 | { 83 | public: 84 | Array() : buf(0), size(0) { 85 | } 86 | 87 | ~Array() { 88 | free(buf); 89 | } 90 | 91 | bool expand(size_t n) { 92 | return (buf = (char *) realloc((void *) buf, size += n)) != NULL; 93 | } 94 | 95 | char *buf; 96 | 97 | size_t size; 98 | }; 99 | 100 | class Log : public std::ofstream 101 | { 102 | public: 103 | Log(std::string p) : std::ofstream(p.empty() ? "/dev/null" : p.c_str()), path(p) { 104 | if (!is_open()) 105 | // If open log file fails, write to a dummy file 106 | open("/dev/null"); 107 | } 108 | 109 | ~Log() { 110 | close(); 111 | 112 | if (!path.empty() && remove(path.c_str())) 113 | perror("Failed to remove log"); 114 | } 115 | 116 | private: 117 | std::string path; 118 | }; 119 | 120 | struct btfs_params { 121 | int version; 122 | int help; 123 | int help_fuse; 124 | int browse_only; 125 | int keep; 126 | int silent; 127 | int utp_only; 128 | char *data_directory; 129 | int min_port; 130 | int max_port; 131 | int max_download_rate; 132 | int max_upload_rate; 133 | const char *metadata; 134 | }; 135 | 136 | } 137 | 138 | #endif 139 | -------------------------------------------------------------------------------- /src/btfsstat.cc: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | 10 | #include 11 | #include 12 | #include 13 | 14 | #include 15 | #include 16 | #include 17 | 18 | #include "btfsstat.h" 19 | 20 | #ifndef ENOATTR 21 | #define ENOATTR ENODATA 22 | #endif 23 | 24 | using namespace btfs; 25 | 26 | static bool 27 | string_compare(const std::string& a, const std::string& b) { 28 | return a.compare(b) == 0; 29 | } 30 | 31 | static std::list 32 | list(std::string path) { 33 | std::list files; 34 | 35 | DIR *dp = opendir(path.c_str()); 36 | 37 | if (!dp) 38 | return files; 39 | 40 | for (struct dirent *ep = readdir(dp); ep; ep = readdir(dp)) { 41 | std::string f(ep->d_name); 42 | 43 | if (f != "." && f != "..") 44 | files.push_back(f); 45 | } 46 | 47 | closedir(dp); 48 | 49 | files.sort(string_compare); 50 | 51 | return files; 52 | } 53 | 54 | static void 55 | scan(std::string indent, std::string d, std::string f) { 56 | struct stat s; 57 | memset(&s, 0, sizeof (s)); 58 | 59 | std::string p = d + "/" + f; 60 | 61 | if (lstat(p.c_str(), &s) < 0) 62 | return; 63 | 64 | if (S_ISDIR(s.st_mode)) { 65 | printf("%s%s/\n", indent.c_str(), f.c_str()); 66 | 67 | std::list l = list(p); 68 | 69 | for (auto i = l.begin(); i != l.end(); ++i) { 70 | scan(indent + " ", p, *i); 71 | } 72 | } else if (S_ISREG(s.st_mode)) { 73 | // Download progress for this file (in percent) 74 | long progress; 75 | 76 | if (s.st_size > 0) 77 | progress = lround((100.0 * 512.0 * (double) s.st_blocks) / 78 | (double) s.st_size); 79 | else 80 | progress = 100; 81 | 82 | printf("%s%s (%3ld%%)\n", indent.c_str(), f.c_str(), progress); 83 | } 84 | } 85 | 86 | int 87 | main(int argc, char *argv[]) { 88 | if (argc < 2) { 89 | printf("Usage: %s MOUNT_POINTS...\n", argv[0]); 90 | return 1; 91 | } 92 | 93 | for (int i = 1; i < argc; i++) { 94 | #ifdef __APPLE__ 95 | if (getxattr(argv[i], XATTR_IS_BTFS, NULL, 0, 0, 0) < 0) { 96 | #else 97 | if (getxattr(argv[i], XATTR_IS_BTFS, NULL, 0) < 0) { 98 | #endif 99 | printf("%s: %s is not a btfs mount: %s\n", argv[0], argv[i], 100 | strerror(errno)); 101 | return 2; 102 | } 103 | 104 | char *root = realpath(argv[i], NULL); 105 | 106 | if (!root) { 107 | perror("failed to canonicalize path"); 108 | return 3; 109 | } 110 | 111 | char *dir = strdup(root); 112 | char *base = strdup(root); 113 | 114 | scan("", dirname(root), basename(root)); 115 | 116 | free(base); 117 | free(dir); 118 | 119 | free(root); 120 | } 121 | 122 | return 0; 123 | } 124 | -------------------------------------------------------------------------------- /src/btfsstat.h: -------------------------------------------------------------------------------- 1 | #ifndef __BTFSSTAT_H__ 2 | #define __BTFSSTAT_H__ 3 | 4 | #define XATTR_FILE_INDEX "user.btfs.file_index" 5 | #define XATTR_IS_BTFS_ROOT "user.btfs.is_btfs_root" 6 | #define XATTR_IS_BTFS "user.btfs.is_btfs" 7 | 8 | namespace btfs 9 | { 10 | } 11 | 12 | #endif 13 | --------------------------------------------------------------------------------