├── .gitignore ├── .travis.yml ├── LICENSE ├── Makefile ├── README.md ├── functions_reference ├── ref_ft_atoi_base.c ├── ref_ft_list_push_front.c ├── ref_ft_list_remove_if.c ├── ref_ft_list_size.c └── ref_ft_list_sort.c ├── helper.c ├── helper_list.c ├── libasm_test.h ├── main.c ├── prettier.py └── test ├── ft_atoi_base_test.c ├── ft_list_push_front_test.c ├── ft_list_remove_if_test.c ├── ft_list_size_test.c ├── ft_list_sort_test.c ├── ft_read_test.c ├── ft_strcmp_test.c ├── ft_strcpy_test.c ├── ft_strdup_test.c ├── ft_strlen_test.c └── ft_write_test.c /.gitignore: -------------------------------------------------------------------------------- 1 | *.o 2 | *.ghc 3 | a.out 4 | runtest 5 | tags 6 | -------------------------------------------------------------------------------- /.travis.yml: -------------------------------------------------------------------------------- 1 | language: c 2 | 3 | compiler: gcc 4 | 5 | os: 6 | - linux 7 | - osx 8 | 9 | addons: 10 | apt: 11 | packages: 12 | - python3 13 | - nasm 14 | 15 | before_install: 16 | # - if [ "$TRAVIS_OS_NAME" = "osx" ]; then brew update ; fi 17 | # - if [ "$TRAVIS_OS_NAME" = "osx" ]; then brew install python3 ; fi 18 | - if [ "$TRAVIS_OS_NAME" = "osx" ]; then brew install nasm ; fi 19 | 20 | install: 21 | - git clone git://git.cacharle.xyz/libasm ../libasm 22 | 23 | script: 24 | - make bonus 25 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | # **************************************************************************** # 2 | # # 3 | # ::: :::::::: # 4 | # Makefile :+: :+: :+: # 5 | # +:+ +:+ +:+ # 6 | # By: cacharle +#+ +:+ +#+ # 7 | # +#+#+#+#+#+ +#+ # 8 | # Created: 2020/02/08 03:06:59 by cacharle #+# #+# # 9 | # Updated: 2020/11/07 17:19:11 by charles ### ########.fr # 10 | # # 11 | # **************************************************************************** # 12 | 13 | LIBASM_PATH = ../libasm 14 | 15 | RM = rm -fv 16 | MAKE = make --no-print-directory 17 | PYTHON = python3 18 | 19 | CC = gcc 20 | CCFLAGS = -I. -Wall -Wextra -Wno-nonnull 21 | LDFLAGS = -L$(LIBASM_PATH) -lasm 22 | 23 | NAME = runtest 24 | SRC = main.c \ 25 | helper.c \ 26 | test/ft_strlen_test.c \ 27 | test/ft_strcpy_test.c \ 28 | test/ft_strcmp_test.c \ 29 | test/ft_write_test.c \ 30 | test/ft_read_test.c \ 31 | test/ft_strdup_test.c 32 | 33 | SRCBONUS = helper_list.c \ 34 | test/ft_atoi_base_test.c \ 35 | test/ft_list_size_test.c \ 36 | test/ft_list_push_front_test.c \ 37 | test/ft_list_sort_test.c \ 38 | test/ft_list_remove_if_test.c \ 39 | functions_reference/ref_ft_atoi_base.c \ 40 | functions_reference/ref_ft_list_size.c \ 41 | functions_reference/ref_ft_list_push_front.c \ 42 | functions_reference/ref_ft_list_sort.c \ 43 | functions_reference/ref_ft_list_remove_if.c 44 | 45 | LIBASM_ALL = all 46 | ifeq ($(LIBASM_TEST_BONUS),yes) 47 | SRC += $(SRCBONUS) 48 | CCFLAGS += -D LIBASM_TEST_BONUS 49 | LIBASM_ALL = bonus 50 | endif 51 | 52 | OBJ = $(SRC:.c=.o) 53 | 54 | run: pretty 55 | 56 | pretty: all 57 | ./$(NAME) 2> /dev/null | $(PYTHON) prettier.py 58 | 59 | run_raw: all 60 | ./$(NAME) 2> /dev/null 61 | 62 | run_debug: all 63 | ./$(NAME) 64 | 65 | bonus: 66 | $(MAKE) LIBASM_TEST_BONUS=yes 67 | 68 | all: $(NAME) 69 | 70 | $(NAME): libasm_all $(OBJ) 71 | $(CC) -o $@ $(OBJ) $(LDFLAGS) 72 | 73 | %.o: %.c 74 | $(CC) $(CCFLAGS) -c -o $@ $< 75 | 76 | clean: 77 | $(RM) $(OBJ) 78 | 79 | fclean: clean 80 | $(RM) $(NAME) 81 | 82 | re: libasm_fclean libasm_all fclean all 83 | 84 | 85 | libasm_all: 86 | $(MAKE) -C $(LIBASM_PATH) $(LIBASM_ALL) 87 | 88 | libasm_fclean: 89 | $(MAKE) -C $(LIBASM_PATH) fclean 90 | 91 | .PHONY: run pretty run_raw run_debug all clean fclean re libasm_all libasm_fclean 92 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # libasm\_test [![Build Status](https://api.travis-ci.com/cacharle/libasm_test.svg?branch=master)](https://travis-ci.com/cacharle/libasm_test) 2 | 3 | Test for the libasm project of school 42. 4 | 5 | ![preview](https://i.imgur.com/xpnwP0y.png) 6 | 7 | ## Usage 8 | 9 | The default path to your libasm is `../libasm`. You can modify it in the Makefile. 10 | 11 | ```sh 12 | $ make 13 | ``` 14 | 15 | ## Bonus 16 | 17 | **You need to `make fclean` when switching from all to bonus**. 18 | 19 | ```sh 20 | $ make bonus 21 | ``` 22 | 23 | Or: 24 | 25 | Set the environment variable `LIBASM_TEST_BONUS` to `yes`. 26 | ```sh 27 | $ echo 'export LIBASM_TEST_BONUS=yes' >> ~/.zshrc 28 | ``` 29 | 30 | ## Common issues 31 | 32 | ### ft\_write and ft\_read crash 33 | 34 | 35 | 36 | ### Compilation on linux with gcc 37 | 38 | To fix the `relocation R_X86_64_PC32 against symbol` error you can add inside your 39 | libasm source code `wrt ..plt` after a call to a libc function, like example below: 40 | 41 | ```asm 42 | ... 43 | call __errno_location wrt ..plt 44 | ... 45 | ``` 46 | 47 | Now you should be able to compile with `gcc` 48 | -------------------------------------------------------------------------------- /functions_reference/ref_ft_atoi_base.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ref_ft_atoi_base.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:20:16 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:17:01 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include 14 | #include "libasm_test.h" 15 | 16 | static 17 | bool valid_base(char *base) 18 | { 19 | if (strlen(base) < 2) 20 | return false; 21 | while (*base) 22 | { 23 | if (isspace(*base) || *base == '+' || *base == '-') 24 | return false; 25 | for (int i = 1; base[i]; i++) 26 | if (base[i] == *base) 27 | return false; 28 | base++; 29 | } 30 | return true; 31 | } 32 | 33 | int ref_ft_atoi_base(char *str, char *base) 34 | { 35 | long int nb; 36 | int radix; 37 | bool is_negative; 38 | 39 | if (!valid_base(base)) 40 | return 0; 41 | while (isspace(*str)) 42 | str++; 43 | is_negative = false; 44 | while (*str == '+' || *str == '-') 45 | if (*str++ == '-') 46 | is_negative = !is_negative; 47 | radix = strlen(base); 48 | nb = 0; 49 | while (*str && strchr(base, *str) != NULL) 50 | { 51 | nb *= radix; 52 | nb += strchr(base, *str) - base; 53 | str++; 54 | } 55 | return is_negative ? -nb : nb; 56 | } 57 | -------------------------------------------------------------------------------- /functions_reference/ref_ft_list_push_front.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ref_ft_list_push_front.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:20:23 by cacharle #+# #+# */ 9 | /* Updated: 2020/04/13 15:01:09 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | void ref_ft_list_push_front(t_list **begin_list, void *data) 16 | { 17 | if (begin_list == NULL) 18 | return ; 19 | t_list *new = malloc(sizeof(t_list)); 20 | if (new == NULL) 21 | return ; 22 | new->data = data; 23 | new->next = *begin_list; 24 | *begin_list = new; 25 | } 26 | -------------------------------------------------------------------------------- /functions_reference/ref_ft_list_remove_if.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ref_ft_list_remove_if.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:20:03 by cacharle #+# #+# */ 9 | /* Updated: 2020/10/21 15:28:59 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | #ifdef LIBASM_TEST_BONUS 16 | 17 | void ref_ft_list_remove_if(t_list **begin_list, void *data_ref, 18 | int (*cmp)(), void (*free_fct)(void *)) 19 | { 20 | t_list *saved_next; 21 | 22 | if (begin_list == NULL || *begin_list == NULL) 23 | return ; 24 | if (cmp((*begin_list)->data, data_ref) != 0) 25 | { 26 | ref_ft_list_remove_if(&(*begin_list)->next, data_ref, cmp, free_fct); 27 | return ; 28 | } 29 | saved_next = (*begin_list)->next; 30 | free_fct((*begin_list)->data); 31 | free(*begin_list); 32 | *begin_list = saved_next; 33 | ref_ft_list_remove_if(begin_list, data_ref, cmp, free_fct); 34 | } 35 | 36 | #endif 37 | -------------------------------------------------------------------------------- /functions_reference/ref_ft_list_size.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ref_ft_list_size.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:20:11 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:17:28 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | int ref_ft_list_size(t_list *begin_list) 16 | { 17 | int counter; 18 | 19 | counter = 0; 20 | while (begin_list != NULL) 21 | { 22 | counter++; 23 | begin_list = begin_list->next; 24 | } 25 | return counter; 26 | } 27 | -------------------------------------------------------------------------------- /functions_reference/ref_ft_list_sort.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ref_ft_list_sort.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 02:49:28 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:17:13 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | static 16 | t_list* merge_sorted_list(t_list* l1, t_list* l2, int (*cmp)(void *, void*)) 17 | { 18 | t_list *merged = 0x0; 19 | 20 | if (l1 == 0x0) 21 | return l2; 22 | if (l2 == 0x0) 23 | return l1; 24 | if (cmp(l1->data, l2->data) < 0) 25 | { 26 | merged = l1; 27 | merged->next = merge_sorted_list(l1->next, l2, cmp); 28 | } 29 | else 30 | { 31 | merged = l2; 32 | merged->next = merge_sorted_list(l1, l2->next, cmp); 33 | } 34 | return merged; 35 | } 36 | 37 | void ref_ft_list_sort(t_list **begin_list, int (*cmp)(void *, void*)) 38 | { 39 | if (begin_list == 0x0 || *begin_list == 0x0 40 | || (*begin_list)->next == 0x0) 41 | return ; 42 | t_list *fast = (*begin_list)->next; 43 | t_list *slow = *begin_list; 44 | while (fast != 0x0) 45 | { 46 | fast = fast->next; 47 | if (fast != 0x0) 48 | { 49 | fast = fast->next; 50 | slow = slow->next; 51 | } 52 | } 53 | t_list *middle = slow->next; 54 | slow->next = 0x0; 55 | 56 | ref_ft_list_sort(begin_list, cmp); 57 | ref_ft_list_sort(&middle, cmp); 58 | *begin_list = merge_sorted_list(*begin_list, middle, cmp); 59 | } 60 | -------------------------------------------------------------------------------- /helper.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* helper.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:07:07 by cacharle #+# #+# */ 9 | /* Updated: 2020/12/09 12:52:33 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | void print_ok(void) 16 | { 17 | printf("OK: %s\n", test_name); 18 | fflush(stdout); 19 | } 20 | 21 | void print_signaled_ko(const char *code) 22 | { 23 | printf("KO: [SEGFAULT]: %s: with: %s\n", test_name, code); 24 | fflush(stdout); 25 | } 26 | -------------------------------------------------------------------------------- /helper_list.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* helper_list.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:07:14 by cacharle #+# #+# */ 9 | /* Updated: 2020/02/08 03:07:15 by cacharle ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | int* 16 | create_data_elem(int data) 17 | { 18 | int *data_ptr = malloc(sizeof(int)); 19 | if (data_ptr == NULL) 20 | return (NULL); 21 | *data_ptr = data; 22 | return data_ptr; 23 | } 24 | 25 | t_list* 26 | create_elem(int data) 27 | { 28 | t_list *new = malloc(sizeof(t_list)); 29 | if (new == NULL) 30 | return NULL; 31 | if ((new->data = create_data_elem(data)) == NULL) 32 | return (NULL); 33 | new->next = NULL; 34 | return new; 35 | } 36 | 37 | static void 38 | push_front(t_list **lst_ptr, t_list *new_front) 39 | { 40 | if (lst_ptr == NULL || new_front == NULL) 41 | return ; 42 | new_front->next = *lst_ptr; 43 | *lst_ptr = new_front; 44 | } 45 | 46 | static t_list* 47 | reverse(t_list *list) 48 | { 49 | if (list == NULL || list->next == NULL) 50 | return list; 51 | t_list *tmp = reverse(list->next); 52 | list->next->next = list; 53 | list->next = NULL; 54 | return tmp; 55 | } 56 | 57 | t_list* 58 | list_from_format(char *fmt) 59 | { 60 | t_list *head = NULL; 61 | 62 | while (fmt != NULL && *fmt) 63 | { 64 | int n = (int)strtol(fmt, &fmt, 10); 65 | t_list *elem = create_elem(n); 66 | push_front(&head, elem); 67 | } 68 | return reverse(head); 69 | } 70 | 71 | t_list* 72 | list_dup(t_list *list) 73 | { 74 | t_list *dup_head = NULL; 75 | 76 | while (list != NULL) 77 | { 78 | t_list *tmp = create_elem(*(int*)list->data); 79 | push_front(&dup_head, tmp); 80 | } 81 | return reverse(dup_head); 82 | } 83 | 84 | int 85 | list_cmp(t_list *l1, t_list *l2) 86 | { 87 | if (l1 == NULL && l2 == NULL) 88 | return 0; 89 | if (l1 == NULL) 90 | return -1; 91 | if (l2 == NULL) 92 | return 1; 93 | if (l1->data == NULL) 94 | return -1; 95 | if (l2->data == NULL) 96 | return 1; 97 | if (*(int*)l1->data != *(int*)l2->data) 98 | return *(int*)l1->data - *(int*)l2->data; 99 | return list_cmp(l1->next, l2->next); 100 | } 101 | 102 | void 103 | list_print(t_list *list) 104 | { 105 | while (list != NULL) 106 | { 107 | printf("[%d] -> ", *(int*)list->data); 108 | list = list->next; 109 | } 110 | printf("(null)"); 111 | } 112 | 113 | void 114 | list_destroy(t_list *list) 115 | { 116 | if (list == NULL) 117 | return ; 118 | list_destroy(list->next); 119 | if (list->data != NULL) 120 | free(list->data); 121 | free(list); 122 | } 123 | -------------------------------------------------------------------------------- /libasm_test.h: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* libasm_test.h :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:07:19 by cacharle #+# #+# */ 9 | /* Updated: 2020/12/09 12:53:01 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #ifndef LIBASM_TEST_H 14 | # define LIBASM_TEST_H 15 | 16 | # include 17 | # include 18 | # include 19 | # include 20 | # include 21 | # include 22 | # include 23 | # include 24 | # include 25 | # include 26 | 27 | # ifdef __linux__ 28 | # define OPEN_MAX FOPEN_MAX 29 | # endif 30 | 31 | /* 32 | * mandatory 33 | */ 34 | int ft_strlen(char *str); 35 | char* ft_strcpy(char *dst, const char *src); 36 | int ft_strcmp(const char *s1, const char *s2); 37 | int ft_write(int fildes, const void *buf, size_t buf_size); 38 | int ft_read(int fildes, void *buf, size_t buf_size); 39 | char* ft_strdup(const char *str); 40 | 41 | /* 42 | * bonus 43 | */ 44 | # ifdef LIBASM_TEST_BONUS 45 | int ft_atoi_base(const char *str, const char *base); 46 | 47 | typedef struct s_list 48 | { 49 | void *data; 50 | struct s_list *next; 51 | } t_list; 52 | 53 | void ft_list_push_front(t_list **begin_list, void *data); 54 | int ft_list_size(t_list *begin_list); 55 | void ft_list_sort(t_list **begin_list, int (*cmp)()); 56 | void ft_list_remove_if(t_list **begin_list, void *data_ref, 57 | int (*cmp)(), void (*free_fct)(void *)); 58 | # endif 59 | 60 | /* 61 | * test_functions 62 | */ 63 | void ft_strlen_test(void); 64 | void ft_strcpy_test(void); 65 | void ft_strcmp_test(void); 66 | void ft_write_test(void); 67 | void ft_read_test(void); 68 | void ft_strdup_test(void); 69 | 70 | # ifdef LIBASM_TEST_BONUS 71 | void ft_atoi_base_test(void); 72 | void ft_list_push_front_test(void); 73 | void ft_list_size_test(void); 74 | void ft_list_sort_test(void); 75 | void ft_list_remove_if_test(void); 76 | # endif 77 | 78 | 79 | /* 80 | * helpers 81 | */ 82 | void print_ok(void); 83 | void print_signaled_ko(const char *code); 84 | 85 | # ifdef LIBASM_TEST_BONUS 86 | int* create_data_elem(int data); 87 | t_list* create_elem(int data); 88 | t_list* list_from_format(char *fmt); 89 | t_list* list_dup(t_list *list); 90 | int list_cmp(t_list *l1, t_list *l2); 91 | void list_print(t_list *list); 92 | void list_destroy(t_list *list); 93 | # endif 94 | 95 | /* 96 | * function of reference 97 | */ 98 | # ifdef LIBASM_TEST_BONUS 99 | int ref_ft_atoi_base(char *str, char *base); 100 | void ref_ft_list_push_front(t_list **begin_list, void *data); 101 | int ref_ft_list_size(t_list *begin_list); 102 | void ref_ft_list_sort(t_list **begin_list, int (*cmp)()); 103 | void ref_ft_list_remove_if(t_list **begin_list, void *data_ref, 104 | int (*cmp)(), void (*free_fct)(void *)); 105 | # endif 106 | 107 | /* 108 | * segfault tester 109 | */ 110 | extern int pid; 111 | extern bool signaled; 112 | extern bool signaled_suite; 113 | 114 | # define TEST_SEGFAULT(x) do { \ 115 | if ((pid = fork()) < 0) \ 116 | exit(EXIT_FAILURE); \ 117 | if (pid == 0) { \ 118 | do { x; } while(0); \ 119 | exit(EXIT_SUCCESS); \ 120 | } else { \ 121 | wait(&pid); \ 122 | signaled = WIFSIGNALED(pid); \ 123 | if (signaled) signaled_suite = true; \ 124 | } \ 125 | } while(0) 126 | 127 | extern char *test_name; 128 | 129 | # define TEST_ASM_FUNCTION(x) do { \ 130 | TEST_SEGFAULT(x); \ 131 | if (signaled) \ 132 | print_signaled_ko(#x); \ 133 | else \ 134 | print_ok(); \ 135 | } while(0) 136 | 137 | # define ERRNO_WRAP(x, errno_save) do { \ 138 | errno = 0; \ 139 | do { x; } while (0); \ 140 | errno_save = errno; \ 141 | } while(0) 142 | 143 | #endif 144 | -------------------------------------------------------------------------------- /main.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* main.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:06:45 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:13:43 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | int pid; 16 | bool signaled; 17 | bool signaled_suite; 18 | char *test_name; 19 | 20 | int main(void) 21 | { 22 | ft_strlen_test(); 23 | ft_strcpy_test(); 24 | ft_strcmp_test(); 25 | ft_write_test(); 26 | ft_read_test(); 27 | ft_strdup_test(); 28 | 29 | #ifdef LIBASM_TEST_BONUS 30 | ft_atoi_base_test(); 31 | ft_list_push_front_test(); 32 | ft_list_size_test(); 33 | ft_list_sort_test(); 34 | ft_list_remove_if_test(); 35 | #endif 36 | return 0; 37 | } 38 | -------------------------------------------------------------------------------- /prettier.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python3 2 | 3 | # **************************************************************************** # 4 | # # 5 | # ::: :::::::: # 6 | # prettier.py :+: :+: :+: # 7 | # +:+ +:+ +:+ # 8 | # By: cacharle +#+ +:+ +#+ # 9 | # +#+#+#+#+#+ +#+ # 10 | # Created: 2020/02/05 23:04:13 by cacharle #+# #+# # 11 | # Updated: 2020/12/09 13:05:13 by charles ### ########.fr # 12 | # # 13 | # **************************************************************************** # 14 | 15 | import os 16 | import sys 17 | import re 18 | import argparse 19 | 20 | 21 | def green(*strings): 22 | return "".join(["\033[32m{}\033[0m".format(s) for s in strings]) 23 | 24 | 25 | def red(*strings): 26 | return "".join(["\033[31m{}\033[0m".format(s) for s in strings]) 27 | 28 | def create_logs_entry(logs, key): 29 | logs[key] = {} 30 | logs[key]["ok_counter"] = 0 31 | logs[key]["ko_counter"] = 0 32 | logs[key]["ko_info"] = [] 33 | 34 | def parse(): 35 | logs = {} 36 | for line in sys.stdin: 37 | line = line.strip() 38 | if line[:2] == "OK": 39 | l = logs.get(line[4:]) 40 | if l is None: 41 | print("\n\n", line[4:], ": ", sep="", end="") 42 | create_logs_entry(logs, line[4:]) 43 | logs[line[4:]]["ok_counter"] += 1 44 | if (logs[line[4:]]["ok_counter"] + logs[line[4:]]["ko_counter"]) % 15 == 0: 45 | print("\n", ''.join([" " for _ in range(1 + len(line[4:]))]), end="") 46 | print(green("[OK] "), end="") 47 | continue 48 | m = None 49 | if line.find("SEGFAULT") != -1: 50 | name = line[4:line.find("with")] 51 | else: 52 | m = re.search("^KO: \[COMPARE\]: (.*): expected: (.*) got: (.*)( with: .*)?$", line) 53 | if m is None: 54 | print(line) 55 | print("PARSING ERROR") 56 | continue 57 | name = m.group(1) 58 | 59 | l = logs.get(name) 60 | if l is None: 61 | create_logs_entry(logs, name) 62 | print("\n\n", name, ": ", sep="", end="") 63 | l = logs.get(name) 64 | l["ko_counter"] += 1 65 | if m is None: 66 | l["ko_info"].append({ 67 | "type": "SEGFAULT", 68 | "expected": None, 69 | "actual": None, 70 | "with": line[line.find("with:") + len("with:"):] 71 | }) 72 | else: 73 | l["ko_info"].append({ 74 | "type": "COMPARE", 75 | "expected": m.group(2), 76 | "actual": m.group(3), 77 | "with": None 78 | }) 79 | if m is not None and m.group(4) is not None: 80 | l["ko_info"][-1]["with"] = m.group(4)[6:] 81 | if (l["ok_counter"] + l["ko_counter"]) % 15 == 0: 82 | print("\n", ''.join([" " for _ in range(1 + len(name))]), end="") 83 | print(red("[KO] "), end="") 84 | sys.stdout.flush() 85 | return logs 86 | 87 | if __name__ == "__main__": 88 | os.system("clear") 89 | logs = parse() 90 | print("\n") 91 | for k, v in logs.items(): 92 | for e in v["ko_info"]: 93 | if e['type'] == "SEGFAULT": 94 | print("{} : {}: {}".format(k, red('SEGFAULT'), e['with'])) 95 | elif e['type'] == "COMPARE": 96 | p = str(k) 97 | if e["with"] is not None: 98 | p += "with {}".format(e['with']) 99 | print(p, ":\n {}\n {}".format(green('expected: ') + e['expected'], 100 | red('actual: ') + e['actual'])) 101 | -------------------------------------------------------------------------------- /test/ft_atoi_base_test.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ft_atoi_base_test.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:07:27 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:12:55 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | static int expected_ret; 16 | static int actual_ret; 17 | 18 | #define TO_STRING(x) (#x) 19 | 20 | #define FT_ATOI_BASE_EXPECT(str, base) do { \ 21 | actual_ret = ft_atoi_base(str, base); \ 22 | expected_ret = ref_ft_atoi_base(str, base); \ 23 | if (actual_ret != expected_ret) \ 24 | printf("KO: [COMPARE]: %s: expected: %d got: %d with: "#str", "#base"\n", \ 25 | test_name, expected_ret, actual_ret); \ 26 | else \ 27 | print_ok(); \ 28 | } while (0); 29 | 30 | static 31 | void ft_atoi_base_segfault(void) 32 | { 33 | TEST_ASM_FUNCTION(ft_atoi_base("", "")); 34 | TEST_ASM_FUNCTION(ft_atoi_base("10", "")); 35 | TEST_ASM_FUNCTION(ft_atoi_base("", "01")); 36 | TEST_ASM_FUNCTION(ft_atoi_base("123", "0123456789")); 37 | TEST_ASM_FUNCTION(ft_atoi_base("101", "01")); 38 | TEST_ASM_FUNCTION(ft_atoi_base("ffe0", "0123456789abcdef")); 39 | TEST_ASM_FUNCTION(ft_atoi_base("\t\n\r\v\f\r 4", "01234")); 40 | TEST_ASM_FUNCTION(ft_atoi_base("45", "")); 41 | TEST_ASM_FUNCTION(ft_atoi_base("45", "0")); 42 | TEST_ASM_FUNCTION(ft_atoi_base("45", "01")); 43 | TEST_ASM_FUNCTION(ft_atoi_base("10", "011")); 44 | TEST_ASM_FUNCTION(ft_atoi_base("10", "0+")); 45 | TEST_ASM_FUNCTION(ft_atoi_base("10", "-0")); 46 | TEST_ASM_FUNCTION(ft_atoi_base("10111", "\t541")); 47 | TEST_ASM_FUNCTION(ft_atoi_base("10111", "98\n541")); 48 | TEST_ASM_FUNCTION(ft_atoi_base("10111", "7\r541")); 49 | TEST_ASM_FUNCTION(ft_atoi_base("10111", "0\v541")); 50 | TEST_ASM_FUNCTION(ft_atoi_base("10111", "1\f541")); 51 | TEST_ASM_FUNCTION(ft_atoi_base("10111", "54 1")); 52 | TEST_ASM_FUNCTION(ft_atoi_base("111000", "01")); 53 | TEST_ASM_FUNCTION(ft_atoi_base("ff", "0123456789abcdef")); 54 | TEST_ASM_FUNCTION(ft_atoi_base("52", "01234567")); 55 | TEST_ASM_FUNCTION(ft_atoi_base("2a", "0123456789abcdef")); 56 | TEST_ASM_FUNCTION(ft_atoi_base("7fffffff", "0123456789abcdef")); 57 | TEST_ASM_FUNCTION(ft_atoi_base("ff", "0123-456789abcdef")); 58 | TEST_ASM_FUNCTION(ft_atoi_base("ff", "01\r23456789abcdef")); 59 | TEST_ASM_FUNCTION(ft_atoi_base("ff", "abcc")); 60 | TEST_ASM_FUNCTION(ft_atoi_base("ff", "")); 61 | TEST_ASM_FUNCTION(ft_atoi_base("ff", "a")); 62 | TEST_ASM_FUNCTION(ft_atoi_base("-ff", "0123456789abcdef")); 63 | TEST_ASM_FUNCTION(ft_atoi_base("--ff", "0123456789abcdef")); 64 | TEST_ASM_FUNCTION(ft_atoi_base("+--ff", "0123456789abcdef")); 65 | TEST_ASM_FUNCTION(ft_atoi_base("-++++++-+--ff", "0123456789abcdef")); 66 | TEST_ASM_FUNCTION(ft_atoi_base("-++++++-+--ff\xff", "0123456789abcdef")); 67 | TEST_ASM_FUNCTION(ft_atoi_base("-+\r++-+--ff\xff", "0123456789abcdef")); 68 | TEST_ASM_FUNCTION(ft_atoi_base("-01", "01")); 69 | TEST_ASM_FUNCTION(ft_atoi_base("--11101", "01")); 70 | TEST_ASM_FUNCTION(ft_atoi_base("+-123", "01")); 71 | TEST_ASM_FUNCTION(ft_atoi_base("-++++01++-+--ff", "01")); 72 | TEST_ASM_FUNCTION(ft_atoi_base("-++10101\xff", "01")); 73 | TEST_ASM_FUNCTION(ft_atoi_base("-+\r++-+--01\x01", "01")); 74 | TEST_ASM_FUNCTION(ft_atoi_base("a\0bb", "ab")); 75 | TEST_ASM_FUNCTION(ft_atoi_base("-b\0bb", "ab")); 76 | TEST_ASM_FUNCTION(ft_atoi_base(" \t\n\r-++++++-+--ff\xff", "0123456789abcdef")); 77 | TEST_ASM_FUNCTION(ft_atoi_base(" -+\r++-+--ff\xff", "0123456789abcdef")); 78 | TEST_ASM_FUNCTION(ft_atoi_base("\n-01", "01")); 79 | TEST_ASM_FUNCTION(ft_atoi_base("\x0b--11101", "01")); 80 | TEST_ASM_FUNCTION(ft_atoi_base(" 755x+", "01234567")); 81 | TEST_ASM_FUNCTION(ft_atoi_base(" 700chmod", "01234567")); 82 | TEST_ASM_FUNCTION(ft_atoi_base(" 644yo", "01234567")); 83 | TEST_ASM_FUNCTION(ft_atoi_base(TO_STRING(INT_MAX), "0123456789")); 84 | TEST_ASM_FUNCTION(ft_atoi_base(TO_STRING(INT_MIN), "0123456789")); 85 | } 86 | 87 | static 88 | void ft_atoi_base_compare(void) 89 | { 90 | FT_ATOI_BASE_EXPECT("", ""); 91 | FT_ATOI_BASE_EXPECT("10", ""); 92 | FT_ATOI_BASE_EXPECT("", "01"); 93 | FT_ATOI_BASE_EXPECT("123", "0123456789"); 94 | FT_ATOI_BASE_EXPECT("101", "01"); 95 | FT_ATOI_BASE_EXPECT("ffe0", "0123456789abcdef"); 96 | FT_ATOI_BASE_EXPECT("\t\n\r\v\f\r 4", "01234"); 97 | FT_ATOI_BASE_EXPECT("45", ""); 98 | FT_ATOI_BASE_EXPECT("45", "0"); 99 | FT_ATOI_BASE_EXPECT("45", "01"); 100 | FT_ATOI_BASE_EXPECT("10", "011"); 101 | FT_ATOI_BASE_EXPECT("10", "0+"); 102 | FT_ATOI_BASE_EXPECT("10", "-0"); 103 | FT_ATOI_BASE_EXPECT("10111", "\t541"); 104 | FT_ATOI_BASE_EXPECT("10111", "98\n541"); 105 | FT_ATOI_BASE_EXPECT("10111", "7\r541"); 106 | FT_ATOI_BASE_EXPECT("10111", "0\v541"); 107 | FT_ATOI_BASE_EXPECT("10111", "1\f541"); 108 | FT_ATOI_BASE_EXPECT("10111", "54 1"); 109 | FT_ATOI_BASE_EXPECT("111000", "01"); 110 | FT_ATOI_BASE_EXPECT("ff", "0123456789abcdef"); 111 | FT_ATOI_BASE_EXPECT("52", "01234567"); 112 | FT_ATOI_BASE_EXPECT("2a", "0123456789abcdef"); 113 | FT_ATOI_BASE_EXPECT("7fffffff", "0123456789abcdef"); 114 | FT_ATOI_BASE_EXPECT("ff", "0123-456789abcdef"); 115 | FT_ATOI_BASE_EXPECT("ff", "01\r23456789abcdef"); 116 | FT_ATOI_BASE_EXPECT("ff", "abcc"); 117 | FT_ATOI_BASE_EXPECT("ff", ""); 118 | FT_ATOI_BASE_EXPECT("ff", "a"); 119 | FT_ATOI_BASE_EXPECT("-ff", "0123456789abcdef"); 120 | FT_ATOI_BASE_EXPECT("--ff", "0123456789abcdef"); 121 | FT_ATOI_BASE_EXPECT("+--ff", "0123456789abcdef"); 122 | FT_ATOI_BASE_EXPECT("-++++++-+--ff", "0123456789abcdef"); 123 | FT_ATOI_BASE_EXPECT("-++++++-+--ff\xff", "0123456789abcdef"); 124 | FT_ATOI_BASE_EXPECT("-+\r++-+--ff\xff", "0123456789abcdef"); 125 | FT_ATOI_BASE_EXPECT("-01", "01"); 126 | FT_ATOI_BASE_EXPECT("--11101", "01"); 127 | FT_ATOI_BASE_EXPECT("+-123", "01"); 128 | FT_ATOI_BASE_EXPECT("-++++01++-+--ff", "01"); 129 | FT_ATOI_BASE_EXPECT("-++10101\xff", "01"); 130 | FT_ATOI_BASE_EXPECT("-+\r++-+--01\x01", "01"); 131 | FT_ATOI_BASE_EXPECT("a\0bb", "ab"); 132 | FT_ATOI_BASE_EXPECT("-b\0bb", "ab"); 133 | FT_ATOI_BASE_EXPECT(" \t\n\r-++++++-+--ff\xff", "0123456789abcdef"); 134 | FT_ATOI_BASE_EXPECT(" -+\r++-+--ff\xff", "0123456789abcdef"); 135 | FT_ATOI_BASE_EXPECT("\n-01", "01"); 136 | FT_ATOI_BASE_EXPECT("\x0b--11101", "01"); 137 | FT_ATOI_BASE_EXPECT(" 755x+", "01234567"); 138 | FT_ATOI_BASE_EXPECT(" 700chmod", "01234567"); 139 | FT_ATOI_BASE_EXPECT(" 644yo", "01234567"); 140 | FT_ATOI_BASE_EXPECT(TO_STRING(INT_MAX), "0123456789"); 141 | FT_ATOI_BASE_EXPECT(TO_STRING(INT_MIN), "0123456789"); 142 | } 143 | 144 | void ft_atoi_base_test(void) 145 | { 146 | test_name = "ft_atoi_base.s"; 147 | signaled_suite = false; 148 | ft_atoi_base_segfault(); 149 | if (!signaled_suite) 150 | ft_atoi_base_compare(); 151 | } 152 | -------------------------------------------------------------------------------- /test/ft_list_push_front_test.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ft_list_push_front_test.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:08:24 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:15:43 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | static t_list *tmp; 16 | static t_list *expected; 17 | static t_list *actual; 18 | static t_list *from; 19 | 20 | #define FT_LIST_PUSH_FRONT_EXPECT(fmt, push) do { \ 21 | from = list_from_format(fmt); \ 22 | expected = list_from_format(fmt); \ 23 | actual = list_from_format(fmt); \ 24 | ref_ft_list_push_front(&expected, create_data_elem(push)); \ 25 | ft_list_push_front(&actual, create_data_elem(push)); \ 26 | if (list_cmp(expected, actual) != 0) { \ 27 | printf("KO: [COMPARE]: %s: expected: ", test_name); \ 28 | list_print(expected); \ 29 | printf(" got: "); \ 30 | list_print(actual); \ 31 | printf(" with: "); \ 32 | list_print(from); \ 33 | putchar('\n'); \ 34 | } else \ 35 | print_ok(); \ 36 | list_destroy(from); \ 37 | list_destroy(expected); \ 38 | list_destroy(actual); \ 39 | } while (0); 40 | 41 | static 42 | void ft_list_push_front_segfault(void) 43 | { 44 | TEST_ASM_FUNCTION(tmp = NULL; ft_list_push_front(&tmp, malloc(1));list_destroy(tmp)); 45 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2 3"); ft_list_push_front(&tmp, create_data_elem(34)); list_destroy(tmp)); 46 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2 3 4 10"); ft_list_push_front(&tmp, create_data_elem(1)); list_destroy(tmp)); 47 | TEST_ASM_FUNCTION(tmp = list_from_format("111234 1234 1112"); ft_list_push_front(&tmp, create_data_elem(7)); list_destroy(tmp)); 48 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2"); ft_list_push_front(&tmp, create_data_elem(0)); list_destroy(tmp)); 49 | TEST_ASM_FUNCTION( 50 | tmp = list_from_format("1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20"); 51 | ft_list_push_front(&tmp, create_data_elem(4)); 52 | ft_list_push_front(&tmp, create_data_elem(4)); 53 | ft_list_push_front(&tmp, create_data_elem(4)); 54 | ft_list_push_front(&tmp, create_data_elem(4)); 55 | list_destroy(tmp); 56 | ); 57 | } 58 | 59 | static 60 | void ft_list_push_front_compare(void) 61 | { 62 | FT_LIST_PUSH_FRONT_EXPECT("", 0); 63 | FT_LIST_PUSH_FRONT_EXPECT("", 1); 64 | FT_LIST_PUSH_FRONT_EXPECT("0", 1); 65 | FT_LIST_PUSH_FRONT_EXPECT("1 2 3", 4); 66 | FT_LIST_PUSH_FRONT_EXPECT("1 2 3", -1); 67 | FT_LIST_PUSH_FRONT_EXPECT("1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20", 7); 68 | } 69 | 70 | void ft_list_push_front_test(void) 71 | { 72 | test_name = "ft_list_push_front.s"; 73 | signaled_suite = false; 74 | ft_list_push_front_segfault(); 75 | if (!signaled_suite) 76 | ft_list_push_front_compare(); 77 | } 78 | -------------------------------------------------------------------------------- /test/ft_list_remove_if_test.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ft_list_remove_if_test.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:08:42 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:15:34 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | static 16 | int compar(void *a, void *ref) 17 | { 18 | return *(int*)a - *(int*)ref; 19 | } 20 | 21 | static 22 | void free_fct(void *data) 23 | { 24 | free(data); 25 | } 26 | 27 | static int i0 = 0; 28 | static int i1 = 1; 29 | static int i2 = 2; 30 | static int i3 = 3; 31 | static t_list *tmp; 32 | static t_list *expected; 33 | static t_list *actual; 34 | static t_list *from; 35 | 36 | #define FT_LIST_REMOVE_IF_EXPECT(fmt, ref) do { \ 37 | from = list_from_format(fmt); \ 38 | expected = list_from_format(fmt); \ 39 | actual = list_from_format(fmt); \ 40 | ref_ft_list_remove_if(&expected, ref, compar, free_fct); \ 41 | ft_list_remove_if(&actual, ref, compar, free_fct); \ 42 | if (list_cmp(expected, actual) != 0) { \ 43 | printf("KO: [COMPARE]: %s: expected: ", test_name); \ 44 | list_print(expected); \ 45 | printf(" got: "); \ 46 | list_print(actual); \ 47 | printf(" with: "); \ 48 | list_print(from); \ 49 | putchar('\n'); \ 50 | } else \ 51 | print_ok(); \ 52 | list_destroy(from); \ 53 | list_destroy(expected); \ 54 | list_destroy(actual); \ 55 | } while (0); 56 | 57 | static 58 | void ft_list_remove_if_segfault(void) 59 | { 60 | TEST_ASM_FUNCTION(tmp = list_from_format(""); 61 | ft_list_remove_if(&tmp, &i0, compar, free_fct); 62 | list_destroy(tmp)); 63 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2"); 64 | ft_list_remove_if(&tmp, &i3, compar, free_fct); 65 | list_destroy(tmp)); 66 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2 3"); 67 | ft_list_remove_if(&tmp, &i3, compar, free_fct); 68 | list_destroy(tmp)); 69 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2 3"); 70 | ft_list_remove_if(&tmp, &i1, compar, free_fct); 71 | list_destroy(tmp)); 72 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2 3"); 73 | ft_list_remove_if(&tmp, &i2, compar, free_fct); 74 | list_destroy(tmp)); 75 | TEST_ASM_FUNCTION(tmp = list_from_format("987 3 9812 3 12 312 3 12491234989 3 908 3"); 76 | ft_list_remove_if(&tmp, &i3, compar, free_fct); 77 | list_destroy(tmp)); 78 | TEST_ASM_FUNCTION(tmp = list_from_format("1 1 1 1 1 1 1 1"); 79 | ft_list_remove_if(&tmp, &i1, compar, free_fct); 80 | list_destroy(tmp)); 81 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2 1 2 1 2 1 2"); 82 | ft_list_remove_if(&tmp, &i1, compar, free_fct); 83 | list_destroy(tmp)); 84 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2 1 2 1 2 1 2"); 85 | ft_list_remove_if(&tmp, &i2, compar, free_fct); 86 | list_destroy(tmp)); 87 | } 88 | 89 | static 90 | void ft_list_remove_if_compare(void) 91 | { 92 | FT_LIST_REMOVE_IF_EXPECT("", &i0); 93 | FT_LIST_REMOVE_IF_EXPECT("1 2", &i3); 94 | FT_LIST_REMOVE_IF_EXPECT("1 2 3", &i3); 95 | FT_LIST_REMOVE_IF_EXPECT("1 2 3", &i1); 96 | FT_LIST_REMOVE_IF_EXPECT("1 2 3", &i2); 97 | FT_LIST_REMOVE_IF_EXPECT("987 3 9812 3 12 312 3 12491234989 3 908 3", &i3); 98 | FT_LIST_REMOVE_IF_EXPECT("1 1 1 1 1 1 1 1", &i1); 99 | FT_LIST_REMOVE_IF_EXPECT("1 2 1 2 1 2 1 2", &i1); 100 | FT_LIST_REMOVE_IF_EXPECT("1 2 1 2 1 2 1 2", &i2); 101 | } 102 | 103 | void ft_list_remove_if_test(void) 104 | { 105 | test_name = "ft_list_remove_if.s"; 106 | signaled_suite = false; 107 | ft_list_remove_if_segfault(); 108 | if (!signaled_suite) 109 | ft_list_remove_if_compare(); 110 | } 111 | -------------------------------------------------------------------------------- /test/ft_list_size_test.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ft_list_size_test.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:08:20 by cacharle #+# #+# */ 9 | /* Updated: 2020/04/13 14:54:33 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | static t_list *tmp; 16 | static int expected; 17 | static int actual; 18 | 19 | #define FT_LIST_SIZE_EXPECT(fmt) do { \ 20 | tmp = list_from_format(fmt); \ 21 | expected = ref_ft_list_size(tmp); \ 22 | actual = ft_list_size(tmp); \ 23 | if (expected != actual) { \ 24 | printf("KO: [COMPARE]: %s: expected: %d ", \ 25 | test_name, expected); \ 26 | printf("got: %d with:", actual); \ 27 | list_print(tmp); \ 28 | putchar('\n'); \ 29 | } else \ 30 | print_ok(); \ 31 | list_destroy(tmp); \ 32 | } while (0); 33 | 34 | static 35 | void ft_list_size_segfault(void) 36 | { 37 | TEST_ASM_FUNCTION(tmp = list_from_format(""); ft_list_size(tmp); list_destroy(tmp)); 38 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2 3"); ft_list_size(tmp); list_destroy(tmp)); 39 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2 3 4 10"); ft_list_size(tmp); list_destroy(tmp)); 40 | TEST_ASM_FUNCTION(tmp = list_from_format("111234 1234 1112"); ft_list_size(tmp); list_destroy(tmp)); 41 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2"); ft_list_size(tmp); list_destroy(tmp)); 42 | TEST_ASM_FUNCTION( 43 | tmp = list_from_format("1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20"); 44 | ft_list_size(tmp); 45 | list_destroy(tmp) 46 | ); 47 | } 48 | 49 | static 50 | void ft_list_size_compare(void) 51 | { 52 | FT_LIST_SIZE_EXPECT("1 2 3"); 53 | FT_LIST_SIZE_EXPECT(""); 54 | FT_LIST_SIZE_EXPECT("1 2 3 4 10"); 55 | FT_LIST_SIZE_EXPECT("19879 123 12344"); 56 | FT_LIST_SIZE_EXPECT("1"); 57 | FT_LIST_SIZE_EXPECT("1 2"); 58 | FT_LIST_SIZE_EXPECT("1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20"); 59 | } 60 | 61 | void ft_list_size_test(void) 62 | { 63 | test_name = "ft_list_size.s"; 64 | ft_list_size_segfault(); 65 | if (!signaled) 66 | ft_list_size_compare(); 67 | } 68 | -------------------------------------------------------------------------------- /test/ft_list_sort_test.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ft_list_sort_test.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:08:15 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:15:22 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | static 16 | int compar_int(void *a, void *b) 17 | { 18 | return *(int*)a - *(int*)b; 19 | } 20 | 21 | static t_list *tmp; 22 | static t_list *expected; 23 | static t_list *actual; 24 | static t_list *from; 25 | 26 | #define FT_LIST_SORT_EXPECT(fmt) do { \ 27 | from = list_from_format(fmt); \ 28 | expected = list_from_format(fmt); \ 29 | actual = list_from_format(fmt); \ 30 | ref_ft_list_sort(&expected, compar_int); \ 31 | ft_list_sort(&actual, compar_int); \ 32 | if (list_cmp(expected, actual) != 0) { \ 33 | printf("KO: [COMPARE]: %s: expected: ", test_name); \ 34 | list_print(expected); \ 35 | printf(" got: "); \ 36 | list_print(actual); \ 37 | printf(" with: "); \ 38 | list_print(from); \ 39 | putchar('\n'); \ 40 | } else \ 41 | print_ok(); \ 42 | list_destroy(from); \ 43 | list_destroy(expected); \ 44 | list_destroy(actual); \ 45 | } while (0); 46 | 47 | static 48 | void ft_list_sort_segfault(void) 49 | { 50 | TEST_ASM_FUNCTION(tmp = list_from_format(""); ft_list_sort(&tmp, compar_int); list_destroy(tmp)); 51 | TEST_ASM_FUNCTION(tmp = list_from_format("1"); ft_list_sort(&tmp, compar_int); list_destroy(tmp)); 52 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2"); ft_list_sort(&tmp, compar_int); list_destroy(tmp)); 53 | TEST_ASM_FUNCTION(tmp = list_from_format("1 2 3"); ft_list_sort(&tmp, compar_int); list_destroy(tmp)); 54 | TEST_ASM_FUNCTION(tmp = list_from_format("-1 0 1 2 3 4 5 6"); ft_list_sort(&tmp, compar_int); list_destroy(tmp)); 55 | TEST_ASM_FUNCTION(tmp = list_from_format("98 12 12 45 1 -1 232 34 23"); ft_list_sort(&tmp, compar_int); list_destroy(tmp)); 56 | TEST_ASM_FUNCTION(tmp = list_from_format("12 45 1 -1 232 34 23 87879"); ft_list_sort(&tmp, compar_int); list_destroy(tmp)); 57 | } 58 | 59 | static 60 | void ft_list_sort_compare(void) 61 | { 62 | FT_LIST_SORT_EXPECT(""); 63 | FT_LIST_SORT_EXPECT("1"); 64 | FT_LIST_SORT_EXPECT("1 2"); 65 | FT_LIST_SORT_EXPECT("1 2 3"); 66 | FT_LIST_SORT_EXPECT("-1 0 1 2 3 4 5 6"); 67 | FT_LIST_SORT_EXPECT("98 12 12 45 1 -1 232 34 23"); 68 | FT_LIST_SORT_EXPECT("12 45 1 -1 232 34 23 87879"); 69 | } 70 | 71 | void ft_list_sort_test(void) 72 | { 73 | test_name = "ft_list_sort.s"; 74 | signaled_suite = false; 75 | ft_list_sort_segfault(); 76 | if (!signaled_suite) 77 | ft_list_sort_compare(); 78 | } 79 | -------------------------------------------------------------------------------- /test/ft_read_test.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ft_read_test.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:07:44 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:15:02 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | #define FT_READ_BUF_SIZE (1 << 12) 16 | 17 | static int ft_read_pipe[2]; 18 | static char buf[FT_READ_BUF_SIZE] = {0}; 19 | static ssize_t read_ret; 20 | static ssize_t read_origin_ret; 21 | static int read_errno; 22 | static int read_origin_errno; 23 | 24 | #define FT_READ_EXPECT(str) do { \ 25 | if (pipe(ft_read_pipe) < 0) \ 26 | exit(EXIT_FAILURE); \ 27 | fcntl(ft_read_pipe[0], F_SETFL, O_NONBLOCK); \ 28 | write(ft_read_pipe[1], str, strlen(str)); \ 29 | ERRNO_WRAP(read_origin_ret = read(ft_read_pipe[0], buf, strlen(str)), read_origin_errno); \ 30 | write(ft_read_pipe[1], str, strlen(str)); \ 31 | ERRNO_WRAP(read_ret = ft_read(ft_read_pipe[0], buf, strlen(str)), read_errno); \ 32 | buf[read_ret] = '\0'; \ 33 | if (read_errno != read_origin_errno) \ 34 | printf("KO: [COMPARE]: %s: expected: errno %d got: errno %d with: "#str"\n", \ 35 | test_name, read_origin_errno, read_errno); \ 36 | else if (strcmp(buf, str) != 0 || read_ret != read_origin_ret) \ 37 | printf("KO: [COMPARE]: %s: expected: %lu \"%s\" got: %lu \"%s\" with: %d, \"%s\", %zu \n", \ 38 | test_name, strlen(str), str, read_ret, buf, ft_read_pipe[0], buf, read_origin_ret); \ 39 | else \ 40 | print_ok(); \ 41 | close(ft_read_pipe[1]); \ 42 | close(ft_read_pipe[0]); \ 43 | } while (0); 44 | 45 | #define FT_READ_EXPECT_ERROR(fd, buf, size) do { \ 46 | ERRNO_WRAP(read_ret = ft_read(fd, buf, size), read_errno); \ 47 | ERRNO_WRAP(read_origin_ret = read(fd, buf, size), read_origin_errno); \ 48 | if ((long)read_ret != -1) \ 49 | printf("KO: [COMPARE]: %s: expected: %ld got: %ld with: %d "#buf" %d\n", \ 50 | test_name, -1l, (long)read_ret, fd, size); \ 51 | else if (read_errno != read_origin_errno) \ 52 | printf("KO: [COMPARE]: %s: expected: errno %d got: errno %d with: %d "#buf", %d\n", \ 53 | test_name, read_origin_errno, read_errno, fd, size); \ 54 | else \ 55 | print_ok(); \ 56 | } while (0); 57 | 58 | static 59 | void ft_read_test_segfault(void) 60 | { 61 | int tmp[2]; 62 | char buf_read[2048]; 63 | 64 | if (pipe(tmp) < 0) 65 | exit(EXIT_FAILURE); 66 | write(tmp[1], "asdfkasdfkl;jasd;ljkfa;lssdlfasdfasdfasdfasdfasdfasdfasdfasdfasdf", 40); 67 | TEST_ASM_FUNCTION(ft_read(-1, buf_read, 2)); 68 | TEST_ASM_FUNCTION(ft_read(tmp[0], NULL, 2)); 69 | TEST_ASM_FUNCTION(ft_read(tmp[0], buf_read, 0)); 70 | TEST_ASM_FUNCTION(ft_read(tmp[0], buf_read, 5)); 71 | TEST_ASM_FUNCTION(ft_read(tmp[0], buf_read, 32)); 72 | close(tmp[0]); 73 | close(tmp[1]); 74 | TEST_ASM_FUNCTION(ft_read(-1, buf_read, 2)); 75 | TEST_ASM_FUNCTION(ft_read(OPEN_MAX + 1, buf_read, 2)); 76 | } 77 | 78 | static 79 | void ft_read_test_compare(void) 80 | { 81 | FT_READ_EXPECT(""); 82 | FT_READ_EXPECT("bon"); 83 | FT_READ_EXPECT("bonjour"); 84 | FT_READ_EXPECT("#c#s#p#x#X#e#f#g"); 85 | FT_READ_EXPECT("the\0hidden"); 86 | FT_READ_EXPECT("Lorem ipsum dolor sit amet, consectetur adipiscing\ 87 | elit. Sed in malesuada purus. Etiam a scelerisque massa. Ut non euismod elit. Aliquam\ 88 | bibendum dolor mi, id fringilla tellus pulvinar eu. Fusce vel fermentum sem. Cras\ 89 | volutpat, eros eget rhoncus rhoncus, diam augue egestas dolor, vitae rutrum nisi\ 90 | felis sed purus. Mauris magna ex, mollis non suscipit eu, lacinia ac turpis. Phasellus\ 91 | ac tortor et lectus fermentum lobortis eu at mauris. Vestibulum sit amet posuere\ 92 | tortor, sit amet consequat amet."); 93 | 94 | int tmp[2]; 95 | pipe(tmp); 96 | char buf[32]; 97 | 98 | write(tmp[1], "bonjour", 7); 99 | FT_READ_EXPECT_ERROR(tmp[0], NULL, 3); 100 | FT_READ_EXPECT_ERROR(-1, buf, 7); 101 | FT_READ_EXPECT_ERROR(42, buf, 7); 102 | FT_READ_EXPECT_ERROR(9809, buf, 7); 103 | FT_READ_EXPECT_ERROR(98123, buf, 1); 104 | FT_READ_EXPECT_ERROR(42, NULL, 7); 105 | } 106 | 107 | void ft_read_test(void) 108 | { 109 | test_name = "ft_read.s"; 110 | signaled_suite = false; 111 | ft_read_test_segfault(); 112 | if (!signaled_suite) 113 | ft_read_test_compare(); 114 | } 115 | -------------------------------------------------------------------------------- /test/ft_strcmp_test.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ft_strcmp_test.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:08:03 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:14:40 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | int strcmp_expected; 16 | int strcmp_actual; 17 | 18 | # define FT_STRCMP_EXPECT(s1, s2) do { \ 19 | strcmp_expected = strcmp(s1, s2); \ 20 | strcmp_actual = ft_strcmp(s1, s2); \ 21 | if ((strcmp_expected < 0 && strcmp_actual < 0) || \ 22 | (strcmp_expected > 0 && strcmp_actual > 0) || \ 23 | (strcmp_expected == 0 && strcmp_actual == 0)) \ 24 | print_ok(); \ 25 | else \ 26 | printf("KO: [COMPARE]: ft_strcmp.s: expected: %d got: %d with: "#s1", "#s2"\n", \ 27 | strcmp_expected, strcmp_actual); \ 28 | } while (0); 29 | 30 | static 31 | void ft_strcmp_test_segfault(void) 32 | { 33 | TEST_ASM_FUNCTION(ft_strcmp("", "")); 34 | TEST_ASM_FUNCTION(ft_strcmp("bon", "bon")); 35 | TEST_ASM_FUNCTION(ft_strcmp("bonjour", "bonjour")); 36 | TEST_ASM_FUNCTION(ft_strcmp("abcdefghijasdf1324''klji//", "abcdefghijasdf1324''klji//")); 37 | TEST_ASM_FUNCTION(ft_strcmp("the\0hidden", "the\0hidden")); 38 | TEST_ASM_FUNCTION(ft_strcmp("Lorem ipsum dolor sit amet, consectetur adipiscing\ 39 | elit. Sed in malesuada purus. Etiam a scelerisque massa. Ut non euismod elit. Aliquam\ 40 | bibendum dolor mi, id fringilla tellus pulvinar eu. Fusce vel fermentum sem. Cras\ 41 | volutpat, eros eget rhoncus rhoncus, diam augue egestas dolor, vitae rutrum nisi\ 42 | felis sed purus. Mauris magna ex, mollis non suscipit eu, lacinia ac turpis. Phasellus\ 43 | ac tortor et lectus fermentum lobortis eu at mauris. Vestibulum sit amet posuere\ 44 | tortor, sit amet consequat amet.", 45 | "Lorem ipsum dolor sit amet, consectetur adipiscing\ 46 | elit. Sed in malesuada purus. Etiam a scelerisque massa. Ut non euismod elit. Aliquam\ 47 | bibendum dolor mi, id fringilla tellus pulvinar eu. Fusce vel fermentum sem. Cras\ 48 | volutpat, eros eget rhoncus rhoncus, diam augue egestas dolor, vitae rutrum nisi\ 49 | felis sed purus. Mauris magna ex, mollis non suscipit eu, lacinia ac turpis. Phasellus\ 50 | ac tortor et lectus fermentum lobortis eu at mauris. Vestibulum sit amet posuere\ 51 | tortor, sit amet consequat amet.")); 52 | } 53 | 54 | static 55 | void ft_strcmp_test_compare(void) 56 | { 57 | FT_STRCMP_EXPECT("", ""); 58 | FT_STRCMP_EXPECT("bon", ""); 59 | FT_STRCMP_EXPECT("bonjour", ""); 60 | FT_STRCMP_EXPECT("asdklfjasdfj////asdf'''asdf3##", ""); 61 | FT_STRCMP_EXPECT("the\0hidden", ""); 62 | FT_STRCMP_EXPECT("Lorem ipsum dolor sit amet, consectetur adipiscing\ 63 | elit. Sed in malesuada purus. Etiam a scelerisque massa. Ut non euismod elit. Aliquam\ 64 | bibendum dolor mi, id fringilla tellus pulvinar eu. Fusce vel fermentum sem. Cras\ 65 | volutpat, eros eget rhoncus rhoncus, diam augue egestas dolor, vitae rutrum nisi\ 66 | felis sed purus. Mauris magna ex, mollis non suscipit eu, lacinia ac turpis. Phasellus\ 67 | ac tortor et lectus fermentum lobortis eu at mauris. Vestibulum sit amet posuere\ 68 | tortor, sit amet consequat amet.", ""); 69 | FT_STRCMP_EXPECT("", ""); 70 | FT_STRCMP_EXPECT("bon", "bon"); 71 | FT_STRCMP_EXPECT("bonjour", "bonjour"); 72 | FT_STRCMP_EXPECT("asdklfjasdfj////asdf'''asdf3##", "asdklfjasdfj////asdf'''asdf3##"); 73 | FT_STRCMP_EXPECT("the\0hidden", "the\0hidden"); 74 | FT_STRCMP_EXPECT("Lorem ipsum dolor sit amet, consectetur adipiscing\ 75 | elit. Sed in malesuada purus. Etiam a scelerisque massa. Ut non euismod elit. Aliquam\ 76 | bibendum dolor mi, id fringilla tellus pulvinar eu. Fusce vel fermentum sem. Cras\ 77 | volutpat, eros eget rhoncus rhoncus, diam augue egestas dolor, vitae rutrum nisi\ 78 | felis sed purus. Mauris magna ex, mollis non suscipit eu, lacinia ac turpis. Phasellus\ 79 | ac tortor et lectus fermentum lobortis eu at mauris. Vestibulum sit amet posuere\ 80 | tortor, sit amet consequat amet.", 81 | "Lorem ipsum dolor sit amet, consectetur adipiscing\ 82 | elit. Sed in malesuada purus. Etiam a scelerisque massa. Ut non euismod elit. Aliquam\ 83 | bibendum dolor mi, id fringilla tellus pulvinar eu. Fusce vel fermentum sem. Cras\ 84 | volutpat, eros eget rhoncus rhoncus, diam augue egestas dolor, vitae rutrum nisi\ 85 | felis sed purus. Mauris magna ex, mollis non suscipit eu, lacinia ac turpis. Phasellus\ 86 | ac tortor et lectus fermentum lobortis eu at mauris. Vestibulum sit amet posuere\ 87 | tortor, sit amet consequat amet."); 88 | 89 | FT_STRCMP_EXPECT("", "asdf"); 90 | FT_STRCMP_EXPECT("bon", "bo"); 91 | FT_STRCMP_EXPECT("bonjour", "onjour"); 92 | FT_STRCMP_EXPECT("asdklfjasdfj////asdf'''asdf3##", "asdklfjasdfj////asdf'''asdf3##"); 93 | FT_STRCMP_EXPECT("the\0hidden", "thehidden"); 94 | FT_STRCMP_EXPECT("Lorem ipsum dolor st amet, consectetur adipiscing", "Lodsfsdfasdf"); 95 | 96 | FT_STRCMP_EXPECT("\x01", "\x01"); 97 | FT_STRCMP_EXPECT("\x02", "\x01"); 98 | FT_STRCMP_EXPECT("\x01", "\x02"); 99 | FT_STRCMP_EXPECT("\xff", "\xff"); 100 | FT_STRCMP_EXPECT("\xfe", "\xff"); 101 | FT_STRCMP_EXPECT("\xff", "\xfe"); 102 | 103 | FT_STRCMP_EXPECT("\x01\x01", "\x01"); 104 | FT_STRCMP_EXPECT("\x01\x02", "\x01"); 105 | FT_STRCMP_EXPECT("\x02\x01", "\x02"); 106 | FT_STRCMP_EXPECT("\xff\xff", "\xff"); 107 | FT_STRCMP_EXPECT("\xff\xfe", "\xff"); 108 | FT_STRCMP_EXPECT("\xfe\xff", "\xfe"); 109 | 110 | FT_STRCMP_EXPECT("\x01", "\x01\x01"); 111 | FT_STRCMP_EXPECT("\x01", "\x01\x02"); 112 | FT_STRCMP_EXPECT("\x02", "\x02\x01"); 113 | FT_STRCMP_EXPECT("\xff", "\xff\xff"); 114 | FT_STRCMP_EXPECT("\xff", "\xff\xfe"); 115 | FT_STRCMP_EXPECT("\xfe", "\xfe\xff"); 116 | } 117 | 118 | void ft_strcmp_test(void) 119 | { 120 | test_name = "ft_strcmp.s"; 121 | signaled_suite = false; 122 | ft_strcmp_test_segfault(); 123 | if (!signaled_suite) 124 | ft_strcmp_test_compare(); 125 | } 126 | -------------------------------------------------------------------------------- /test/ft_strcpy_test.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ft_strcpy_test.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:07:58 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:14:26 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | #define FT_STRCPY_BUF_SIZE (1 << 12) 16 | 17 | static char expected_buf[FT_STRCPY_BUF_SIZE] = {0}; 18 | static char actual_buf[FT_STRCPY_BUF_SIZE] = {0}; 19 | static char pre_expected_buf[FT_STRCPY_BUF_SIZE] = {0}; 20 | static char pre_actual_buf[FT_STRCPY_BUF_SIZE] = {0}; 21 | 22 | #define FT_STRCPY_EXPECT(str) do { \ 23 | strcpy(pre_expected_buf, expected_buf); \ 24 | strcpy(pre_actual_buf, actual_buf); \ 25 | strcpy(expected_buf, str); \ 26 | ft_strcpy(actual_buf, str); \ 27 | if (strcmp(expected_buf, actual_buf) != 0) \ 28 | printf("KO: [COMPARE]: %s: expected: \"%s\" got: \"%s\" with: \"%s\", \"%s\"\n",\ 29 | test_name, expected_buf, actual_buf, pre_expected_buf, pre_actual_buf); \ 30 | else \ 31 | print_ok(); \ 32 | } while (0); 33 | 34 | static 35 | void ft_strcpy_test_segfault(void) 36 | { 37 | char buf[FT_STRCPY_BUF_SIZE] = {0}; 38 | 39 | TEST_ASM_FUNCTION(ft_strcpy(buf, "")); 40 | TEST_ASM_FUNCTION(ft_strcpy(buf, "abc")); 41 | TEST_ASM_FUNCTION(ft_strcpy(buf, "asl;fjl;asdjfjkasdl;fjadjsf")); 42 | TEST_ASM_FUNCTION(ft_strcpy(buf, "yope\0la")); 43 | TEST_ASM_FUNCTION(ft_strcpy(buf, "Lorem ipsum dolor sit amet, consectetur adipiscing\ 44 | elit. Sed in malesuada purus. Etiam a scelerisque massa. Ut non euismod elit. Aliquam\ 45 | bibendum dolor mi, id fringilla tellus pulvinar eu. Fusce vel fermentum sem. Cras\ 46 | volutpat, eros eget rhoncus rhoncus, diam augue egestas dolor, vitae rutrum nisi\ 47 | felis sed purus. Mauris magna ex, mollis non suscipit eu, lacinia ac turpis. Phasellus\ 48 | ac tortor et lectus fermentum lobortis eu at mauris. Vestibulum sit amet posuere\ 49 | tortor, sit amet consequat amet.")); 50 | } 51 | 52 | static 53 | void ft_strcpy_test_compare(void) 54 | { 55 | FT_STRCPY_EXPECT(""); 56 | FT_STRCPY_EXPECT("abc"); 57 | FT_STRCPY_EXPECT("asl;fjl;asdjfjkasdl;fjadjsf"); 58 | FT_STRCPY_EXPECT("yope\0la"); 59 | FT_STRCPY_EXPECT("Lorem ipsum dolor sit amet, consectetur adipiscing\ 60 | elit. Sed in malesuada purus. Etiam a scelerisque massa. Ut non euismod elit. Aliquam\ 61 | bibendum dolor mi, id fringilla tellus pulvinar eu. Fusce vel fermentum sem. Cras\ 62 | volutpat, eros eget rhoncus rhoncus, diam augue egestas dolor, vitae rutrum nisi\ 63 | felis sed purus. Mauris magna ex, mollis non suscipit eu, lacinia ac turpis. Phasellus\ 64 | ac tortor et lectus fermentum lobortis eu at mauris. Vestibulum sit amet posuere\ 65 | tortor, sit amet consequat amet."); 66 | FT_STRCPY_EXPECT("\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0b\x0c\x0d\x0e\x0f"); 67 | FT_STRCPY_EXPECT("\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0b\x0c\x0d\x0e\x0f"); 68 | } 69 | 70 | void ft_strcpy_test(void) 71 | { 72 | test_name = "ft_strcpy.s"; 73 | signaled_suite = false; 74 | ft_strcpy_test_segfault(); 75 | if (!signaled_suite) 76 | ft_strcpy_test_compare(); 77 | } 78 | -------------------------------------------------------------------------------- /test/ft_strdup_test.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ft_strdup_test.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:08:06 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:14:04 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | static char *tmp; 16 | 17 | #define FT_STRDUP_EXPECT(str) do { \ 18 | tmp = ft_strdup(str); \ 19 | if (tmp == NULL || strcmp(str, tmp) != 0) \ 20 | printf("KO: [COMPARE]: %s: expected: \"%s\" got: \"%s\"\n", test_name, str, tmp); \ 21 | else \ 22 | print_ok(); \ 23 | free(tmp); \ 24 | } while (0); 25 | 26 | static 27 | void ft_strdup_test_segfault(void) 28 | { 29 | char *tmp2 = NULL; 30 | 31 | TEST_ASM_FUNCTION(ft_strdup("")); 32 | TEST_ASM_FUNCTION(ft_strdup("abc")); 33 | TEST_ASM_FUNCTION(ft_strdup("asl;fjl;asdjfjkasdl;fjadjsf")); 34 | TEST_ASM_FUNCTION(ft_strdup("yope\0la")); 35 | TEST_ASM_FUNCTION(ft_strdup("Lorem ipsum dolor sit amet, consectetur adipiscing\ 36 | elit. Sed in malesuada purus. Etiam a scelerisque massa. Ut non euismod elit. Aliquam\ 37 | bibendum dolor mi, id fringilla tellus pulvinar eu. Fusce vel fermentum sem. Cras\ 38 | volutpat, eros eget rhoncus rhoncus, diam augue egestas dolor, vitae rutrum nisi\ 39 | felis sed purus. Mauris magna ex, mollis non suscipit eu, lacinia ac turpis. Phasellus\ 40 | ac tortor et lectus fermentum lobortis eu at mauris. Vestibulum sit amet posuere\ 41 | tortor, sit amet consequat amet.")); 42 | 43 | tmp2 = ft_strdup(""); 44 | TEST_ASM_FUNCTION(char a = *tmp2; a++;); 45 | tmp2 = ft_strdup("abc"); 46 | TEST_ASM_FUNCTION(char a = *tmp2; a++;); 47 | tmp2 = ft_strdup("asl;fjl;asd"); 48 | TEST_ASM_FUNCTION(char a = *tmp2; a++;); 49 | tmp2 = ft_strdup("yope\0la"); 50 | TEST_ASM_FUNCTION(char a = *tmp2; a++;); 51 | } 52 | 53 | static 54 | void ft_strdup_test_compare(void) 55 | { 56 | FT_STRDUP_EXPECT(""); 57 | FT_STRDUP_EXPECT("abc"); 58 | FT_STRDUP_EXPECT("asl;fjl;asdjfjkasdl;fjadjsf"); 59 | FT_STRDUP_EXPECT("yope\0la"); 60 | FT_STRDUP_EXPECT("Lorem ipsum dolor sit amet, consectetur adipiscing\ 61 | elit. Sed in malesuada purus. Etiam a scelerisque massa. Ut non euismod elit. Aliquam\ 62 | bibendum dolor mi, id fringilla tellus pulvinar eu. Fusce vel fermentum sem. Cras\ 63 | volutpat, eros eget rhoncus rhoncus, diam augue egestas dolor, vitae rutrum nisi\ 64 | felis sed purus. Mauris magna ex, mollis non suscipit eu, lacinia ac turpis. Phasellus\ 65 | ac tortor et lectus fermentum lobortis eu at mauris. Vestibulum sit amet posuere\ 66 | tortor, sit amet consequat amet."); 67 | FT_STRDUP_EXPECT("\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0b\x0c\x0d\x0e\x0f"); 68 | FT_STRDUP_EXPECT("\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0b\x0c\x0d\x0e\x0f"); 69 | } 70 | 71 | void ft_strdup_test(void) 72 | { 73 | test_name = "ft_strdup.s"; 74 | signaled_suite = false; 75 | ft_strdup_test_segfault(); 76 | if (!signaled_suite) 77 | ft_strdup_test_compare(); 78 | } 79 | -------------------------------------------------------------------------------- /test/ft_strlen_test.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ft_strlen_test.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:07:53 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:14:15 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | int actual; 16 | int expected; 17 | 18 | #define FT_STRLEN_EXPECT(str) do { \ 19 | actual = ft_strlen(str); \ 20 | expected = strlen(str); \ 21 | if (actual != expected) \ 22 | printf("KO: [COMPARE]: %s: expected: %d got: %d with: "#str"\n", \ 23 | test_name, expected, actual); \ 24 | else \ 25 | print_ok(); \ 26 | } while (0); 27 | 28 | static 29 | void ft_strlen_test_segfault(void) 30 | { 31 | TEST_ASM_FUNCTION(ft_strlen("")); 32 | TEST_ASM_FUNCTION(ft_strlen("bon")); 33 | TEST_ASM_FUNCTION(ft_strlen("bonjour")); 34 | TEST_ASM_FUNCTION(ft_strlen("asdfasdf''///##!!@")); 35 | TEST_ASM_FUNCTION(ft_strlen("the\0hidden")); 36 | TEST_ASM_FUNCTION(ft_strlen("Lorem ipsum dolor sit amet, consectetur adipiscing\ 37 | elit. Sed in malesuada purus. Etiam a scelerisque massa. Ut non euismod elit. Aliquam\ 38 | bibendum dolor mi, id fringilla tellus pulvinar eu. Fusce vel fermentum sem. Cras\ 39 | volutpat, eros eget rhoncus rhoncus, diam augue egestas dolor, vitae rutrum nisi\ 40 | felis sed purus. Mauris magna ex, mollis non suscipit eu, lacinia ac turpis. Phasellus\ 41 | ac tortor et lectus fermentum lobortis eu at mauris. Vestibulum sit amet posuere\ 42 | tortor, sit amet consequat amet.")); 43 | } 44 | 45 | static 46 | void ft_strlen_test_compare(void) 47 | { 48 | FT_STRLEN_EXPECT(""); 49 | FT_STRLEN_EXPECT("bon"); 50 | FT_STRLEN_EXPECT("bonjour"); 51 | FT_STRLEN_EXPECT("asdfasdf''///##!!@"); 52 | FT_STRLEN_EXPECT("the\0hidden"); 53 | FT_STRLEN_EXPECT("Lorem ipsum dolor sit amet, consectetur adipiscing\ 54 | elit. Sed in malesuada purus. Etiam a scelerisque massa. Ut non euismod elit. Aliquam\ 55 | bibendum dolor mi, id fringilla tellus pulvinar eu. Fusce vel fermentum sem. Cras\ 56 | volutpat, eros eget rhoncus rhoncus, diam augue egestas dolor, vitae rutrum nisi\ 57 | felis sed purus. Mauris magna ex, mollis non suscipit eu, lacinia ac turpis. Phasellus\ 58 | ac tortor et lectus fermentum lobortis eu at mauris. Vestibulum sit amet posuere\ 59 | tortor, sit amet consequat amet."); 60 | } 61 | 62 | void ft_strlen_test(void) 63 | { 64 | test_name = "ft_strlen.s"; 65 | signaled_suite = false; 66 | ft_strlen_test_segfault(); 67 | if (!signaled_suite) 68 | ft_strlen_test_compare(); 69 | } 70 | -------------------------------------------------------------------------------- /test/ft_write_test.c: -------------------------------------------------------------------------------- 1 | /* ************************************************************************** */ 2 | /* */ 3 | /* ::: :::::::: */ 4 | /* ft_write_test.c :+: :+: :+: */ 5 | /* +:+ +:+ +:+ */ 6 | /* By: cacharle +#+ +:+ +#+ */ 7 | /* +#+#+#+#+#+ +#+ */ 8 | /* Created: 2020/02/08 03:07:48 by cacharle #+# #+# */ 9 | /* Updated: 2020/11/07 17:15:12 by charles ### ########.fr */ 10 | /* */ 11 | /* ************************************************************************** */ 12 | 13 | #include "libasm_test.h" 14 | 15 | #define FT_WRITE_BUF_SIZE (1 << 12) 16 | 17 | static int ft_write_pipe[2]; 18 | static char buf[FT_WRITE_BUF_SIZE] = {0}; 19 | static ssize_t write_ret; 20 | static ssize_t write_origin_ret; 21 | static int write_errno; 22 | static int write_origin_errno; 23 | static ssize_t ret; 24 | 25 | #define FT_WRITE_EXPECT(str) do { \ 26 | if (pipe(ft_write_pipe) < 0) \ 27 | exit(EXIT_FAILURE); \ 28 | fcntl(ft_write_pipe[0], F_SETFL, O_NONBLOCK); \ 29 | ERRNO_WRAP(write_origin_ret = write(ft_write_pipe[1], str, strlen(str)), write_origin_errno); \ 30 | read(ft_write_pipe[0], buf, FT_WRITE_BUF_SIZE); \ 31 | ERRNO_WRAP(write_ret = ft_write(ft_write_pipe[1], str, strlen(str)), write_errno); \ 32 | ret = read(ft_write_pipe[0], buf, FT_WRITE_BUF_SIZE); \ 33 | buf[ret] = '\0'; \ 34 | if (write_errno != write_origin_errno) \ 35 | printf("KO: [COMPARE]: %s: expected: errno %d got: errno %d with: "#str"\n", \ 36 | test_name, write_origin_errno, write_errno); \ 37 | else if (strcmp(buf, str) != 0 || write_ret != write_origin_ret) \ 38 | printf("KO: [COMPARE]: %s: expected: %lu \"%s\" got: %lu \"%s\" with: %d, \"%s\", %zu \n", \ 39 | test_name, strlen(str), str, write_ret, buf, ft_write_pipe[0], buf, strlen(str)); \ 40 | else \ 41 | print_ok(); \ 42 | close(ft_write_pipe[1]); \ 43 | close(ft_write_pipe[0]); \ 44 | } while (0); 45 | 46 | #define FT_WRITE_EXPECT_ERROR(fd, str, size) do { \ 47 | ERRNO_WRAP(write_ret = ft_write(fd, str, size), write_errno); \ 48 | ERRNO_WRAP(write_origin_ret = write(fd, str, size), write_origin_errno); \ 49 | if ((long)write_ret != -1) \ 50 | printf("KO: [COMPARE]: %s: expected: %ld got: %ld with: %d "#str", %d\n", \ 51 | test_name, -1l, (long)write_ret, fd, size); \ 52 | else if (write_errno != write_origin_errno) \ 53 | printf("KO: [COMPARE]: %s: expected: errno %d got: errno %d with: %d "#str", %d\n", \ 54 | test_name, write_origin_errno, write_errno, fd, size); \ 55 | else \ 56 | print_ok(); \ 57 | } while (0); 58 | 59 | static 60 | void ft_write_test_segfault(void) 61 | { 62 | int tmp[2]; 63 | if (pipe(tmp) < 0) 64 | exit(EXIT_FAILURE); 65 | TEST_ASM_FUNCTION(ft_write(-1, "test", 5)); 66 | TEST_ASM_FUNCTION(ft_write(tmp[1], NULL, 5)); 67 | TEST_ASM_FUNCTION(ft_write(tmp[1], "test", 0)); 68 | TEST_ASM_FUNCTION(ft_write(tmp[1], "test", 5)); 69 | TEST_ASM_FUNCTION(ft_write(tmp[1], "t", 1)); 70 | TEST_ASM_FUNCTION(ft_write(tmp[1], "", 0)); 71 | TEST_ASM_FUNCTION(ft_write(tmp[1], "test", 4)); 72 | TEST_ASM_FUNCTION(ft_write(tmp[1], "test", 2)); 73 | TEST_ASM_FUNCTION(ft_write(tmp[1], NULL, 2)); 74 | close(tmp[0]); 75 | close(tmp[1]); 76 | TEST_ASM_FUNCTION(ft_write(-1, "tt", 2)); 77 | TEST_ASM_FUNCTION(ft_write(OPEN_MAX + 1, "tt", 2)); 78 | } 79 | 80 | static 81 | void ft_write_test_compare(void) 82 | { 83 | FT_WRITE_EXPECT(""); 84 | FT_WRITE_EXPECT("bon"); 85 | FT_WRITE_EXPECT("bonjour"); 86 | FT_WRITE_EXPECT("#c#s#p#x#X#e#f#g"); 87 | FT_WRITE_EXPECT("the\0hidden"); 88 | FT_WRITE_EXPECT("Lorem ipsum dolor sit amet, consectetur adipiscing\ 89 | elit. Sed in malesuada purus. Etiam a scelerisque massa. Ut non euismod elit. Aliquam\ 90 | bibendum dolor mi, id fringilla tellus pulvinar eu. Fusce vel fermentum sem. Cras\ 91 | volutpat, eros eget rhoncus rhoncus, diam augue egestas dolor, vitae rutrum nisi\ 92 | felis sed purus. Mauris magna ex, mollis non suscipit eu, lacinia ac turpis. Phasellus\ 93 | ac tortor et lectus fermentum lobortis eu at mauris. Vestibulum sit amet posuere\ 94 | tortor, sit amet consequat amet."); 95 | 96 | FT_WRITE_EXPECT_ERROR(STDOUT_FILENO, NULL, 3); 97 | FT_WRITE_EXPECT_ERROR(-1, "bonjour", 7); 98 | FT_WRITE_EXPECT_ERROR(42, "bonjour", 7); 99 | FT_WRITE_EXPECT_ERROR(9809, "bonjour", 7); 100 | FT_WRITE_EXPECT_ERROR(98123, "", 1); 101 | FT_WRITE_EXPECT_ERROR(42, NULL, 7); 102 | } 103 | 104 | void ft_write_test(void) 105 | { 106 | test_name = "ft_write.s"; 107 | signaled_suite = false; 108 | ft_write_test_segfault(); 109 | if (!signaled_suite) 110 | ft_write_test_compare(); 111 | } 112 | --------------------------------------------------------------------------------