├── .gitattributes ├── .gitignore ├── LICENSE ├── README.md ├── SimpleFS.c └── old_version ├── JCFS.cpp ├── JCFS.h ├── README.md ├── readme_pic ├── linux_result.png ├── run_result_1.png └── windows_result.png └── stdafx.h /.gitattributes: -------------------------------------------------------------------------------- 1 | # Auto detect text files and perform LF normalization 2 | * text=auto 3 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | 2 | stdafx.cpp 3 | -------------------------------------------------------------------------------- /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 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) 2017 {name of author} 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 | HDU_OS_Assignment_2017_SimpleFileSystem Copyright (C) 2017 yjc567 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 | . -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # 杭州电子科技大学操作系统课程设计：简单文件系统的实现 2 | 3 | *如有需要，欢迎自行取用，但是不建议你拿着这个代码去验收，自己的知识永远是自己的，好好学习才是王道！* 4 | 5 | 代码为文件`SimpleFS.c`，可以直接运行，每个函数都写好了注释（本来是想用不同的文件写不同的代码，这样代码之间的组织结构更清晰，但是自己还是太菜了，c之间的多文件的结构太伤人脑筋，如果以后有空我再重新组织组织），然后写了一个相关的[文档](https://blog.csdn.net/dpppBR/article/details/78895262)，写的不好，希望能起到对repo说明的作用。 6 | 7 | 2017版本的文件系统实验说明并没有很系统地说明需要学生完成的任务，特别是有些细节没有说清会让人产生误解（而且有些函数根本不是哪里都可以调用的好吧嘤嘤嘤），自己和老师说了很多课程设计中不合理的地方，但是老师只是笑了一笑………… 8 | 9 | **如果有疑问（特别是发现了代码的bug！），欢迎给我发邮件（yjc567@foxmail.com），或者直接在此repo中添加issue。** 10 | 11 | 如果你使用的是Linux系统，请把代码第8行的`#define OS_WINDOWS`改为`#define OS_LINUX`，这样文件夹在终端中会显示为绿色（其实你可以给各种字段加上各种颜色，但是我累了，改不动了，如果有人想改还希望fork一下）。如图: 12 | 13 | ![linux_result.png](old_version/readme_pic/linux_result.png) 14 | 15 | 否则只有一个`dir`的提示符提示这个是一个目录文件夹。如图： 16 | 17 | ![windows_result.png](old_version/readme_pic/windows_result.png) 18 | 19 | ## TODO： 20 | 21 | 以后可以改进的地方 22 | 23 | 1. 选择在一个父目录下添加fcb时，应该选择其磁盘上第一个空闲的fcb块作为新添加fcb的位置，以增大磁盘的利用率，本代码因为时间匆忙，不在细节上做过多的优化（sjt说可以删除fcb的时候，把空闲出的位置用最后一个fcb块填充，同时把父目录fcb的length减去sizeof fcb，这样可以充分利用fat的空间，不知道实际的fat系统是否是这样做的） 24 | 2. fcb的data和time两个成员变量应该是记录一个文件的创建时间的（按理说应该还有文件的最新更新时间也要记录）因为实验要求里的逻辑无法验证这两个变量是否存在，为了缩短编程的时间，没有任何与这两个成员变量相关的操作 25 | 3. fcb的exname成员变量记录的是文件的后缀名，与2同理，实验要求里的逻辑无法验证这个变量是否存在（因为可以把文件名加上后缀名一起作为文件名），所以代码里目前也没有与这个成员变量相关的操作（验收的时候老师竟然自己都清楚这个问题，根本不问我后缀名的事情！） 26 | 4. main里面其实就是一个读入命令和参数，然后执行相关命令的过程，所以应该一次直接读入一行，然后判断里面的命令和参数是否合法，但自己的写法没有判断换行（因为这样有点小烦……），有时会导致错误的发生 27 | 5. 代码应该尽量抽象，使用更多的c高级语法，以降低后期的维护成本（当然我验收完就不会用这个代码了 :) ） 28 | 6. 有一个遍历文件夹的内容的代码重复了5次（也许是6次），但是每次需要做的事情都不一样，所以需要利用函数指针来避免代码重复 29 | 7. 代码里有太多错误提示了，在代码逐渐完善后，不如把错误提示全去了，要是真的崩溃了，就让程序崩溃把（py还好，感觉c这样写真的药丸） 30 | 31 | 32 | -------------------------------------------------------------------------------- /SimpleFS.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | #define OS_WINDOWS 9 | 10 | // 这里可以修改使用者的用户名 11 | const char USERNAME[] = "jiachen"; 12 | 13 | #define FREE 0 14 | #define DIRLEN 80 15 | #define END 65535 16 | #define SIZE 1024000 17 | #define BLOCKNUM 1000 18 | #define BLOCKSIZE 1024 19 | #define MAXOPENFILE 10 20 | #define ROOTBLOCKNUM 2 21 | 22 | #define SAYERROR printf("ERROR: ") 23 | #define max(X, Y) (((X) > (Y)) ? (X) : (Y)) 24 | #define min(X, Y) (((X) < (Y)) ? (X) : (Y)) 25 | 26 | #ifdef OS_WINDOWS 27 | #define GRN "dir:" 28 | #define RESET "" 29 | #endif //OS_WINDOWS 30 | 31 | #ifdef OS_LINUX 32 | #define GRN "\x1B[32m" 33 | #define RESET "\x1B[0m" 34 | #endif //OS_LINUX 35 | 36 | typedef struct FAT { 37 | unsigned short id; 38 | } fat; 39 | 40 | typedef struct FCB { 41 | char free; // 此fcb是否已被删除，因为把一个fcb从磁盘块上删除是很费事的，所以选择利用fcb的free标号来标记其是否被删除 42 | char exname[3]; 43 | char filename[DIRLEN]; 44 | unsigned short time; 45 | unsigned short data; 46 | unsigned short first; // 文件起始盘块号 47 | unsigned long length; // 文件的实际长度 48 | unsigned char attribute; // 文件属性字段：为简单起见，我们只为文件设置了两种属性：值为 0 时表示目录文件，值为 1 时表示数据文件 49 | } fcb; 50 | 51 | // 对于文件夹fcb，其count永远等于其fcb的length， 52 | // 只有文件fcb的count会根据打开方式的不同和读写方式的不同而不同 53 | typedef struct USEROPEN { 54 | fcb open_fcb; // 文件的 FCB 中的内容 55 | int count; // 读写指针在文件中的位置 56 | int dirno; // 相应打开文件的目录项在父目录文件中的盘块号 57 | int diroff; // 相应打开文件的目录项在父目录文件的dirno盘块中的起始位置 58 | char fcbstate; // 是否修改了文件的 FCB 的内容，如果修改了置为 1，否则为 0 59 | char topenfile; // 表示该用户打开表项是否为空，若值为 0，表示为空，否则表示已被某打开文件占据 60 | char dir[DIRLEN]; // 打开文件的绝对路径名，这样方便快速检查出指定文件是否已经打开 61 | } useropen; 62 | 63 | typedef struct BLOCK0 { 64 | unsigned short root; 65 | char information[200]; 66 | unsigned char *startblock; 67 | } block0; 68 | 69 | // utils 70 | // 这里是一些基础的函数，都是一些会重复利用的操作 71 | // 根据所给的参数对fcb进行初始化 72 | void fcb_init(fcb *new_fcb, const char* filename, unsigned short first, unsigned char attribute); 73 | // 根据所给的参数对一个打开文件项进行初始化 74 | void useropen_init(useropen *openfile, int dirno, int diroff, const char* dir); 75 | // 通过dfs对将已使用的fat块释放 76 | void fatFree(int id); 77 | // 得到一个空闲的fat块 78 | int getFreeFatid(); 79 | // 得到一个空闲的打开文件表项 80 | int getFreeOpenlist(); 81 | // 得到一个fat表的下一个fat表，如果没有则创建 82 | int getNextFat(int id); 83 | // 检查一个打开文件表下表是否合法 84 | int check_fd(int fd); 85 | // 把一个路径按'/'分割 86 | int spiltDir(char dirs[DIRLEN][DIRLEN], char *filename); 87 | // 把一个路径的最后一个目录从字符串中删去 88 | void popLastDir(char *dir); 89 | // 把一个路径的最后一个目录从字符串中分割出 90 | void splitLastDir(char *dir, char new_dir[2][DIRLEN]); 91 | // 得到某个长度在某个fat中的对应的盘块号和偏移量，用来记录一个打开文件项在其父目录对应fat的位置 92 | void getPos(int *id, int *offset, unsigned short first, int length); 93 | // 把路径规范化并检查 94 | int rewrite_dir(char *dir); 95 | 96 | // basics 97 | // 根据盘块号和偏移量，直接从FAT上读取指定长度的信息 98 | int fat_read(unsigned short id, unsigned char *text, int offset, int len); 99 | // 读取某个已打开文件的指定长度信息 100 | int do_read(int fd, unsigned char *text, int len); 101 | // 根据盘块号和偏移量，直接从FAT上写入指定长度的信息 102 | int fat_write(unsigned short id, unsigned char *text, int blockoffset, int len); 103 | // 向某个已打开文件写入指定长度信息 104 | int do_write(int fd, unsigned char *text, int len); 105 | // 从一个已打开目录文件找到对应名称的文件夹fcb，用于一些不断递归打开文件夹的函数中 106 | int getFcb(fcb* fcbp, int *dirno, int *diroff, int fd, const char *dir); 107 | // 在一个已打开目录文件下打开某个文件 108 | int getOpenlist(int fd, const char *org_dir); 109 | // 打开文件 110 | int my_open(char *filename); 111 | 112 | // read 113 | // 读取一个文件夹下的fcb信息 114 | int read_ls(int fd, unsigned char *text, int len); 115 | // 把一个文件夹下的fcb信息打印出来 116 | void my_ls(); 117 | // 把一个打开文件的内容根据文件指针打印出来 118 | int my_read(int fd); 119 | // 重新从磁盘中读取一个打开文件的fcb内容 120 | void my_reload(int fd); 121 | 122 | // write 123 | // 把键盘输入的信息写入一个打开文件 124 | int my_write(int fd); 125 | 126 | // delete 127 | // 把一个指定目录的fcb的free置为1 128 | void my_rmdir(char *dirname); 129 | // 把一个指定文件的fcb的free置为1 130 | void my_rm(char *filename); 131 | 132 | // creat 133 | // 格式化 134 | void my_format(); 135 | // 在指定目录下创建一个文件或文件夹 136 | int my_touch(char *filename, int attribute, int *rpafd); 137 | // 调用touch创建出一个文件 138 | int my_create(char *filename); 139 | // 调用touch创建出一个文件夹 140 | void my_mkdir(char *dirname); 141 | 142 | // others 143 | // 启动系统，做好相关的初始化 144 | void startsys(); 145 | // 退出系统，做好相应备份工作 146 | void my_exitsys(); 147 | // 将一个打开文件的fat信息储存下来 148 | void my_save(int fd); 149 | // 关闭一个打开文件 150 | void my_close(int fd); 151 | // 利用my_open把当前目录切换到指定目录下 152 | void my_cd(char *dirname); 153 | 154 | unsigned char *myvhard; 155 | useropen openfilelist[MAXOPENFILE]; 156 | int curdirid; // 指向用户打开文件表中的当前目录所在打开文件表项的位置 157 | 158 | unsigned char *blockaddr[BLOCKNUM]; 159 | block0 initblock; 160 | fat fat1[BLOCKNUM], fat2[BLOCKNUM]; 161 | 162 | char str[SIZE]; 163 | 164 | int main() { 165 | int fd; 166 | char command[DIRLEN << 1]; 167 | 168 | startsys(); 169 | printf("%s %s: ", USERNAME, openfilelist[curdirid].dir); 170 | 171 | while (~scanf("%s", command) && strcmp(command, "exit")) { 172 | if (!strcmp(command, "ls")) { 173 | my_ls(); 174 | } 175 | else if (!strcmp(command, "mkdir")) { 176 | scanf("%s", command); 177 | if (rewrite_dir(command)) my_mkdir(command); 178 | } 179 | else if (!strcmp(command, "close")) { 180 | scanf("%d", &fd); 181 | my_close(fd); 182 | } 183 | else if (!strcmp(command, "open")) { 184 | scanf("%s", command); 185 | if (!rewrite_dir(command)) continue; 186 | fd = my_open(command); 187 | if (0 <= fd && fd < MAXOPENFILE) { 188 | if (!openfilelist[fd].open_fcb.attribute) { 189 | my_close(fd); 190 | printf("%s is dirictory, please use cd command\n", command); 191 | } 192 | else { 193 | printf("%s is open, it\'s id is %d\n", openfilelist[fd].dir, fd); 194 | } 195 | } 196 | } 197 | else if (!strcmp(command, "cd")) { 198 | scanf("%s", command); 199 | if (rewrite_dir(command)) my_cd(command); 200 | } 201 | else if (!strcmp(command, "create")) { 202 | scanf("%s", command); 203 | if (!rewrite_dir(command)) continue; 204 | fd = my_create(command); 205 | if (0 <= fd && fd < MAXOPENFILE) { 206 | printf("%s is created, it\'s id is %d\n", openfilelist[fd].dir, fd); 207 | } 208 | } 209 | else if (!strcmp(command, "rm")) { 210 | scanf("%s", command); 211 | if (rewrite_dir(command)) my_rm(command); 212 | } 213 | else if (!strcmp(command, "rmdir")) { 214 | scanf("%s", command); 215 | if (rewrite_dir(command)) my_rmdir(command); 216 | } 217 | else if (!strcmp(command, "read")) { 218 | scanf("%d", &fd); 219 | my_read(fd); 220 | } 221 | else if (!strcmp(command, "write")) { 222 | scanf("%d", &fd); 223 | my_write(fd); 224 | } 225 | else if (!strcmp(command, "sf")) { 226 | for (int i = 0; i < MAXOPENFILE; ++i) { 227 | if (openfilelist[i].topenfile) printf(" %d : %s\n", i, openfilelist[i].dir); 228 | } 229 | } 230 | else if (!strcmp(command, "format")) { 231 | scanf("%s", command); 232 | my_format(); 233 | } 234 | else { 235 | printf("command %s : no such command\n", command); 236 | } 237 | 238 | my_reload(curdirid); 239 | printf("%s %s: ", USERNAME, openfilelist[curdirid].dir); 240 | } 241 | 242 | my_exitsys(); 243 | return 0; 244 | } 245 | 246 | // utils 247 | 248 | void fcb_init(fcb *new_fcb, const char* filename, unsigned short first, unsigned char attribute) { 249 | strcpy(new_fcb->filename, filename); 250 | new_fcb->first = first; 251 | new_fcb->attribute = attribute; 252 | new_fcb->free = 0; 253 | if (attribute) new_fcb->length = 0; 254 | else new_fcb->length = 2 * sizeof(fcb); 255 | } 256 | 257 | void useropen_init(useropen *openfile, int dirno, int diroff, const char* dir) { 258 | openfile->dirno = dirno; 259 | openfile->diroff = diroff; 260 | strcpy(openfile->dir, dir); 261 | openfile->fcbstate = 0; 262 | openfile->topenfile = 1; 263 | openfile->count = openfile->open_fcb.length; 264 | } 265 | 266 | void fatFree(int id) { 267 | if (id == END) return; 268 | if (fat1[id].id != END) fatFree(fat1[id].id); 269 | fat1[id].id = FREE; 270 | } 271 | 272 | int getFreeFatid() { 273 | for (int i = 5; i < BLOCKNUM; ++i) if (fat1[i].id == FREE) return i; 274 | return END; 275 | } 276 | 277 | int getFreeOpenlist() { 278 | for (int i = 0; i < MAXOPENFILE; ++i) if (!openfilelist[i].topenfile) return i; 279 | return -1; 280 | } 281 | 282 | int getNextFat(int id) { 283 | if (fat1[id].id == END) fat1[id].id = getFreeFatid(); 284 | return fat1[id].id; 285 | } 286 | 287 | int check_fd(int fd) { 288 | if (!(0 <= fd && fd < MAXOPENFILE)) { 289 | SAYERROR; 290 | printf("check_fd: %d is invaild index\n", fd); 291 | return 0; 292 | } 293 | return 1; 294 | } 295 | 296 | int spiltDir(char dirs[DIRLEN][DIRLEN], char *filename) { 297 | int bg = 0; int ed = strlen(filename); 298 | if (filename[0] == '/') ++bg; 299 | if (filename[ed - 1] == '/') --ed; 300 | 301 | int ret = 0, tlen = 0; 302 | for (int i = bg; i < ed; ++i) { 303 | if (filename[i] == '/') { 304 | dirs[ret][tlen] = '\0'; 305 | tlen = 0; 306 | ++ret; 307 | } 308 | else { 309 | dirs[ret][tlen++] = filename[i]; 310 | } 311 | } 312 | dirs[ret][tlen] = '\0'; 313 | 314 | return ret+1; 315 | } 316 | 317 | void popLastDir(char *dir) { 318 | int len = strlen(dir) - 1; 319 | while (dir[len - 1] != '/') --len; 320 | dir[len] = '\0'; 321 | } 322 | 323 | void splitLastDir(char *dir, char new_dir[2][DIRLEN]) { 324 | int len = strlen(dir); 325 | int flag = -1; 326 | for (int i = 0; i < len; ++i) if (dir[i] == '/') flag = i; 327 | 328 | if (flag == -1) { 329 | SAYERROR; 330 | printf("splitLastDir: can\'t split %s\n", dir); 331 | return; 332 | } 333 | 334 | int tlen = 0; 335 | for (int i = 0; i < flag; ++i) { 336 | new_dir[0][tlen++] = dir[i]; 337 | } 338 | new_dir[0][tlen] = '\0'; 339 | tlen = 0; 340 | for (int i = flag + 1; i < len; ++i) { 341 | new_dir[1][tlen++] = dir[i]; 342 | } 343 | new_dir[1][tlen] = '\0'; 344 | } 345 | 346 | void getPos(int *id, int *offset, unsigned short first, int length) { 347 | int blockorder = length >> 10; 348 | *offset = length % 1024; 349 | *id = first; 350 | while (blockorder) { 351 | --blockorder; 352 | *id = fat1[*id].id; 353 | } 354 | } 355 | 356 | int rewrite_dir(char *dir) { 357 | int len = strlen(dir); 358 | if (dir[len-1] == '/') --len; 359 | int pre = -1; 360 | for (int i = 0; i < len; ++i) if (dir[len] == '/') { 361 | if (pre != -1) { 362 | if (pre + 1 == i) { 363 | printf("rewrite_dir: %s is invaild, please check!\n", dir); 364 | return 0; 365 | } 366 | } 367 | pre = i; 368 | } 369 | char newdir[len]; 370 | if (dir[0] == '/') { 371 | strcpy(newdir, "~"); 372 | } 373 | else { 374 | strcpy(newdir, openfilelist[curdirid].dir); 375 | } 376 | strcat(newdir, dir); 377 | strcpy(dir, newdir); 378 | return 1; 379 | } 380 | 381 | // basics 382 | int fat_read(unsigned short id, unsigned char *text, int offset, int len) { 383 | int ret = 0; 384 | unsigned char *buf = (unsigned char*)malloc(BLOCKSIZE); 385 | 386 | int count = 0; 387 | while (len) { 388 | memcpy(buf, blockaddr[id], BLOCKSIZE); 389 | count = min(len, 1024 - offset); 390 | memcpy(text + ret, buf + offset, count); 391 | len -= count; 392 | ret += count; 393 | offset = 0; 394 | id = fat1[id].id; 395 | } 396 | 397 | free(buf); 398 | return ret; 399 | } 400 | 401 | int do_read(int fd, unsigned char *text, int len) { 402 | int blockorder = openfilelist[fd].count >> 10; 403 | int blockoffset = openfilelist[fd].count % 1024; 404 | unsigned short id = openfilelist[fd].open_fcb.first; 405 | while (blockorder) { 406 | --blockorder; 407 | id = fat1[id].id; 408 | } 409 | 410 | int ret = fat_read(id, text, blockoffset, len); 411 | 412 | return ret; 413 | } 414 | 415 | int fat_write(unsigned short id, unsigned char *text, int blockoffset, int len) { 416 | int ret = 0; 417 | char *buf = (char*)malloc(1024); 418 | if (buf == NULL) { 419 | SAYERROR; 420 | printf("fat_write: malloc error\n"); 421 | return -1; 422 | } 423 | 424 | // 写之前先把磁盘长度扩充到所需大小 425 | int tlen = len; 426 | int toffset = blockoffset; 427 | unsigned short tid = id; 428 | while (tlen) { 429 | if (tlen <= 1024 - toffset) break; 430 | tlen -= (1024 - toffset); 431 | toffset = 0; 432 | id = getNextFat(id); 433 | if (id == END) { 434 | SAYERROR; 435 | printf("fat_write: no next fat\n"); 436 | return -1; 437 | } 438 | } 439 | 440 | int count = 0; 441 | while (len) { 442 | memcpy(buf, blockaddr[id], BLOCKSIZE); 443 | count = min(len, 1024 - blockoffset); 444 | memcpy(buf + blockoffset, text + ret, count); 445 | memcpy(blockaddr[id], buf, BLOCKSIZE); 446 | len -= count; 447 | ret += count; 448 | blockoffset = 0; 449 | id = fat1[id].id; 450 | } 451 | 452 | free(buf); 453 | return ret; 454 | } 455 | 456 | int do_write(int fd, unsigned char *text, int len) { 457 | fcb *fcbp = &openfilelist[fd].open_fcb; 458 | 459 | int blockorder = openfilelist[fd].count >> 10; 460 | int blockoffset = openfilelist[fd].count % 1024; 461 | unsigned short id = openfilelist[fd].open_fcb.first; 462 | while (blockorder) { 463 | --blockorder; 464 | id = fat1[id].id; 465 | } 466 | 467 | int ret = fat_write(id, text, blockoffset, len); 468 | 469 | fcbp->length += ret; 470 | openfilelist[fd].fcbstate = 1; 471 | // 如果文件夹被写了，那么其'.'也要被写进去 472 | // 其子文件夹的'..'也要被更新 473 | if (!fcbp->attribute) { 474 | fcb tmp; 475 | memcpy(&tmp, fcbp, sizeof(fcb)); 476 | strcpy(tmp.filename, "."); 477 | memcpy(blockaddr[fcbp->first], &tmp, sizeof(fcb)); 478 | 479 | // 如果是根目录的话，".."也要被修改 480 | strcpy(tmp.filename, ".."); 481 | if (fcbp->first == 5) { 482 | memcpy(blockaddr[fcbp->first] + sizeof(fcb), &tmp, sizeof(fcb)); 483 | } 484 | 485 | // 从磁盘中读出当前目录的信息 486 | unsigned char buf[SIZE]; 487 | int read_size = read_ls(fd, buf, fcbp->length); 488 | if (read_size == -1) { 489 | SAYERROR; 490 | printf("do_write: read_ls error\n"); 491 | return 0; 492 | } 493 | fcb dirfcb; 494 | for (int i = 2 * sizeof(fcb); i < read_size; i += sizeof(fcb)) { 495 | memcpy(&dirfcb, buf + i, sizeof(fcb)); 496 | if (dirfcb.free || dirfcb.attribute) continue; 497 | memcpy(blockaddr[dirfcb.first] + sizeof(fcb), &tmp, sizeof(fcb)); 498 | } 499 | } 500 | 501 | return ret; 502 | } 503 | 504 | int getFcb(fcb* fcbp, int *dirno, int *diroff, int fd, const char *dir) { 505 | if (fd == -1) { 506 | memcpy(fcbp, blockaddr[5], sizeof(fcb)); 507 | *dirno = 5; 508 | *diroff = 0; 509 | return 1; 510 | } 511 | 512 | useropen *file = &openfilelist[fd]; 513 | 514 | // 从磁盘中读出当前目录的信息 515 | unsigned char *buf = (unsigned char *)malloc(SIZE); 516 | int read_size = read_ls(fd, buf, file->open_fcb.length); 517 | if (read_size == -1) { 518 | SAYERROR; 519 | printf("getFcb: read_ls error\n"); 520 | return -1; 521 | } 522 | fcb dirfcb; 523 | int flag = -1; 524 | for (int i = 0; i < read_size; i += sizeof(fcb)) { 525 | memcpy(&dirfcb, buf + i, sizeof(fcb)); 526 | if (dirfcb.free) continue; 527 | if (!strcmp(dirfcb.filename, dir)) { 528 | flag = i; 529 | break; 530 | } 531 | } 532 | 533 | free(buf); 534 | 535 | // 没有找到需要的文件 536 | if (flag == -1) return -1; 537 | 538 | // 找到的话就开始计算相关信息，改变对应打开文件项的值 539 | getPos(dirno, diroff, file->open_fcb.first, flag); 540 | memcpy(fcbp, &dirfcb, sizeof(fcb)); 541 | 542 | return 1; 543 | } 544 | 545 | int getOpenlist(int fd, const char *org_dir) { 546 | // 把路径名处理成绝对路径 547 | char dir[DIRLEN]; 548 | if (fd == -1) { 549 | strcpy(dir, "~/"); 550 | } 551 | else { 552 | strcpy(dir, openfilelist[fd].dir); 553 | strcat(dir, org_dir); 554 | } 555 | 556 | // 如果有打开的目录和想打开的目录重名，必须把原目录的内容写回磁盘 557 | for (int i = 0; i < MAXOPENFILE; ++i) if (i != fd) { 558 | if (openfilelist[i].topenfile && !strcmp(openfilelist[i].dir, dir)) { 559 | my_save(i); 560 | } 561 | } 562 | 563 | int fileid = getFreeOpenlist(); 564 | if (fileid == -1) { 565 | SAYERROR; 566 | printf("getOpenlist: openlist is full\n"); 567 | return -1; 568 | } 569 | 570 | fcb dirfcb; 571 | useropen *file = &openfilelist[fileid]; 572 | int ret; 573 | if (fd == -1) { 574 | ret = getFcb(&file->open_fcb, &file->dirno, &file->diroff, -1, "."); 575 | } 576 | else { 577 | ret = getFcb(&file->open_fcb, &file->dirno, &file->diroff, fd, org_dir); 578 | } 579 | strcpy(file->dir, dir); 580 | file->fcbstate = 0; 581 | file->topenfile = 1; 582 | 583 | //如果打开的是一个文件夹，就在路径后面加上'/' 584 | if (!file->open_fcb.attribute) { 585 | int len = strlen(file->dir); 586 | if (file->dir[len-1] != '/') strcat(file->dir, "/"); 587 | } 588 | 589 | if (ret == -1) { 590 | file->topenfile = 0; 591 | return -1; 592 | } 593 | return fileid; 594 | } 595 | 596 | int my_open(char *filename) { 597 | char dirs[DIRLEN][DIRLEN]; 598 | int count = spiltDir(dirs, filename); 599 | 600 | char realdirs[DIRLEN][DIRLEN]; 601 | int tot = 0; 602 | for (int i = 1; i < count; ++i) { 603 | if (!strcmp(dirs[i], ".")) continue; 604 | if (!strcmp(dirs[i], "..")) { 605 | if (tot) --tot; 606 | continue; 607 | } 608 | strcpy(realdirs[tot++], dirs[i]); 609 | } 610 | 611 | // 生成根目录的副本 612 | int fd = getOpenlist(-1, ""); 613 | 614 | // 利用当前目录的副本不断找到下一个目录 615 | int flag = 0; 616 | for (int i = 0; i < tot; ++i) { 617 | int newfd = getOpenlist(fd, realdirs[i]); 618 | if (newfd == -1) { 619 | flag = 1; 620 | break; 621 | } 622 | my_close(fd); 623 | fd = newfd; 624 | } 625 | if (flag) { 626 | printf("my_open: %s no such file or directory\n", filename); 627 | openfilelist[fd].topenfile = 0; 628 | return -1; 629 | } 630 | 631 | if (openfilelist[fd].open_fcb.attribute) openfilelist[fd].count = 0; 632 | else openfilelist[fd].count = openfilelist[fd].open_fcb.length; 633 | return fd; 634 | } 635 | 636 | // read 637 | int read_ls(int fd, unsigned char *text, int len) { 638 | int tcount = openfilelist[fd].count; 639 | openfilelist[fd].count = 0; 640 | int ret = do_read(fd, text, len); 641 | openfilelist[fd].count = tcount; 642 | return ret; 643 | } 644 | 645 | void my_ls() { 646 | // 从磁盘中读出当前目录的信息 647 | unsigned char *buf = (unsigned char*)malloc(SIZE); 648 | int read_size = read_ls(curdirid, buf, openfilelist[curdirid].open_fcb.length); 649 | if (read_size == -1) { 650 | free(buf); 651 | SAYERROR; 652 | printf("my_ls: read_ls error\n"); 653 | return; 654 | } 655 | fcb dirfcb; 656 | for (int i = 0; i < read_size; i += sizeof(fcb)) { 657 | memcpy(&dirfcb, buf + i, sizeof(fcb)); 658 | if (dirfcb.free) continue; 659 | if (dirfcb.attribute) printf(" %s", dirfcb.filename); 660 | else printf(" " GRN "%s" RESET, dirfcb.filename); 661 | } 662 | printf("\n"); 663 | free(buf); 664 | } 665 | 666 | int my_read(int fd) { 667 | if (!(0 <= fd && fd < MAXOPENFILE) || !openfilelist[fd].topenfile || 668 | !openfilelist[fd].open_fcb.attribute) { 669 | printf("my_read: fd invaild\n"); 670 | return -1; 671 | } 672 | 673 | unsigned char *buf = (unsigned char *)malloc(SIZE); 674 | int len = openfilelist[fd].open_fcb.length - openfilelist[fd].count; 675 | int ret = do_read(fd, buf, len); 676 | if (ret == -1) { 677 | free(buf); 678 | printf("my_read: do_read error\n"); 679 | return -1; 680 | } 681 | buf[ret] = '\0'; 682 | printf("%s\n", buf); 683 | return ret; 684 | } 685 | 686 | void my_reload(int fd) { 687 | if (!check_fd(fd)) return; 688 | fat_read(openfilelist[fd].dirno, (unsigned char*)&openfilelist[fd].open_fcb, openfilelist[fd].diroff, sizeof(fcb)); 689 | return; 690 | } 691 | 692 | // write 693 | int my_write(int fd) { 694 | if (!(0 <= fd && fd < MAXOPENFILE) || !openfilelist[fd].topenfile || 695 | !openfilelist[fd].open_fcb.attribute) { 696 | printf("my_write: fd invaild\n"); 697 | return -1; 698 | } 699 | 700 | useropen *file = &openfilelist[fd]; 701 | printf("please tell me which write style do you prefer?\n"); 702 | printf(" a : append write\n"); 703 | printf(" w : truncate write\n"); 704 | printf(" o : overwrite write\n"); 705 | char op[5]; 706 | scanf("%s", op); 707 | if (op[0] == 'a') { 708 | file->count = file->open_fcb.length; 709 | } 710 | else if (op[0] == 'w') { 711 | file->count = 0; 712 | file->open_fcb.length = 0; 713 | fatFree(fat1[file->open_fcb.first].id); 714 | } 715 | else if (op[0] != 'o') { 716 | printf("my_write: invaild write style!\n"); 717 | return -1; 718 | } 719 | 720 | int ret = 0; 721 | int tmp; 722 | while (gets(str)) { 723 | int len = strlen(str); 724 | str[len] = '\n'; 725 | tmp = do_write(fd, (unsigned char*)str, len + 1); 726 | if (tmp == -1) { 727 | SAYERROR; 728 | printf("my_write: do_write error\n"); 729 | return -1; 730 | } 731 | file->count += tmp; 732 | ret += tmp; 733 | } 734 | return ret; 735 | } 736 | 737 | // delete 738 | void my_rmdir(char *dirname) { 739 | int fd = my_open(dirname); 740 | if (0 <= fd && fd < MAXOPENFILE) { 741 | if (openfilelist[fd].open_fcb.attribute) { 742 | printf("my_rmdir: %s is a file, please use rm command\n", dirname); 743 | my_close(fd); 744 | return; 745 | } 746 | if (!strcmp(openfilelist[fd].dir, openfilelist[curdirid].dir)) { 747 | printf("my_rmdir: can not remove the current directory!\n"); 748 | my_close(fd); 749 | return; 750 | } 751 | 752 | // 从磁盘中读出当前目录的信息 753 | int cnt = 0; 754 | unsigned char *buf = (unsigned char*)malloc(SIZE); 755 | int read_size = read_ls(fd, buf,openfilelist[fd].open_fcb.length); 756 | if (read_size == -1) { 757 | my_close(fd); 758 | free(buf); 759 | SAYERROR; 760 | printf("my_rmdir: read_ls error\n"); 761 | return; 762 | } 763 | fcb dirfcb; 764 | int flag = -1; 765 | for (int i = 0; i < read_size; i += sizeof(fcb)) { 766 | memcpy(&dirfcb, buf + i, sizeof(fcb)); 767 | if (dirfcb.free) continue; 768 | ++cnt; 769 | } 770 | 771 | if (cnt > 2) { 772 | my_close(fd); 773 | printf("my_rmdir: %s is not empty\n", dirname); 774 | return; 775 | } 776 | 777 | openfilelist[fd].open_fcb.free = 1; 778 | fatFree(openfilelist[fd].open_fcb.first); 779 | openfilelist[fd].fcbstate = 1; 780 | my_close(fd); 781 | } 782 | } 783 | 784 | void my_rm(char *filename) { 785 | int fd = my_open(filename); 786 | if (0 <= fd && fd < MAXOPENFILE) { 787 | if (openfilelist[fd].open_fcb.attribute == 0) { 788 | printf("my_rm: %s is a directory, please use rmdir command\n", filename); 789 | my_close(fd); 790 | return; 791 | } 792 | 793 | openfilelist[fd].open_fcb.free = 1; 794 | fatFree(openfilelist[fd].open_fcb.first); 795 | openfilelist[fd].fcbstate = 1; 796 | my_close(fd); 797 | } 798 | } 799 | 800 | // creat 801 | void my_format() { 802 | strcpy(initblock.information, "10101010"); 803 | initblock.root = 5; 804 | initblock.startblock = blockaddr[5]; 805 | 806 | for (int i = 0; i < 5; ++i) fat1[i].id = END; 807 | for (int i = 5; i < BLOCKNUM; ++i) fat1[i].id = FREE; 808 | for (int i = 0; i < BLOCKNUM; ++i) fat2[i].id = fat1[i].id; 809 | 810 | fat1[5].id = END; 811 | fcb root; 812 | fcb_init(&root, ".", 5, 0); 813 | memcpy(blockaddr[5], &root, sizeof(fcb)); 814 | 815 | #ifdef DEBUG_INFO 816 | printf("my_format %s\n", root.filename); 817 | #endif // DEBUG_INFO 818 | 819 | strcpy(root.filename, ".."); 820 | memcpy(blockaddr[5] + sizeof(fcb), &root, sizeof(fcb)); 821 | 822 | #ifdef DEBUG_INFO 823 | printf("my_format %s\n", root.filename); 824 | #endif // DEBUG_INFO 825 | 826 | printf("初始化完成\n"); 827 | } 828 | 829 | int my_touch(char *filename, int attribute, int *rpafd) { 830 | // 先打开file的上级目录，如果上级目录不存在就报错（至少自己电脑上的Ubuntu是这个逻辑） 831 | char split_dir[2][DIRLEN]; 832 | splitLastDir(filename, split_dir); 833 | 834 | int pafd = my_open(split_dir[0]); 835 | if (!(0 <= pafd && pafd < MAXOPENFILE)) { 836 | SAYERROR; 837 | printf("my_creat: my_open error\n"); 838 | return -1; 839 | } 840 | 841 | // 从磁盘中读出当前目录的信息，进行检查 842 | unsigned char *buf = (unsigned char*)malloc(SIZE); 843 | int read_size = read_ls(pafd, buf, openfilelist[pafd].open_fcb.length); 844 | if (read_size == -1) { 845 | SAYERROR; 846 | printf("my_touch: read_ls error\n"); 847 | return -1; 848 | } 849 | fcb dirfcb; 850 | for (int i = 0; i < read_size; i += sizeof(fcb)) { 851 | memcpy(&dirfcb, buf + i, sizeof(fcb)); 852 | if (dirfcb.free) continue; 853 | if (!strcmp(dirfcb.filename, split_dir[1])) { 854 | printf("%s is already exit\n", split_dir[1]); 855 | return -1; 856 | } 857 | } 858 | 859 | // 利用空闲磁盘块创建文件 860 | int fatid = getFreeFatid(); 861 | if (fatid == -1) { 862 | SAYERROR; 863 | printf("my_touch: no free fat\n"); 864 | return -1; 865 | } 866 | fat1[fatid].id = END; 867 | fcb_init(&dirfcb, split_dir[1], fatid, attribute); 868 | 869 | // 写入父亲目录内存 870 | memcpy(buf, &dirfcb, sizeof(fcb)); 871 | int write_size = do_write(pafd, buf, sizeof(fcb)); 872 | if (write_size == -1) { 873 | SAYERROR; 874 | printf("my_touch: do_write error\n"); 875 | return -1; 876 | } 877 | openfilelist[pafd].count += write_size; 878 | 879 | // 创建自己的打开文件项 880 | int fd = getFreeOpenlist(); 881 | if (!(0 <= fd && fd < MAXOPENFILE)) { 882 | SAYERROR; 883 | printf("my_touch: no free fat\n"); 884 | return -1; 885 | } 886 | getPos(&openfilelist[fd].dirno, &openfilelist[fd].diroff, openfilelist[pafd].open_fcb.first, openfilelist[pafd].count - write_size); 887 | memcpy(&openfilelist[fd].open_fcb, &dirfcb, sizeof(fcb)); 888 | if (attribute) openfilelist[fd].count = 0; 889 | else openfilelist[fd].count = openfilelist[fd].open_fcb.length; 890 | openfilelist[fd].fcbstate = 1; 891 | openfilelist[fd].topenfile = 1; 892 | strcpy(openfilelist[fd].dir, openfilelist[pafd].dir); 893 | strcat(openfilelist[fd].dir, split_dir[1]); 894 | 895 | free(buf); 896 | *rpafd = pafd; 897 | return fd; 898 | } 899 | 900 | int my_create(char *filename) { 901 | int pafd; 902 | int fd = my_touch(filename, 1, &pafd); 903 | if (!check_fd(fd)) return -1; 904 | my_close(pafd); 905 | return fd; 906 | } 907 | 908 | void my_mkdir(char *dirname) { 909 | int pafd; 910 | int fd = my_touch(dirname, 0, &pafd); 911 | if (!check_fd(fd)) return; 912 | unsigned char *buf = (unsigned char*)malloc(SIZE); 913 | 914 | // 把"."和".."装入自己的磁盘 915 | fcb dirfcb; 916 | memcpy(&dirfcb, &openfilelist[fd].open_fcb, sizeof(fcb)); 917 | int fatid = dirfcb.first; 918 | strcpy(dirfcb.filename, "."); 919 | memcpy(blockaddr[fatid], &dirfcb, sizeof(fcb)); 920 | memcpy(&dirfcb, &openfilelist[pafd].open_fcb, sizeof(fcb)); 921 | strcpy(dirfcb.filename, ".."); 922 | memcpy(blockaddr[fatid] + sizeof(fcb), &dirfcb, sizeof(fcb)); 923 | 924 | my_close(pafd); 925 | my_close(fd); 926 | free(buf); 927 | } 928 | 929 | // others 930 | void startsys() { 931 | // 各种变量初始化 932 | myvhard = (unsigned char*)malloc(SIZE); 933 | for (int i = 0; i < BLOCKNUM; ++i) blockaddr[i] = i * BLOCKSIZE + myvhard; 934 | for (int i = 0; i < MAXOPENFILE; ++i) openfilelist[i].topenfile = 0; 935 | 936 | // 准备读入 myfsys 文件信息 937 | FILE *fp = fopen("myfsys", "rb"); 938 | char need_format = 0; 939 | 940 | // 判断是否需要格式化 941 | if (fp != NULL) { 942 | unsigned char *buf = (unsigned char*)malloc(SIZE); 943 | fread(buf, 1, SIZE, fp); 944 | memcpy(myvhard, buf, SIZE); 945 | memcpy(&initblock, blockaddr[0], sizeof(block0)); 946 | if (strcmp(initblock.information, "10101010") != 0) need_format = 1; 947 | free(buf); 948 | fclose(fp); 949 | } 950 | else { 951 | need_format = 1; 952 | } 953 | 954 | // 不需要格式化的话接着读入fat信息 955 | if (!need_format) { 956 | memcpy(fat1, blockaddr[1], sizeof(fat1)); 957 | memcpy(fat2, blockaddr[3], sizeof(fat2)); 958 | } 959 | else { 960 | printf("myfsys 文件系统不存在，现在开始创建文件系统\n"); 961 | my_format(); 962 | } 963 | 964 | // 把根目录fcb放入打开文件表中，设定当前目录为根目录 965 | curdirid = 0; 966 | memcpy(&openfilelist[curdirid].open_fcb, blockaddr[5], sizeof(fcb)); 967 | #ifdef DEBUG_INFO 968 | printf("starsys: %s\n", openfilelist[curdirid].open_fcb.filename); 969 | #endif // DEBUG_INFO 970 | useropen_init(&openfilelist[curdirid], 5, 0, "~/"); 971 | } 972 | 973 | void my_exitsys() { 974 | // 先关闭所有打开文件项 975 | for (int i = 0; i < MAXOPENFILE; ++i) my_close(i); 976 | 977 | memcpy(blockaddr[0], &initblock, sizeof(initblock)); 978 | memcpy(blockaddr[1], fat1, sizeof(fat1)); 979 | memcpy(blockaddr[3], fat1, sizeof(fat1)); 980 | FILE *fp = fopen("myfsys", "wb"); 981 | 982 | #ifndef DEBUG_DONT_SAVEFILE 983 | fwrite(myvhard, BLOCKSIZE, BLOCKNUM, fp); 984 | #endif // DEBUG_DONT_SAVEFILE 985 | 986 | free(myvhard); 987 | fclose(fp); 988 | } 989 | 990 | void my_save(int fd) { 991 | if (!check_fd(fd)) return; 992 | 993 | useropen *file = &openfilelist[fd]; 994 | if (file->fcbstate) fat_write(file->dirno, (unsigned char *)&file->open_fcb, file->diroff, sizeof(fcb)); 995 | file->fcbstate = 0; 996 | return; 997 | } 998 | 999 | void my_close(int fd) { 1000 | if (!check_fd(fd)) return; 1001 | if (openfilelist[fd].topenfile == 0) return; 1002 | 1003 | // 若内容有改变，把fcb内容写回父亲的磁盘块中 1004 | if (openfilelist[fd].fcbstate) my_save(fd); 1005 | 1006 | openfilelist[fd].topenfile = 0; 1007 | return; 1008 | } 1009 | 1010 | void my_cd(char *dirname) { 1011 | int fd = my_open(dirname); 1012 | if (!check_fd(fd)) return; 1013 | if (openfilelist[fd].open_fcb.attribute) { 1014 | my_close(fd); 1015 | printf("%s is a file, please use open command\n", openfilelist[fd].dir); 1016 | return; 1017 | } 1018 | 1019 | // 得到的fd是文件夹的话，就把原来的目录关了,把现在的目录设为当前目录 1020 | my_close(curdirid); 1021 | curdirid = fd; 1022 | } 1023 | 1024 | -------------------------------------------------------------------------------- /old_version/JCFS.cpp: -------------------------------------------------------------------------------- 1 | // JCFS.cpp : 定义控制台应用程序的入口点。 2 | // 3 | 4 | // TODO： 5 | // 以后可以改进的地方 6 | // 1. 选择在一个父目录下添加fcb时，应该选择其磁盘上第一个空闲的fcb块作为新添加fcb的位置，以增大磁盘的利用率，本代码因为时间匆忙，不在细节上做过多的优化 7 | // 2. fcb的data和time两个成员变量应该是记录一个文件的创建时间的（按理说应该还有文件的最新更新时间也要记录）因为实验要求里的逻辑无法验证这两个变量是否存在，为了缩短编程的时间，没有任何与这两个成员变量相关的操作 8 | // 3. fcb的exname成员变量记录的是文件的后缀名，与2同理，实验要求里的逻辑无法验证这个变量是否存在（因为可以把文件名加上后缀名一起作为文件名），所以代码里目前也没有与这个成员变量相关的操作 9 | // 4. main里面其实就是一个读入命令和参数，然后执行相关命令的过程，所以应该一次直接读入一行，然后判断里面的命令和参数是否合法，但自己的写法没有判断换行，有时会导致错误的发生 10 | // 5. 代码应该尽量抽象，使用更多的c高级语法（虽然这个文件是cpp文件，但是里面按某种理由来说，应该不能出现任何c++语法），以降低后期的维护成本（当然我验收完就不会用这个代码了 :) ） 11 | // 6. 有一个遍历文件夹的内容的代码重复了5次（也许是6次），但是每次需要做的事情都不一样，所以需要利用函数指针来避免代码重复 12 | // 7. 代码里有太多错误提示了，在代码逐渐完善后，不如把错误提示全去了，要是真的崩溃了，就让程序崩溃把 13 | 14 | #include "stdafx.h" 15 | #include "JCFS.h" 16 | 17 | const char USERNAME[] = "jiachen"; 18 | 19 | unsigned char *myvhard; 20 | useropen openfilelist[MAXOPENFILE]; 21 | int curdirid; // 指向用户打开文件表中的当前目录所在打开文件表项的位置 22 | //unsigned char* startp; // 记录虚拟磁盘上数据区开始位置 23 | 24 | unsigned char *blockaddr[BLOCKNUM]; 25 | block0 initblock; 26 | fat fat1[BLOCKNUM], fat2[BLOCKNUM]; 27 | 28 | char str[SIZE]; 29 | 30 | int main() { 31 | int fd; 32 | char command[DIRLEN << 1]; 33 | 34 | startsys(); 35 | printf("%s %s: ", USERNAME, openfilelist[curdirid].dir); 36 | while (~scanf("%s", command)) { 37 | if (!strcmp(command, "exit")) { 38 | break; 39 | } 40 | else if (!strcmp(command, "ls")) { 41 | my_ls(); 42 | } 43 | else if (!strcmp(command, "mkdir")) { 44 | scanf("%s", command); 45 | my_mkdir(command); 46 | } 47 | else if (!strcmp(command, "close")) { 48 | scanf("%d", &fd); 49 | my_close(fd); 50 | } 51 | else if (!strcmp(command, "open")) { 52 | scanf("%s", command); 53 | fd = my_open(command); 54 | if (0 <= fd && fd < MAXOPENFILE) { 55 | if (!openfilelist[fd].open_fcb.attribute) { 56 | my_close(fd); 57 | printf("%s is dirictory, please use cd command\n", command); 58 | } 59 | else { 60 | printf("%s is open, it\'s id is %d\n", openfilelist[fd].dir, fd); 61 | } 62 | } 63 | } 64 | else if (!strcmp(command, "cd")) { 65 | scanf("%s", command); 66 | my_cd(command); 67 | } 68 | else if (!strcmp(command, "create")) { 69 | scanf("%s", command); 70 | fd = my_create(command); 71 | if (0 <= fd && fd < MAXOPENFILE) { 72 | printf("%s is created, it\'s id is %d\n", openfilelist[fd].dir, fd); 73 | } 74 | } 75 | else if (!strcmp(command, "rm")) { 76 | scanf("%s", command); 77 | my_rm(command); 78 | } 79 | else if (!strcmp(command, "rmdir")) { 80 | scanf("%s", command); 81 | my_rmdir(command); 82 | } 83 | else if (!strcmp(command, "read")) { 84 | scanf("%d", &fd); 85 | my_read(fd); 86 | } 87 | else if (!strcmp(command, "write")) { 88 | scanf("%d", &fd); 89 | my_write(fd); 90 | } 91 | else if (!strcmp(command, "sf")) { 92 | for (int i = 0; i < MAXOPENFILE; ++i) { 93 | if (openfilelist[i].topenfile) printf(" %d : %s\n", i, openfilelist[i].dir); 94 | } 95 | } 96 | else if (!strcmp(command, "format")) { 97 | scanf("%s", command); 98 | my_format(); 99 | } 100 | else { 101 | printf("command %s : no such command\n", command); 102 | } 103 | 104 | my_reload(curdirid); 105 | 106 | printf("%s %s: ", USERNAME, openfilelist[curdirid].dir); 107 | } 108 | 109 | my_exitsys(); 110 | return 0; 111 | } 112 | 113 | int strcmp(const char* a, const char *b, int len) { 114 | for (int i = 0; i < len; ++i) if (a[i] != b[i]) { 115 | if (a[i] < b[i]) return -1; 116 | else return 1; 117 | } 118 | return 0; 119 | } 120 | 121 | void fcb_init(fcb *new_fcb, const char* filename, unsigned short first, unsigned char attribute) { 122 | strcpy(new_fcb->filename, filename); 123 | new_fcb->first = first; 124 | new_fcb->attribute = attribute; 125 | new_fcb->free = 0; 126 | if (attribute) new_fcb->length = 0; 127 | else new_fcb->length = 2 * sizeof fcb; 128 | } 129 | 130 | void useropen_init(useropen *openfile, int dirno, int diroff, const char* dir) { 131 | openfile->dirno = dirno; 132 | openfile->diroff = diroff; 133 | strcpy(openfile->dir, dir); 134 | openfile->fcbstate = 0; 135 | openfile->topenfile = 1; 136 | openfile->count = openfile->open_fcb.length; 137 | } 138 | 139 | void fatFree(int id) { 140 | if (id == END) return; 141 | if (fat1[id].id != END) fatFree(fat1[id].id); 142 | fat1[id].id = FREE; 143 | } 144 | 145 | int getFreeFatid() { 146 | for (int i = 5; i < BLOCKNUM; ++i) if (fat1[i].id == FREE) return i; 147 | return END; 148 | } 149 | 150 | int getFreeOpenlist() { 151 | for (int i = 0; i < MAXOPENFILE; ++i) if (!openfilelist[i].topenfile) return i; 152 | return -1; 153 | } 154 | 155 | int getNextFat(int id) { 156 | if (fat1[id].id == END) fat1[id].id = getFreeFatid(); 157 | return fat1[id].id; 158 | } 159 | 160 | int read_ls(int fd, unsigned char *text, int len) { 161 | int tcount = openfilelist[fd].count; 162 | openfilelist[fd].count = 0; 163 | int ret = do_read(fd, text, len); 164 | openfilelist[fd].count = tcount; 165 | return ret; 166 | } 167 | 168 | void startsys() { 169 | // 各种变量初始化 170 | myvhard = (unsigned char*)malloc(SIZE); 171 | for (int i = 0; i < BLOCKNUM; ++i) blockaddr[i] = i * BLOCKSIZE + myvhard; 172 | for (int i = 0; i < MAXOPENFILE; ++i) openfilelist[i].topenfile = 0; 173 | 174 | // 准备读入 myfsys 文件信息 175 | FILE *fp = fopen("myfsys", "rb"); 176 | char need_format = 0; 177 | 178 | // 判断是否需要格式化 179 | if (fp != NULL) { 180 | unsigned char *buf = (unsigned char*)malloc(SIZE); 181 | fread(buf, 1, SIZE, fp); 182 | memcpy(myvhard, buf, SIZE); 183 | memcpy(&initblock, blockaddr[0], sizeof block0); 184 | if (strcmp(initblock.information, "10101010") != 0) need_format = 1; 185 | free(buf); 186 | fclose(fp); 187 | } 188 | else { 189 | need_format = 1; 190 | } 191 | 192 | // 不需要格式化的话接着读入fat信息 193 | if (!need_format) { 194 | memcpy(fat1, blockaddr[1], sizeof fat1); 195 | memcpy(fat2, blockaddr[3], sizeof fat2); 196 | } 197 | else { 198 | printf("myfsys 文件系统不存在，现在开始创建文件系统\n"); 199 | my_format(); 200 | } 201 | 202 | // 把根目录fcb放入打开文件表中，设定当前目录为根目录 203 | curdirid = 0; 204 | memcpy(&openfilelist[curdirid].open_fcb, blockaddr[5], sizeof fcb); 205 | #ifdef DEBUG_INFO 206 | printf("starsys: %s\n", openfilelist[curdirid].open_fcb.filename); 207 | #endif // DEBUG_INFO 208 | useropen_init(&openfilelist[curdirid], 5, 0, "~/"); 209 | } 210 | 211 | int fat_read(unsigned short id, unsigned char *text, int offset, int len) { 212 | int ret = 0; 213 | unsigned char *buf = (unsigned char*)malloc(BLOCKSIZE); 214 | 215 | int count = 0; 216 | while (len) { 217 | memcpy(buf, blockaddr[id], BLOCKSIZE); 218 | count = min(len, 1024 - offset); 219 | memcpy(text + ret, buf + offset, count); 220 | len -= count; 221 | ret += count; 222 | offset = 0; 223 | id = fat1[id].id; 224 | } 225 | 226 | free(buf); 227 | return ret; 228 | } 229 | 230 | int do_read(int fd, unsigned char *text, int len) { 231 | int blockorder = openfilelist[fd].count >> 10; 232 | int blockoffset = openfilelist[fd].count % 1024; 233 | unsigned short id = openfilelist[fd].open_fcb.first; 234 | while (blockorder) { 235 | --blockorder; 236 | id = fat1[id].id; 237 | } 238 | 239 | int ret = fat_read(id, text, blockoffset, len); 240 | 241 | return ret; 242 | } 243 | 244 | int fat_write(unsigned short id, unsigned char *text, int blockoffset, int len) { 245 | int ret = 0; 246 | char *buf = (char*)malloc(1024); 247 | if (buf == NULL) { 248 | SAYERROR; 249 | printf("fat_write: malloc error\n"); 250 | return -1; 251 | } 252 | 253 | // 写之前先把磁盘长度扩充到所需大小 254 | int tlen = len; 255 | int toffset = blockoffset; 256 | unsigned short tid = id; 257 | while (tlen) { 258 | if (tlen <= 1024 - toffset) break; 259 | tlen -= (1024 - toffset); 260 | toffset = 0; 261 | id = getNextFat(id); 262 | if (id == END) { 263 | SAYERROR; 264 | printf("fat_write: no next fat\n"); 265 | return -1; 266 | } 267 | } 268 | 269 | int count = 0; 270 | while (len) { 271 | memcpy(buf, blockaddr[id], BLOCKSIZE); 272 | count = min(len, 1024 - blockoffset); 273 | memcpy(buf + blockoffset, text + ret, count); 274 | memcpy(blockaddr[id], buf, BLOCKSIZE); 275 | len -= count; 276 | ret += count; 277 | blockoffset = 0; 278 | id = fat1[id].id; 279 | } 280 | 281 | free(buf); 282 | return ret; 283 | } 284 | 285 | int do_write(int fd, unsigned char *text, int len) { 286 | //// 覆盖写的话把fcb指向的磁盘长度置0 287 | fcb *fcbp = &openfilelist[fd].open_fcb; 288 | //if (wstyle == 'w') { 289 | // fcbp->length = 0; 290 | // fatFree(fat1[fcbp->first].id); 291 | // openfilelist[fd].count = 0; 292 | //} 293 | 294 | int blockorder = openfilelist[fd].count >> 10; 295 | int blockoffset = openfilelist[fd].count % 1024; 296 | unsigned short id = openfilelist[fd].open_fcb.first; 297 | while (blockorder) { 298 | --blockorder; 299 | id = fat1[id].id; 300 | } 301 | 302 | int ret = fat_write(id, text, blockoffset, len); 303 | 304 | fcbp->length += ret; 305 | openfilelist[fd].fcbstate = 1; 306 | // 如果文件夹被写了，那么其'.'也要被写进去 307 | // 其子文件夹的'..'也要被更新 308 | if (!fcbp->attribute) { 309 | fcb tmp; 310 | memcpy(&tmp, fcbp, sizeof fcb); 311 | strcpy(tmp.filename, "."); 312 | memcpy(blockaddr[fcbp->first], &tmp, sizeof fcb); 313 | 314 | // 如果是根目录的话，".."也要被修改 315 | strcpy(tmp.filename, ".."); 316 | if (fcbp->first == 5) { 317 | memcpy(blockaddr[fcbp->first] + sizeof fcb, &tmp, sizeof fcb); 318 | } 319 | 320 | // 从磁盘中读出当前目录的信息 321 | unsigned char buf[SIZE]; 322 | int read_size = read_ls(fd, buf, fcbp->length); 323 | if (read_size == -1) { 324 | SAYERROR; 325 | printf("do_write: read_ls error\n"); 326 | return 0; 327 | } 328 | fcb dirfcb; 329 | for (int i = 2 * sizeof fcb; i < read_size; i += sizeof fcb) { 330 | memcpy(&dirfcb, buf + i, sizeof fcb); 331 | if (dirfcb.free || dirfcb.attribute) continue; 332 | memcpy(blockaddr[dirfcb.first] + sizeof fcb, &tmp, sizeof fcb); 333 | } 334 | } 335 | 336 | return ret; 337 | } 338 | 339 | void my_reload(int fd) { 340 | if (!(0 <= fd && fd < MAXOPENFILE)) { 341 | SAYERROR; 342 | printf("my_reload: fd invaild\n"); 343 | return; 344 | } 345 | 346 | fat_read(openfilelist[fd].dirno, (unsigned char*)&openfilelist[fd].open_fcb, openfilelist[fd].diroff, sizeof fcb); 347 | 348 | return; 349 | } 350 | 351 | void my_exitsys() { 352 | // 先关闭所有打开文件项 353 | for (int i = 0; i < MAXOPENFILE; ++i) my_close(i); 354 | 355 | memcpy(blockaddr[0], &initblock, sizeof initblock); 356 | memcpy(blockaddr[1], fat1, sizeof fat1); 357 | memcpy(blockaddr[3], fat1, sizeof fat1); 358 | FILE *fp = fopen("myfsys", "wb"); 359 | 360 | #ifndef DEBUG_DONT_SAVEFILE 361 | fwrite(myvhard, BLOCKSIZE, BLOCKNUM, fp); 362 | #endif // DEBUG_DONT_SAVEFILE 363 | 364 | free(myvhard); 365 | fclose(fp); 366 | } 367 | 368 | void my_format() { 369 | strcpy(initblock.information, "10101010"); 370 | initblock.root = 5; 371 | initblock.startblock = blockaddr[5]; 372 | 373 | for (int i = 0; i < 5; ++i) fat1[i].id = END; 374 | for (int i = 5; i < BLOCKNUM; ++i) fat1[i].id = FREE; 375 | for (int i = 0; i < BLOCKNUM; ++i) fat2[i].id = fat1[i].id; 376 | 377 | fat1[5].id = END; 378 | fcb root; 379 | fcb_init(&root, ".", 5, 0); 380 | memcpy(blockaddr[5], &root, sizeof fcb); 381 | 382 | #ifdef DEBUG_INFO 383 | printf("my_format %s\n", root.filename); 384 | #endif // DEBUG_INFO 385 | 386 | strcpy(root.filename, ".."); 387 | memcpy(blockaddr[5] + sizeof fcb, &root, sizeof fcb); 388 | 389 | #ifdef DEBUG_INFO 390 | printf("my_format %s\n", root.filename); 391 | #endif // DEBUG_INFO 392 | 393 | printf("初始化完成\n"); 394 | } 395 | 396 | void my_save(int fd) { 397 | if (!(0 <= fd && fd < MAXOPENFILE)) { 398 | SAYERROR; 399 | printf("my_save: fd invaild\n"); 400 | return; 401 | } 402 | 403 | useropen *file = &openfilelist[fd]; 404 | if (file->fcbstate) fat_write(file->dirno, (unsigned char *)&file->open_fcb, file->diroff, sizeof fcb); 405 | file->fcbstate = 0; 406 | 407 | return; 408 | } 409 | 410 | void my_close(int fd) { 411 | if (!(0 <= fd && fd < MAXOPENFILE)) { 412 | SAYERROR; 413 | printf("my_close: fd invaild\n"); 414 | return; 415 | } 416 | if (openfilelist[fd].topenfile == 0) return; 417 | 418 | // 若内容有改变，把fcb内容写回父亲的磁盘块中 419 | if (openfilelist[fd].fcbstate) my_save(fd); 420 | 421 | openfilelist[fd].topenfile = 0; 422 | return; 423 | } 424 | 425 | int spiltDir(char dirs[DIRLEN][DIRLEN], char *filename) { 426 | int bg = 0; int ed = strlen(filename); 427 | if (filename[0] == '/') ++bg; 428 | if (filename[ed - 1] == '/') --ed; 429 | 430 | int ret = 0, tlen = 0; 431 | for (int i = bg; i < ed; ++i) { 432 | if (filename[i] == '/') { 433 | dirs[ret][tlen] = '\0'; 434 | tlen = 0; 435 | ++ret; 436 | } 437 | else { 438 | dirs[ret][tlen++] = filename[i]; 439 | } 440 | } 441 | dirs[ret][tlen] = '\0'; 442 | 443 | return ret+1; 444 | } 445 | 446 | void popLastDir(char *dir) { 447 | int len = strlen(dir) - 1; 448 | while (dir[len - 1] != '/') --len; 449 | dir[len] = '\0'; 450 | } 451 | 452 | void splitLastDir(char *dir, char new_dir[2][DIRLEN]) { 453 | int len = strlen(dir); 454 | int flag = -1; 455 | for (int i = 0; i < len; ++i) if (dir[i] == '/') flag = i; 456 | 457 | if (flag == -1) { 458 | SAYERROR; 459 | printf("splitLastDir: can\'t split %s\n", dir); 460 | return; 461 | } 462 | 463 | int tlen = 0; 464 | for (int i = 0; i < flag; ++i) { 465 | new_dir[0][tlen++] = dir[i]; 466 | } 467 | new_dir[0][tlen] = '\0'; 468 | tlen = 0; 469 | for (int i = flag + 1; i < len; ++i) { 470 | new_dir[1][tlen++] = dir[i]; 471 | } 472 | new_dir[1][tlen] = '\0'; 473 | } 474 | 475 | void getPos(int *id, int *offset, unsigned short first, int length) { 476 | int blockorder = length >> 10; 477 | *offset = length % 1024; 478 | *id = first; 479 | while (blockorder) { 480 | --blockorder; 481 | *id = fat1[*id].id; 482 | } 483 | } 484 | 485 | int getFcb(fcb* fcbp, int *dirno, int *diroff, int fd, const char *dir) { 486 | if (fd == -1) { 487 | memcpy(fcbp, blockaddr[5], sizeof fcb); 488 | *dirno = 5; 489 | *diroff = 0; 490 | return 1; 491 | } 492 | 493 | useropen *file = &openfilelist[fd]; 494 | 495 | // 从磁盘中读出当前目录的信息 496 | unsigned char *buf = (unsigned char *)malloc(SIZE); 497 | int read_size = read_ls(fd, buf, file->open_fcb.length); 498 | if (read_size == -1) { 499 | SAYERROR; 500 | printf("getFcb: read_ls error\n"); 501 | return -1; 502 | } 503 | fcb dirfcb; 504 | int flag = -1; 505 | for (int i = 0; i < read_size; i += sizeof fcb) { 506 | memcpy(&dirfcb, buf + i, sizeof fcb); 507 | if (dirfcb.free) continue; 508 | if (!strcmp(dirfcb.filename, dir)) { 509 | flag = i; 510 | break; 511 | } 512 | } 513 | 514 | free(buf); 515 | 516 | // 没有找到需要的文件 517 | if (flag == -1) return -1; 518 | 519 | // 找到的话就开始计算相关信息，改变对应打开文件项的值 520 | getPos(dirno, diroff, file->open_fcb.first, flag); 521 | memcpy(fcbp, &dirfcb, sizeof fcb); 522 | 523 | return 1; 524 | } 525 | 526 | int getOpenlist(int fd, const char *org_dir) { 527 | // 把路径名处理成绝对路径 528 | char dir[DIRLEN]; 529 | if (fd == -1) { 530 | strcpy(dir, "~/"); 531 | } 532 | else { 533 | strcpy(dir, openfilelist[fd].dir); 534 | strcat(dir, org_dir); 535 | } 536 | 537 | // 如果有打开的目录和想打开的目录重名，必须把原目录的内容写回磁盘 538 | for (int i = 0; i < MAXOPENFILE; ++i) if (i != fd) { 539 | if (openfilelist[i].topenfile && !strcmp(openfilelist[i].dir, dir)) { 540 | my_save(i); 541 | } 542 | } 543 | 544 | int fileid = getFreeOpenlist(); 545 | if (fileid == -1) { 546 | SAYERROR; 547 | printf("getOpenlist: openlist is full\n"); 548 | return -1; 549 | } 550 | 551 | fcb dirfcb; 552 | useropen *file = &openfilelist[fileid]; 553 | int ret; 554 | if (fd == -1) { 555 | ret = getFcb(&file->open_fcb, &file->dirno, &file->diroff, -1, "."); 556 | } 557 | else { 558 | ret = getFcb(&file->open_fcb, &file->dirno, &file->diroff, fd, org_dir); 559 | } 560 | strcpy(file->dir, dir); 561 | file->fcbstate = 0; 562 | file->topenfile = 1; 563 | 564 | //如果打开的是一个文件夹，就在路径后面加上'/' 565 | if (!file->open_fcb.attribute) { 566 | int len = strlen(file->dir); 567 | if (file->dir[len-1] != '/') strcat(file->dir, "/"); 568 | } 569 | 570 | if (ret == -1) { 571 | file->topenfile = 0; 572 | return -1; 573 | } 574 | return fileid; 575 | } 576 | 577 | int my_open(char *filename) { 578 | char dirs[DIRLEN][DIRLEN]; 579 | char newdir[DIRLEN]; 580 | strcpy(newdir, openfilelist[curdirid].dir); 581 | strcat(newdir, filename); 582 | int count = spiltDir(dirs, newdir); 583 | 584 | char realdirs[DIRLEN][DIRLEN]; 585 | int tot = 0; 586 | for (int i = 1; i < count; ++i) { 587 | if (!strcmp(dirs[i], ".")) continue; 588 | if (!strcmp(dirs[i], "..")) { 589 | if (tot) --tot; 590 | continue; 591 | } 592 | strcpy(realdirs[tot++], dirs[i]); 593 | } 594 | 595 | // 生成根目录的副本 596 | int fd = getOpenlist(-1, ""); 597 | 598 | // 利用当前目录的副本不断找到下一个目录 599 | int flag = 0; 600 | for (int i = 0; i < tot; ++i) { 601 | int newfd = getOpenlist(fd, realdirs[i]); 602 | if (newfd == -1) { 603 | flag = 1; 604 | break; 605 | } 606 | my_close(fd); 607 | fd = newfd; 608 | } 609 | if (flag) { 610 | printf("my_open: %s no such file or directory\n", filename); 611 | openfilelist[fd].topenfile = 0; 612 | return -1; 613 | } 614 | 615 | if (openfilelist[fd].open_fcb.attribute) openfilelist[fd].count = 0; 616 | else openfilelist[fd].count = openfilelist[fd].open_fcb.length; 617 | return fd; 618 | } 619 | 620 | void my_cd(char *dirname) { 621 | int fd = my_open(dirname); 622 | if (!(0 <= fd && fd < MAXOPENFILE)) return; 623 | if (openfilelist[fd].open_fcb.attribute) { 624 | my_close(fd); 625 | printf("%s is a file, please use open command\n", openfilelist[fd].dir); 626 | return; 627 | } 628 | 629 | // 得到的fd是文件夹的话，就把原来的目录关了,把现在的目录设为当前目录 630 | my_close(curdirid); 631 | curdirid = fd; 632 | } 633 | 634 | void my_ls() { 635 | // 从磁盘中读出当前目录的信息 636 | unsigned char *buf = (unsigned char*)malloc(SIZE); 637 | int read_size = read_ls(curdirid, buf, openfilelist[curdirid].open_fcb.length); 638 | if (read_size == -1) { 639 | free(buf); 640 | SAYERROR; 641 | printf("my_ls: read_ls error\n"); 642 | return; 643 | } 644 | fcb dirfcb; 645 | for (int i = 0; i < read_size; i += sizeof fcb) { 646 | memcpy(&dirfcb, buf + i, sizeof fcb); 647 | if (dirfcb.free) continue; 648 | if (dirfcb.attribute) printf(" %s", dirfcb.filename); 649 | else printf(" " GRN "%s", dirfcb.filename); 650 | } 651 | printf("\n"); 652 | free(buf); 653 | } 654 | 655 | int my_touch(char *filename, int attribute, int *rpafd) { 656 | // 先打开file的上级目录，如果上级目录不存在就报错（至少自己电脑上的Ubuntu是这个逻辑） 657 | // 为了保证filename字符串里有'/'，在其前面加上'.' 658 | // 如果filename后面有'/'，去掉 659 | int len = strlen(filename); 660 | if (filename[len - 1] == '/') filename[len - 1] = '\0'; 661 | char newdir[DIRLEN] = "./"; 662 | char split_dir[2][DIRLEN]; 663 | strcat(newdir, filename); 664 | splitLastDir(newdir, split_dir); 665 | 666 | int pafd = my_open(split_dir[0]); 667 | if (!(0 <= pafd && pafd < MAXOPENFILE)) { 668 | SAYERROR; 669 | printf("my_creat: my_open error\n"); 670 | return -1; 671 | } 672 | 673 | // 从磁盘中读出当前目录的信息，进行检查 674 | unsigned char *buf = (unsigned char*)malloc(SIZE); 675 | int read_size = read_ls(pafd, buf, openfilelist[pafd].open_fcb.length); 676 | if (read_size == -1) { 677 | SAYERROR; 678 | printf("my_touch: read_ls error\n"); 679 | return -1; 680 | } 681 | fcb dirfcb; 682 | for (int i = 0; i < read_size; i += sizeof fcb) { 683 | memcpy(&dirfcb, buf + i, sizeof fcb); 684 | if (dirfcb.free || dirfcb.attribute) continue; 685 | if (!strcmp(dirfcb.filename, split_dir[1])) { 686 | printf("%s is already exit\n", split_dir[1]); 687 | return -1; 688 | } 689 | } 690 | 691 | // 利用空闲磁盘块创建文件 692 | int fatid = getFreeFatid(); 693 | if (fatid == -1) { 694 | SAYERROR; 695 | printf("my_touch: no free fat\n"); 696 | return -1; 697 | } 698 | fat1[fatid].id = END; 699 | fcb_init(&dirfcb, split_dir[1], fatid, attribute); 700 | 701 | // 写入父亲目录内存 702 | memcpy(buf, &dirfcb, sizeof fcb); 703 | int write_size = do_write(pafd, buf, sizeof fcb); 704 | if (write_size == -1) { 705 | SAYERROR; 706 | printf("my_touch: do_write error\n"); 707 | return -1; 708 | } 709 | openfilelist[pafd].count += write_size; 710 | 711 | // 创建自己的打开文件项 712 | int fd = getFreeOpenlist(); 713 | if (!(0 <= fd && fd < MAXOPENFILE)) { 714 | SAYERROR; 715 | printf("my_touch: no free fat\n"); 716 | return -1; 717 | } 718 | getPos(&openfilelist[fd].dirno, &openfilelist[fd].diroff, openfilelist[pafd].open_fcb.first, openfilelist[pafd].count - write_size); 719 | memcpy(&openfilelist[fd].open_fcb, &dirfcb, sizeof fcb); 720 | if (attribute) openfilelist[fd].count = 0; 721 | else openfilelist[fd].count = openfilelist[fd].open_fcb.length; 722 | openfilelist[fd].fcbstate = 1; 723 | openfilelist[fd].topenfile = 1; 724 | strcpy(openfilelist[fd].dir, openfilelist[pafd].dir); 725 | strcat(openfilelist[fd].dir, split_dir[1]); 726 | 727 | free(buf); 728 | *rpafd = pafd; 729 | return fd; 730 | } 731 | 732 | int my_create(char *filename) { 733 | int pafd; 734 | int fd = my_touch(filename, 1, &pafd); 735 | if (!(0 <= fd && fd < MAXOPENFILE)) { 736 | SAYERROR; 737 | printf("my_creat: my_touch error\n"); 738 | return -1; 739 | } 740 | 741 | my_close(pafd); 742 | return fd; 743 | } 744 | 745 | void my_rm(char *filename) { 746 | int fd = my_open(filename); 747 | if (0 <= fd && fd < MAXOPENFILE) { 748 | if (openfilelist[fd].open_fcb.attribute == 0) { 749 | printf("my_rm: %s is a directory, please use rmdir command\n", filename); 750 | my_close(fd); 751 | return; 752 | } 753 | 754 | openfilelist[fd].open_fcb.free = 1; 755 | fatFree(openfilelist[fd].open_fcb.first); 756 | openfilelist[fd].fcbstate = 1; 757 | my_close(fd); 758 | } 759 | } 760 | 761 | void my_rmdir(char *dirname) { 762 | int fd = my_open(dirname); 763 | if (0 <= fd && fd < MAXOPENFILE) { 764 | if (openfilelist[fd].open_fcb.attribute) { 765 | printf("my_rmdir: %s is a file, please use rm command\n", dirname); 766 | my_close(fd); 767 | return; 768 | } 769 | if (!strcmp(openfilelist[fd].dir, openfilelist[curdirid].dir)) { 770 | printf("my_rmdir: can not remove the current directory!\n"); 771 | my_close(fd); 772 | return; 773 | } 774 | 775 | // 从磁盘中读出当前目录的信息 776 | int cnt = 0; 777 | unsigned char *buf = (unsigned char*)malloc(SIZE); 778 | int read_size = read_ls(fd, buf,openfilelist[fd].open_fcb.length); 779 | if (read_size == -1) { 780 | my_close(fd); 781 | free(buf); 782 | SAYERROR; 783 | printf("my_rmdir: read_ls error\n"); 784 | return; 785 | } 786 | fcb dirfcb; 787 | int flag = -1; 788 | for (int i = 0; i < read_size; i += sizeof fcb) { 789 | memcpy(&dirfcb, buf + i, sizeof fcb); 790 | if (dirfcb.free) continue; 791 | ++cnt; 792 | } 793 | 794 | if (cnt > 2) { 795 | my_close(fd); 796 | printf("my_rmdir: %s is not empty\n", dirname); 797 | return; 798 | } 799 | 800 | openfilelist[fd].open_fcb.free = 1; 801 | fatFree(openfilelist[fd].open_fcb.first); 802 | openfilelist[fd].fcbstate = 1; 803 | my_close(fd); 804 | } 805 | } 806 | 807 | void my_mkdir(char *dirname) { 808 | int pafd; 809 | int fd = my_touch(dirname, 0, &pafd); 810 | if (!(0 <= fd && fd < MAXOPENFILE)) { 811 | SAYERROR; 812 | printf("my_mkdir: my_touch error\n"); 813 | return; 814 | } 815 | unsigned char *buf = (unsigned char*)malloc(SIZE); 816 | 817 | // 把"."和".."装入自己的磁盘 818 | fcb dirfcb; 819 | memcpy(&dirfcb, &openfilelist[fd].open_fcb, sizeof fcb); 820 | int fatid = dirfcb.first; 821 | strcpy(dirfcb.filename, "."); 822 | memcpy(blockaddr[fatid], &dirfcb, sizeof fcb); 823 | memcpy(&dirfcb, &openfilelist[pafd].open_fcb, sizeof fcb); 824 | strcpy(dirfcb.filename, ".."); 825 | memcpy(blockaddr[fatid] + sizeof fcb, &dirfcb, sizeof fcb); 826 | 827 | my_close(pafd); 828 | my_close(fd); 829 | free(buf); 830 | } 831 | 832 | int my_read(int fd) { 833 | if (!(0 <= fd && fd < MAXOPENFILE) || !openfilelist[fd].topenfile || 834 | !openfilelist[fd].open_fcb.attribute) { 835 | printf("my_read: fd invaild\n"); 836 | return -1; 837 | } 838 | 839 | unsigned char *buf = (unsigned char *)malloc(SIZE); 840 | int len = openfilelist[fd].open_fcb.length - openfilelist[fd].count; 841 | int ret = do_read(fd, buf, len); 842 | if (ret == -1) { 843 | free(buf); 844 | printf("my_read: do_read error\n"); 845 | return -1; 846 | } 847 | buf[ret] = '\0'; 848 | printf("%s\n", buf); 849 | return ret; 850 | } 851 | 852 | int my_write(int fd) { 853 | if (!(0 <= fd && fd < MAXOPENFILE) || !openfilelist[fd].topenfile || 854 | !openfilelist[fd].open_fcb.attribute) { 855 | printf("my_write: fd invaild\n"); 856 | return -1; 857 | } 858 | 859 | useropen *file = &openfilelist[fd]; 860 | printf("please tell me which write style do you prefer?\n"); 861 | printf(" a : append write\n"); 862 | printf(" w : truncate write\n"); 863 | printf(" o : overwrite write\n"); 864 | char op[5]; 865 | scanf("%s", op); 866 | if (op[0] == 'a') { 867 | file->count = file->open_fcb.length; 868 | } 869 | else if (op[0] == 'w') { 870 | file->count = 0; 871 | file->open_fcb.length = 0; 872 | fatFree(fat1[file->open_fcb.first].id); 873 | } 874 | else if (op[0] != 'o') { 875 | printf("my_write: invaild write style!\n"); 876 | return -1; 877 | } 878 | 879 | int ret = 0; 880 | int tmp; 881 | while (gets_s(str)) { 882 | int len = strlen(str); 883 | str[len] = '\n'; 884 | tmp = do_write(fd, (unsigned char*)str, len + 1); 885 | if (tmp == -1) { 886 | SAYERROR; 887 | printf("my_write: do_write error\n"); 888 | return -1; 889 | } 890 | file->count += tmp; 891 | ret += tmp; 892 | } 893 | return ret; 894 | } -------------------------------------------------------------------------------- /old_version/JCFS.h: -------------------------------------------------------------------------------- 1 | //#define DEBUG_INFO 2 | //#define DEBUG_DONT_SAVEFILE 3 | 4 | #define FREE 0 5 | #define DIRLEN 80 6 | #define END 65535 7 | #define SIZE 1024000 8 | #define BLOCKNUM 1000 9 | #define BLOCKSIZE 1024 10 | #define MAXOPENFILE 10 11 | #define ROOTBLOCKNUM 2 12 | 13 | #define SAYERROR printf("ERROR: ") 14 | #define max(X, Y) (((X) > (Y)) ? (X) : (Y)) 15 | #define min(X, Y) (((X) < (Y)) ? (X) : (Y)) 16 | 17 | // #define GRN "\x1B[32m" 18 | #define GRN "dir:" 19 | #define RESET "\x1B[0m" 20 | 21 | typedef struct FCB { 22 | char free; // 此fcb是否已被删除，因为把一个fcb从磁盘块上删除是很费事的，所以选择利用fcb的free标号来标记其是否被删除 23 | char exname[3]; 24 | char filename[DIRLEN]; 25 | unsigned short time; 26 | unsigned short data; 27 | unsigned short first; // 文件起始盘块号 28 | unsigned long length; // 文件的实际长度 29 | unsigned char attribute; // 文件属性字段：为简单起见，我们只为文件设置了两种属性：值为 0 时表示目录文件，值为 1 时表示数据文件 30 | } fcb; 31 | 32 | typedef struct FAT { 33 | unsigned short id; 34 | } fat; 35 | 36 | // 对于文件夹fcb，其count永远等于其fcb的length， 37 | // 只有文件fcb的count会根据打开方式的不同和读写方式的不同而不同 38 | typedef struct USEROPEN { 39 | fcb open_fcb; // 文件的 FCB 中的内容 40 | int count; // 读写指针在文件中的位置 41 | int dirno; // 相应打开文件的目录项在父目录文件中的盘块号 42 | int diroff; // 相应打开文件的目录项在父目录文件的dirno盘块中的起始位置 43 | char fcbstate; // 是否修改了文件的 FCB 的内容，如果修改了置为 1，否则为 0 44 | char topenfile; // 表示该用户打开表项是否为空，若值为 0，表示为空，否则表示已被某打开文件占据 45 | char dir[DIRLEN]; // 打开文件的绝对路径名，这样方便快速检查出指定文件是否已经打开 46 | } useropen; 47 | 48 | typedef struct BLOCK0 { 49 | unsigned short root; 50 | char information[200]; 51 | unsigned char *startblock; 52 | } block0; 53 | 54 | int my_write(int fd); 55 | int my_open(char *filename); 56 | int my_create(char *filename); 57 | int my_read(int fd); 58 | int do_read(int fd, unsigned char *text, int len); 59 | // 直接针对fat内存块进行写入，属于do_read的子函数 60 | int fat_write(unsigned short id, unsigned char * text, int blockoffset, int len); 61 | // 对fd指向的打开文件的文件指针处填上text中len长度的字节，只会改变打开文件的fcb信息，而不会改变打开文件的文件指针信息 62 | int do_write(int fd, unsigned char *text, int len); 63 | void my_reload(int fd); 64 | // 创建一个文件，然后再由my_mkdir和my_creat继续处理 65 | int my_touch(char * filename, int attribute, int *rpafd); 66 | 67 | void my_ls(); 68 | void startsys(); 69 | void my_format(); 70 | void my_exitsys(); 71 | void my_save(int fd); 72 | void my_close(int fd); 73 | void my_cd(char *dirname); 74 | void my_rm(char *filename); 75 | void my_mkdir(char *dirname); 76 | void my_rmdir(char *dirname); 77 | 78 | // 初始化打开文件项，需要先把fcb拷贝进openfile的fcb中，其文件指针默认为其所占磁盘大小 79 | void useropen_init(useropen * openfile, int dirno, int diroff, const char * dir); 80 | -------------------------------------------------------------------------------- /old_version/README.md: -------------------------------------------------------------------------------- 1 | # 杭州电子科技大学操作系统课程设计：简单文件系统的实现 2 | 3 | 欢迎自行取用，代码可以运行，但是函数的布局并不适合阅读和后期维护，几天后我会根据函数之间的依赖重新组织一下代码，并写成相关的文档，方便他人理解代码以及更好地完成课程设计。 4 | 5 | 推荐自己独立完成代码，并推荐使用Visual Studio作为IDE（CLion应该也适合写这种较大型的代码）。 6 | 7 | 2017版本的文件系统实验说明并没有很系统地说明需要学生完成的任务，特别是有些细节没有说清会让人产生误解，如果自己接下来还有剩余时间的话，会写一些相关的说明，并建议老师修改一下实验说明。 8 | 9 | **如果有疑问（特别是发现了代码的bug！），欢迎给我发邮件（yjc567@foxmail.com），或者直接在此repo中添加issue。** 10 | 11 | 这些文件是Visual Studio 2017工程的一部分，需要包含的头文件在stdafx.h中，宏定义和各种定义部分在JCFS.h中，具体的实现在JCFS.cpp中，虽然这里都是cpp代码（因为我的Visual Studio只安装了c++的相关工程配置，而我又不是想把太多时间浪费在IDE上），但是代码中应该只使用了c的语法。 12 | 13 | ## TODO： 14 | 15 | 以后可以改进的地方 16 | 17 | 1. 选择在一个父目录下添加fcb时，应该选择其磁盘上第一个空闲的fcb块作为新添加fcb的位置，以增大磁盘的利用率，本代码因为时间匆忙，不在细节上做过多的优化（sjt说可以删除fcb的时候，把空闲出的位置用最后一个fcb块填充，同时把父目录fcb的length减去sizeof fcb，这样可以充分利用fat的空间，不知道实际的fat系统是否是这样做的） 18 | 2. fcb的data和time两个成员变量应该是记录一个文件的创建时间的（按理说应该还有文件的最新更新时间也要记录）因为实验要求里的逻辑无法验证这两个变量是否存在，为了缩短编程的时间，没有任何与这两个成员变量相关的操作 19 | 3. fcb的exname成员变量记录的是文件的后缀名，与2同理，实验要求里的逻辑无法验证这个变量是否存在（因为可以把文件名加上后缀名一起作为文件名），所以代码里目前也没有与这个成员变量相关的操作 20 | 4. main里面其实就是一个读入命令和参数，然后执行相关命令的过程，所以应该一次直接读入一行，然后判断里面的命令和参数是否合法，但自己的写法没有判断换行，有时会导致错误的发生 21 | 5. 代码应该尽量抽象，使用更多的c高级语法（虽然这个文件是cpp文件，但是里面按某种理由来说，应该不能出现任何c++语法），以降低后期的维护成本（当然我验收完就不会用这个代码了 :) ） 22 | 6. 有一个遍历文件夹的内容的代码重复了5次（也许是6次），但是每次需要做的事情都不一样，所以需要利用函数指针来避免代码重复 23 | 7. 代码里有太多错误提示了，在代码逐渐完善后，不如把错误提示全去了，要是真的崩溃了，就让程序崩溃把（py还好，感觉c这样写真的药丸） 24 | 25 | ## 代码运行结果 26 | 27 | 见下图，感觉自己的测试数据已经够乱来和暴力了 = = 28 | 29 | ![run_result_1.png](readme_pic/run_result_1.png) 30 | -------------------------------------------------------------------------------- /old_version/readme_pic/linux_result.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/yujiachen-y/HDU_OS_Assignment_2017_SimpleFileSystem/648b47fedb13080daa52dc66c5728b0eda3faf44/old_version/readme_pic/linux_result.png -------------------------------------------------------------------------------- /old_version/readme_pic/run_result_1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/yujiachen-y/HDU_OS_Assignment_2017_SimpleFileSystem/648b47fedb13080daa52dc66c5728b0eda3faf44/old_version/readme_pic/run_result_1.png -------------------------------------------------------------------------------- /old_version/readme_pic/windows_result.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/yujiachen-y/HDU_OS_Assignment_2017_SimpleFileSystem/648b47fedb13080daa52dc66c5728b0eda3faf44/old_version/readme_pic/windows_result.png -------------------------------------------------------------------------------- /old_version/stdafx.h: -------------------------------------------------------------------------------- 1 | // stdafx.h : 标准系统包含文件的包含文件， 2 | // 或是经常使用但不常更改的 3 | // 特定于项目的包含文件 4 | // 5 | 6 | #pragma once 7 | 8 | #include "targetver.h" 9 | 10 | #include 11 | #include 12 | 13 | 14 | 15 | // TODO: 在此处引用程序需要的其他头文件 16 | #include 17 | #include 18 | #include 19 | #include 20 | #include 21 | --------------------------------------------------------------------------------