├── .gitignore ├── LICENSE ├── LinkedListApi.c ├── LinkedListApi.h ├── Makefile ├── README.md ├── glthreads ├── Makefile ├── glthread.c ├── glthread.h ├── main.c └── main2.c └── main.c /.gitignore: -------------------------------------------------------------------------------- 1 | # Prerequisites 2 | *.d 3 | 4 | # Object files 5 | *.o 6 | *.ko 7 | *.obj 8 | *.elf 9 | 10 | # Linker output 11 | *.ilk 12 | *.map 13 | *.exp 14 | 15 | # Precompiled Headers 16 | *.gch 17 | *.pch 18 | 19 | # Libraries 20 | *.lib 21 | *.a 22 | *.la 23 | *.lo 24 | 25 | # Shared objects (inc. Windows DLLs) 26 | *.dll 27 | *.so 28 | *.so.* 29 | *.dylib 30 | 31 | # Executables 32 | *.exe 33 | *.out 34 | *.app 35 | *.i*86 36 | *.x86_64 37 | *.hex 38 | 39 | # Debug files 40 | *.dSYM/ 41 | *.su 42 | *.idb 43 | *.pdb 44 | 45 | # Kernel Module Compile Results 46 | *.mod* 47 | *.cmd 48 | .tmp_versions/ 49 | modules.order 50 | Module.symvers 51 | Mkfile.old 52 | dkms.conf 53 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 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 | -------------------------------------------------------------------------------- /LinkedListApi.c: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | #include 4 | #include 5 | #include "LinkedListApi.h" 6 | #include 7 | 8 | ll_t* init_singly_ll(){ 9 | return calloc(1, sizeof(ll_t)); 10 | } 11 | 12 | singly_ll_node_t* singly_ll_init_node(void* data){ 13 | singly_ll_node_t* node = calloc(1, sizeof(singly_ll_node_t)); 14 | node->data = data; 15 | return node; 16 | } 17 | 18 | int 19 | singly_ll_add_node(ll_t* ll, singly_ll_node_t *node){ 20 | if(!ll) return -1; 21 | if(!node) return -1; 22 | if(!GET_HEAD_SINGLY_LL(ll)){ 23 | GET_HEAD_SINGLY_LL(ll) = node; 24 | INC_NODE_COUNT_SINGLY_LL(ll); 25 | return 0; 26 | } 27 | 28 | node->next = GET_HEAD_SINGLY_LL(ll); 29 | GET_HEAD_SINGLY_LL(ll) = node; 30 | INC_NODE_COUNT_SINGLY_LL(ll); 31 | return 0; 32 | } 33 | 34 | int 35 | singly_ll_add_node_by_val(ll_t *ll, void* data){ 36 | singly_ll_node_t* node = singly_ll_init_node(data); 37 | return singly_ll_add_node(ll, node); 38 | } 39 | 40 | int 41 | singly_ll_delete_node(ll_t *ll, singly_ll_node_t *node){ 42 | if(!ll) return -1; 43 | if(!GET_HEAD_SINGLY_LL(ll) || !node) return 0; 44 | singly_ll_node_t *trav = NULL; 45 | /*if node is not the last node*/ 46 | if(node->next){ 47 | singly_ll_node_t *temp = NULL; 48 | node->data = node->next->data; 49 | temp = node->next; 50 | node->next = node->next->next; 51 | free(temp); 52 | DEC_NODE_COUNT_SINGLY_LL(ll); 53 | return 0; 54 | } 55 | 56 | /* if node is the only node in LL*/ 57 | if(ll->node_count == 1 && GET_HEAD_SINGLY_LL(ll) == node){ 58 | free(node); 59 | GET_HEAD_SINGLY_LL(ll) = NULL; 60 | DEC_NODE_COUNT_SINGLY_LL(ll); 61 | return 0; 62 | } 63 | 64 | /*if node is the last node of the LL*/ 65 | trav = GET_HEAD_SINGLY_LL(ll); 66 | while(trav->next != node){ 67 | trav = trav->next; 68 | continue; 69 | } 70 | 71 | trav->next = NULL; 72 | free(node); 73 | DEC_NODE_COUNT_SINGLY_LL(ll); 74 | return 0; 75 | } 76 | 77 | int 78 | singly_ll_remove_node(ll_t *ll, singly_ll_node_t *node){ 79 | if(!ll || !GET_HEAD_SINGLY_LL(ll)) return 0; 80 | if(!node){ 81 | printf("%s(%d) : Error : node is NULL\n", __FUNCTION__, __LINE__); 82 | return -1; 83 | } 84 | int i = 0; 85 | singly_ll_node_t *head = GET_HEAD_SINGLY_LL(ll), *prev = NULL; 86 | 87 | if(head == node){ 88 | GET_HEAD_SINGLY_LL(ll) = GET_NEXT_NODE_SINGLY_LL(head); 89 | DEC_NODE_COUNT_SINGLY_LL(ll); 90 | node->next = NULL; 91 | return 0; 92 | } 93 | 94 | prev = head; 95 | head = GET_NEXT_NODE_SINGLY_LL(head); 96 | for(i =1; i < GET_NODE_COUNT_SINGLY_LL(ll); i++){ 97 | if(head != node){ 98 | prev = head; 99 | head = GET_NEXT_NODE_SINGLY_LL(head); 100 | continue; 101 | } 102 | 103 | GET_NEXT_NODE_SINGLY_LL(prev) = GET_NEXT_NODE_SINGLY_LL(head); 104 | GET_NEXT_NODE_SINGLY_LL(head) = NULL; 105 | DEC_NODE_COUNT_SINGLY_LL(ll); 106 | node->next = NULL; 107 | return 0; 108 | } 109 | printf("%s(%d) : Error : node not found\n", __FUNCTION__, __LINE__); 110 | return -1; 111 | } 112 | 113 | 114 | 115 | unsigned int 116 | singly_ll_delete_node_by_value(ll_t *ll, void *data, int size){ 117 | if(!ll || !GET_HEAD_SINGLY_LL(ll)) return 0; 118 | unsigned int curren_node_count = GET_NODE_COUNT_SINGLY_LL(ll); 119 | singly_ll_node_t* trav = GET_HEAD_SINGLY_LL(ll); 120 | while(trav != NULL){ 121 | if(memcmp(trav->data, data, size) == 0){ 122 | singly_ll_delete_node(ll, trav); 123 | return curren_node_count - GET_NODE_COUNT_SINGLY_LL(ll); 124 | } 125 | trav = trav->next; 126 | } 127 | return curren_node_count - GET_NODE_COUNT_SINGLY_LL(ll); 128 | } 129 | 130 | 131 | unsigned int 132 | singly_ll_remove_node_by_value(ll_t *ll, void *data, int size){ 133 | if(!ll || !GET_HEAD_SINGLY_LL(ll)) return 0; 134 | unsigned int curren_node_count = GET_NODE_COUNT_SINGLY_LL(ll); 135 | singly_ll_node_t* trav = GET_HEAD_SINGLY_LL(ll); 136 | while(trav != NULL){ 137 | if(memcmp(trav->data, data, size) == 0){ 138 | singly_ll_remove_node(ll, trav); 139 | return curren_node_count - GET_NODE_COUNT_SINGLY_LL(ll); 140 | } 141 | trav = trav->next; 142 | } 143 | return curren_node_count - GET_NODE_COUNT_SINGLY_LL(ll); 144 | } 145 | 146 | 147 | unsigned int 148 | singly_ll_remove_node_by_dataptr(ll_t *ll, void *data){ 149 | if(!ll || !GET_HEAD_SINGLY_LL(ll)) return 0; 150 | unsigned int curren_node_count = GET_NODE_COUNT_SINGLY_LL(ll); 151 | singly_ll_node_t* trav = GET_HEAD_SINGLY_LL(ll); 152 | while(trav != NULL){ 153 | if(trav->data == data){ 154 | singly_ll_remove_node(ll, trav); 155 | return curren_node_count - GET_NODE_COUNT_SINGLY_LL(ll); 156 | } 157 | trav = trav->next; 158 | } 159 | return curren_node_count - GET_NODE_COUNT_SINGLY_LL(ll); 160 | } 161 | 162 | 163 | singly_ll_node_t* 164 | singly_ll_get_node_by_data_ptr(ll_t *ll, void *data){ 165 | if(!ll || !GET_HEAD_SINGLY_LL(ll)) return NULL; 166 | int i = 0; 167 | singly_ll_node_t *head = GET_HEAD_SINGLY_LL(ll); 168 | 169 | for(; i < GET_NODE_COUNT_SINGLY_LL(ll); i++){ 170 | if(head->data == data) 171 | return head; 172 | head = GET_NEXT_NODE_SINGLY_LL(head); 173 | } 174 | return NULL; 175 | } 176 | 177 | 178 | void print_singly_LL(ll_t *ll){ 179 | if(!ll) { 180 | printf("Invalid Linked List\n"); 181 | return; 182 | } 183 | if(is_singly_ll_empty(ll)){ 184 | printf("Empty Linked List\n"); 185 | return; 186 | } 187 | 188 | singly_ll_node_t* trav = GET_HEAD_SINGLY_LL(ll); 189 | unsigned int i = 0; 190 | printf("node count = %d\n", GET_NODE_COUNT_SINGLY_LL(ll)); 191 | while(trav){ 192 | printf("%d. Data = %p, node = %p\n", i, trav->data, trav); 193 | i++; 194 | trav = trav->next; 195 | } 196 | } 197 | 198 | bool_t 199 | is_singly_ll_empty(ll_t *ll){ 200 | if(!ll) assert(0); 201 | if(ll->node_count == 0) 202 | return LL_TRUE; 203 | return LL_FALSE; 204 | } 205 | 206 | void 207 | reverse_singly_ll(ll_t *ll){ 208 | if(!ll) assert(0) ; 209 | if(is_singly_ll_empty(ll)) return; 210 | if(GET_NODE_COUNT_SINGLY_LL(ll) == 1) return; 211 | singly_ll_node_t *p1 = GET_HEAD_SINGLY_LL(ll), 212 | *p2 = ll->head->next, *p3 = NULL; 213 | p1->next = NULL; 214 | do{ 215 | p3 = p2->next; 216 | p2->next = p1; 217 | p1 = p2; 218 | p2 = p3; 219 | }while(p3); 220 | ll->head = p1; 221 | return; 222 | } 223 | 224 | void 225 | delete_singly_ll(ll_t *ll){ 226 | if(!ll) return; 227 | 228 | if(is_singly_ll_empty(ll)){ 229 | return; 230 | } 231 | 232 | singly_ll_node_t *head = GET_HEAD_SINGLY_LL(ll), 233 | *next = GET_NEXT_NODE_SINGLY_LL(head); 234 | 235 | do{ 236 | free(head); 237 | head = next; 238 | if(next) 239 | next = GET_NEXT_NODE_SINGLY_LL(next); 240 | 241 | } while(head); 242 | 243 | ll->node_count = 0; 244 | ll->head = NULL; 245 | } 246 | 247 | void singly_ll_set_comparison_fn(ll_t *ll, int (*comparison_fn)(void *, void *)){ 248 | 249 | if(!ll) assert(0) ; 250 | ll->comparison_fn = comparison_fn; 251 | } 252 | 253 | void * 254 | singly_ll_search_by_key(ll_t *ll, void *key){ 255 | 256 | assert(ll); 257 | if(!key) 258 | return NULL; 259 | 260 | singly_ll_node_t *list_node = NULL; 261 | ITERATE_LIST(ll, list_node){ 262 | if(ll->comparison_fn(list_node->data, key)) 263 | return list_node->data; 264 | } 265 | return NULL; 266 | } 267 | -------------------------------------------------------------------------------- /LinkedListApi.h: -------------------------------------------------------------------------------- 1 | #ifndef __LINKEDLIST__ 2 | #define __LINKEDLIST__ 3 | 4 | 5 | #define GET_HEAD_SINGLY_LL(ll) (ll->head) 6 | #define INC_NODE_COUNT_SINGLY_LL(ll) (ll->node_count++) 7 | #define DEC_NODE_COUNT_SINGLY_LL(ll) (ll->node_count--) 8 | #define GET_NODE_COUNT_SINGLY_LL(ll) (ll->node_count) 9 | #define GET_NEXT_NODE_SINGLY_LL(node) (node->next) 10 | 11 | typedef enum{ 12 | LL_FALSE, 13 | LL_TRUE 14 | } bool_t; 15 | 16 | typedef struct LL_Node{ 17 | void *data; 18 | struct LL_Node *next; 19 | } singly_ll_node_t; 20 | 21 | typedef struct LL{ 22 | unsigned int node_count; 23 | singly_ll_node_t *head; 24 | int (*comparison_fn)(void*, void *); 25 | } ll_t; 26 | 27 | ll_t* init_singly_ll(); 28 | singly_ll_node_t* singly_ll_init_node(void* data); 29 | int singly_ll_add_node(ll_t *ll, singly_ll_node_t *node); 30 | int singly_ll_add_node_by_val(ll_t *ll, void* data); 31 | int singly_ll_remove_node(ll_t *ll, singly_ll_node_t *node); 32 | unsigned int singly_ll_remove_node_by_value(ll_t *ll, void* data, int size); 33 | bool_t is_singly_ll_empty(ll_t *ll); 34 | void print_singly_LL(ll_t *ll); 35 | void reverse_singly_ll(ll_t *ll); 36 | void delete_singly_ll(ll_t *ll); 37 | int singly_ll_delete_node(ll_t *ll, singly_ll_node_t *node); 38 | unsigned int singly_ll_delete_node_by_value(ll_t *ll, void *data, int size); 39 | singly_ll_node_t *singly_ll_get_node_by_data_ptr(ll_t *ll, void *data); 40 | unsigned int singly_ll_remove_node_by_dataptr(ll_t *ll, void *data); 41 | void singly_ll_set_comparison_fn(ll_t *ll, int (*comparison_fn)(void *, void *)); 42 | void * singly_ll_search_by_key(ll_t *ll, void *key); 43 | 44 | #define ITERATE_LIST(list_ptr, node_ptr) \ 45 | node_ptr = GET_HEAD_SINGLY_LL(list_ptr); \ 46 | for(; node_ptr!= NULL; node_ptr = GET_NEXT_NODE_SINGLY_LL(node_ptr))\ 47 | 48 | #endif 49 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | TARGET:liblist.a exe 2 | liblist.a:LinkedListApi.o 3 | ar rs liblist.a LinkedListApi.o 4 | exe:main.o liblist.a 5 | gcc -g main.o -o exe -L . -llist 6 | LinkedListApi.o:LinkedListApi.c 7 | gcc -g -c -I . LinkedListApi.c -o LinkedListApi.o 8 | main.o:main.c 9 | gcc -g -c -I . main.c -o main.o 10 | clean: 11 | rm *.o 12 | rm exe 13 | rm liblist.a 14 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # DevelopLibrary 2 | Develop a Good Customisable General purpose library in C 3 | -------------------------------------------------------------------------------- /glthreads/Makefile: -------------------------------------------------------------------------------- 1 | LIBNAME=libglthread.a 2 | TARGET:${LIBNAME} exe 3 | ${LIBNAME}:glthread.o 4 | ar rs ${LIBNAME} glthread.o 5 | exe:main.o ${LIBNAME} 6 | gcc -g main.o -o exe -L . -lglthread 7 | glthread.o:glthread.c 8 | gcc -g -c -I . glthread.c -o glthread.o 9 | main.o:main.c 10 | gcc -g -c -I . main.c -o main.o 11 | clean: 12 | rm *.o 13 | rm exe 14 | rm ${LIBNAME} 15 | -------------------------------------------------------------------------------- /glthreads/glthread.c: -------------------------------------------------------------------------------- 1 | #include "glthread.h" 2 | #include 3 | #include 4 | 5 | /*Private function to add a new_node right after curr_node*/ 6 | static void 7 | _glthread_add_next(glthread_node_t *curr_node, 8 | glthread_node_t *new_node){ 9 | 10 | if(!curr_node->right){ 11 | curr_node->right = new_node; 12 | new_node->left = curr_node; 13 | return; 14 | } 15 | 16 | glthread_node_t *temp = curr_node->right; 17 | curr_node->right = new_node; 18 | new_node->left = curr_node; 19 | new_node->right = temp; 20 | temp->left = new_node; 21 | } 22 | 23 | /*Fn to insert a new GLnode into a glthread at the first position 24 | * in a glthread i.e. new node becomes a head 25 | * */ 26 | void 27 | glthread_add (glthread_t *lst, glthread_node_t *glnode){ 28 | 29 | glnode->left = NULL; 30 | glnode->right = NULL; 31 | if(!lst->head){ 32 | lst->head = glnode; 33 | return; 34 | } 35 | glthread_node_t *head = lst->head; 36 | _glthread_add_next(glnode, head); 37 | lst->head = glnode; 38 | } 39 | 40 | static void 41 | _remove_glthread(glthread_node_t *glnode){ 42 | 43 | if(!glnode->left){ 44 | if(glnode->right){ 45 | glnode->right->left = NULL; 46 | glnode->right = 0; 47 | return; 48 | } 49 | return; 50 | } 51 | if(!glnode->right){ 52 | glnode->left->right = NULL; 53 | glnode->left = NULL; 54 | return; 55 | } 56 | 57 | glnode->left->right = glnode->right; 58 | glnode->right->left = glnode->left; 59 | glnode->left = 0; 60 | glnode->right = 0; 61 | } 62 | 63 | /*API to remove a glnode from glthread*/ 64 | void 65 | glthread_remove(glthread_t *lst, glthread_node_t *glnode){ 66 | 67 | glthread_node_t *head = lst->head; 68 | /*If the node being removed is the head node itself, then update the 69 | * head*/ 70 | if(head == glnode){ 71 | lst->head = head->right; 72 | } 73 | _remove_glthread(glnode); 74 | } 75 | 76 | void 77 | init_glthread(glthread_t *glthread, unsigned int offset){ 78 | 79 | glthread->head = NULL; 80 | glthread->offset = offset; 81 | } 82 | -------------------------------------------------------------------------------- /glthreads/glthread.h: -------------------------------------------------------------------------------- 1 | #ifndef __GLTHREADS__ 2 | #define __GLTHREADS__ 3 | 4 | typedef struct glthread_node_ { 5 | 6 | struct glthread_node_ *left; 7 | struct glthread_node_ *right; 8 | } glthread_node_t; 9 | 10 | typedef struct glthread_ { 11 | 12 | glthread_node_t *head; 13 | unsigned int offset; 14 | } glthread_t; 15 | 16 | void 17 | glthread_add (glthread_t *lst, glthread_node_t *glnode); 18 | 19 | void 20 | glthread_remove(glthread_t *lst, glthread_node_t *glnode); 21 | 22 | /*Iterative macro to Iterate Over GLTHhreads*/ 23 | #define ITERATE_GL_THREADS_BEGIN(lstptr, struct_type, ptr) \ 24 | { \ 25 | glthread_node_t *_glnode = NULL, *_next = NULL; \ 26 | for(_glnode = lstptr->head; _glnode; _glnode = _next){ \ 27 | _next = _glnode->right; \ 28 | ptr = (struct_type *)((char *)_glnode - lstptr->offset); 29 | 30 | #define ITERATE_GL_THREADS_ENDS }} 31 | 32 | #define glthread_node_init(glnode) \ 33 | glnode->left = NULL; \ 34 | glnode->right = NULL; 35 | 36 | void 37 | init_glthread(glthread_t *glthread, unsigned int offset); 38 | 39 | #define offsetof(struct_name, field_name) \ 40 | ((unsigned int)&((struct_name *)0)->field_name) 41 | 42 | #endif /* __GLTHREADS__ */ 43 | -------------------------------------------------------------------------------- /glthreads/main.c: -------------------------------------------------------------------------------- 1 | #include "glthread.h" 2 | #include 3 | #include 4 | #include 5 | 6 | typedef struct emp_ { 7 | 8 | char name[30]; 9 | unsigned int salary; 10 | char designation[30]; 11 | unsigned int emp_id; 12 | glthread_node_t glnode; 13 | } emp_t; 14 | 15 | void 16 | print_emp_details(emp_t *emp){ 17 | 18 | printf("Employee name = %s\n", emp->name); 19 | printf("salary = %u\n", emp->salary); 20 | printf("designation = %s\n", emp->designation); 21 | printf("emp_id = %u\n", emp->emp_id); 22 | } 23 | 24 | 25 | int 26 | main(int argc, char **argv){ 27 | 28 | emp_t *emp1 = calloc(1, sizeof(emp_t)); 29 | strncpy(emp1->name, "Neha", strlen("Neha")); 30 | emp1->salary = 50000; 31 | strncpy(emp1->designation, "HR", strlen("HR")); 32 | emp1->emp_id = 21; 33 | glthread_node_init((&emp1->glnode)); 34 | 35 | emp_t *emp2 = calloc(1, sizeof(emp_t)); 36 | strncpy(emp2->name, "Abhishek", strlen("Abhishek")); 37 | emp1->salary = 150000; 38 | strncpy(emp2->designation, "SE3", strlen("SE3")); 39 | emp2->emp_id = 32; 40 | glthread_node_init((&emp2->glnode)); 41 | 42 | emp_t *emp3 = calloc(1, sizeof(emp_t)); 43 | strncpy(emp3->name, "Arun", strlen("Arun")); 44 | emp3->salary = 60000; 45 | strncpy(emp3->designation, "SE4", strlen("SE4")); 46 | emp3->emp_id = 27; 47 | glthread_node_init((&emp3->glnode)); 48 | 49 | 50 | /*Now Create a glthread*/ 51 | glthread_t *emp_list = calloc(1, sizeof(glthread_t)); 52 | init_glthread(emp_list, offsetof(emp_t, glnode)); 53 | 54 | /*Now insert the records in glthread*/ 55 | glthread_add(emp_list, &emp1->glnode); 56 | glthread_add(emp_list, &emp2->glnode); 57 | glthread_add(emp_list, &emp3->glnode); 58 | 59 | 60 | /*Walk over glthread*/ 61 | emp_t *ptr = NULL; 62 | ITERATE_GL_THREADS_BEGIN(emp_list, emp_t, ptr){ 63 | 64 | print_emp_details(ptr); 65 | } ITERATE_GL_THREADS_ENDS; 66 | 67 | /*Let us remove one record at random*/ 68 | 69 | glthread_remove(emp_list, &emp2->glnode); 70 | printf("\nprinting again . . . \n"); 71 | 72 | ITERATE_GL_THREADS_BEGIN(emp_list, emp_t, ptr){ 73 | 74 | print_emp_details(ptr); 75 | } ITERATE_GL_THREADS_ENDS; 76 | 77 | 78 | /*Free all Dynamicall allocations*/ 79 | ITERATE_GL_THREADS_BEGIN(emp_list, emp_t, ptr){ 80 | 81 | glthread_remove(emp_list, &ptr->glnode); 82 | free(ptr); 83 | } ITERATE_GL_THREADS_ENDS; 84 | free(emp_list); 85 | 86 | return 0; 87 | } 88 | -------------------------------------------------------------------------------- /glthreads/main2.c: -------------------------------------------------------------------------------- 1 | #include "glthread.h" 2 | #include 3 | #include 4 | #include 5 | 6 | typedef struct emp_ { 7 | 8 | char name[30]; 9 | unsigned int salary; 10 | char designation[30]; 11 | unsigned int emp_id; 12 | glthread_node_t glnode; 13 | } emp_t; 14 | 15 | void 16 | print_emp_details(emp_t *emp){ 17 | 18 | printf("Employee name = %s\n", emp->name); 19 | printf("salary = %u\n", emp->salary); 20 | printf("designation = %s\n", emp->designation); 21 | printf("emp_id = %u\n", emp->emp_id); 22 | } 23 | 24 | 25 | int 26 | main(int argc, char **argv){ 27 | 28 | emp_t *emp1 = calloc(1, sizeof(emp_t)); 29 | strncpy(emp1->name, "Neha", strlen("Neha")); 30 | emp1->salary = 50000; 31 | strncpy(emp1->designation, "HR", strlen("HR")); 32 | emp1->emp_id = 21; 33 | glthread_node_init((&emp1->glnode)); 34 | 35 | emp_t *emp2 = calloc(1, sizeof(emp_t)); 36 | strncpy(emp2->name, "Abhishek", strlen("Abhishek")); 37 | emp1->salary = 150000; 38 | strncpy(emp2->designation, "SE3", strlen("SE3")); 39 | emp2->emp_id = 32; 40 | glthread_node_init((&emp2->glnode)); 41 | 42 | emp_t *emp3 = calloc(1, sizeof(emp_t)); 43 | strncpy(emp3->name, "Arun", strlen("Arun")); 44 | emp3->salary = 60000; 45 | strncpy(emp3->designation, "SE4", strlen("SE4")); 46 | emp3->emp_id = 27; 47 | glthread_node_init((&emp3->glnode)); 48 | 49 | 50 | /*Now Create a glthread*/ 51 | glthread_t *emp_list = calloc(1, sizeof(glthread_t)); 52 | init_glthread(emp_list, offsetof(emp_t, glnode)); 53 | 54 | /*Now insert the records in glthread*/ 55 | glthread_add(emp_list, &emp1->glnode); 56 | glthread_add(emp_list, &emp2->glnode); 57 | glthread_add(emp_list, &emp3->glnode); 58 | 59 | 60 | /*Walk over glthread*/ 61 | emp_t *ptr = NULL; 62 | ITERATE_GL_THREADS_BEGIN(emp_list, emp_t, ptr){ 63 | 64 | print_emp_details(ptr); 65 | } ITERATE_GL_THREADS_ENDS; 66 | 67 | /*Let us remove one record at random*/ 68 | 69 | glthread_remove(emp_list, &emp2->glnode); 70 | printf("\nprinting again . . . \n"); 71 | 72 | ITERATE_GL_THREADS_BEGIN(emp_list, emp_t, ptr){ 73 | 74 | print_emp_details(ptr); 75 | } ITERATE_GL_THREADS_ENDS; 76 | 77 | 78 | /*Free all Dynamicall allocations*/ 79 | ITERATE_GL_THREADS_BEGIN(emp_list, emp_t, ptr){ 80 | 81 | glthread_remove(emp_list, &ptr->glnode); 82 | free(ptr); 83 | } ITERATE_GL_THREADS_ENDS; 84 | free(emp_list); 85 | 86 | return 0; 87 | } 88 | -------------------------------------------------------------------------------- /main.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include "LinkedListApi.h" 4 | #include 5 | 6 | typedef struct person_{ 7 | 8 | char name[32]; 9 | int age; 10 | int weight; 11 | } person_t; 12 | 13 | int 14 | person_comparison_fn(void *struct_ptr, void *key){ 15 | 16 | person_t *person = (person_t *)struct_ptr; 17 | if(strncmp(person->name, (char *)key, strlen((char *)key)) == 0 && 18 | strlen((char *)key) == strlen(person->name)) 19 | return 1; /*Match*/ 20 | return 0;/*Not Match*/ 21 | } 22 | 23 | void 24 | print_person_details(person_t *outperson){ 25 | 26 | printf("outperson->name = %s\n", outperson->name); 27 | printf("outperson->age = %d\n", outperson->age); 28 | printf("outperson->weight = %d\n", outperson->weight); 29 | } 30 | 31 | int 32 | main(int argc, char **argv){ 33 | 34 | ll_t *person_list = init_singly_ll(); 35 | 36 | /*Register comparison fn*/ 37 | person_list->comparison_fn = person_comparison_fn; 38 | 39 | person_t person1 = {"Ram", 30, 68}; 40 | person_t person2 = {"Vibhor", 31, 70}; 41 | person_t person3 = {"Akshay", 32, 56}; 42 | 43 | singly_ll_add_node_by_val(person_list, &person1); 44 | singly_ll_add_node_by_val(person_list, &person2); 45 | singly_ll_add_node_by_val(person_list, &person3); 46 | 47 | person_t *outperson = NULL; 48 | 49 | printf("\n\nSearching ....\n"); 50 | outperson = (person_t *)singly_ll_search_by_key(person_list, "Ram"); 51 | 52 | print_person_details(outperson); 53 | 54 | printf("\n\n Looping ...\n"); 55 | /*using looping macro to iterare*/ 56 | singly_ll_node_t *list_node = NULL; 57 | 58 | ITERATE_LIST(person_list, list_node){ 59 | 60 | outperson = (person_t *)list_node->data; 61 | print_person_details(outperson); 62 | } 63 | return 0; 64 | } 65 | 66 | --------------------------------------------------------------------------------