├── .gitignore ├── LICENSE ├── Makefile ├── README.md ├── redismodule.h └── rm_graphicsmagick.c /.gitignore: -------------------------------------------------------------------------------- 1 | *.so 2 | *.o 3 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 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 | # find the OS 2 | uname_S := $(shell sh -c 'uname -s 2>/dev/null || echo not') 3 | 4 | # Compile flags for linux / osx 5 | ifeq ($(uname_S),Linux) 6 | SHOBJ_CFLAGS ?= -fno-common -g -ggdb 7 | SHOBJ_LDFLAGS ?= -shared 8 | else 9 | SHOBJ_CFLAGS ?= -dynamic -fno-common -g -ggdb 10 | SHOBJ_LDFLAGS ?= -bundle -undefined dynamic_lookup 11 | endif 12 | CFLAGS = -I/usr/include/GraphicsMagick -Wall -g -fPIC -lc -lm -Og -std=gnu99 13 | CC=gcc 14 | .SUFFIXES: .c .so .xo .o 15 | 16 | all: rm_graphicsmagick.so 17 | 18 | #c.xo: 19 | #$(CC) -I. $(CFLAGS) $(SHOBJ_CFLAGS) -fPIC -c $< -o $@ 20 | 21 | #mdma.xo: ./index.h 22 | 23 | rm_graphicsmagick.so: rm_graphicsmagick.o 24 | $(LD) -o $@ rm_graphicsmagick.o $(SHOBJ_LDFLAGS) $(LIBS) -lGraphicsMagick -lc 25 | 26 | clean: 27 | rm -rf *.xo *.so *.o 28 | 29 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # rm_graphicsmagick: Redis Module wrapping libGraphicsMagick 2 | 3 | Provides (some of) the functionality of the [GraphicsMagick](http://www.graphicsmagick.org) image processing system inside of redis. 4 | Currently very limited functionality is supported more as a POC than anything practical, but it can fairly easily be extended to do whatever "magick" you want. 5 | 6 | ## Building it 7 | 8 | ### Prerequisites 9 | 10 | * libGraphicsMagic.so and header should be installed (ubuntu: apt-get install libgraphicsmagick1-dev), tested with version 1.3.23 11 | 12 | ### Bulding the module 13 | 14 | * in the source folder run `make` 15 | 16 | ## Running it 17 | 18 | * Run `redis-server --loadmodule /rm_graphicsmagick.so` 19 | 20 | ## Image manipulation API 21 | 22 | All commands access a string key containing an image in a format GraphicsMagick can handle (See: http://www.graphicsmagick.org/formats.html). 23 | 24 | ### `GRAPHICSMAGICK.ROTATE key angle` 25 | Rotate image stored in `key` and updates `key` with the result. `angle` is a float value in degrees for rotation. 26 | 27 | **Reply:** String, "OK" on success. Error on error. 28 | 29 | ### `GRAPHICSMAGICK.SWIRL key angle` 30 | 31 | Swirl image stored in `key` and updates `key` with the result. `angle` is a float value in degrees for swirling. 32 | 33 | **Reply:** String, "OK" on success. Error on error. 34 | 35 | ### `GRAPHICSMAGICK.BLUR key radius std_dev` 36 | 37 | Blur image stored in `key` and update `key` with the result. `radius` is the Gaussian radius in pixels, `std_dev` is the standard deviation of the Gaussian. 38 | 39 | **Reply:** String, "OK" on success. Error on error. 40 | 41 | ### `GRAPHICSMAGICK.THUMBNAIL key width height` 42 | 43 | Scale image stored in `key` to given `width` and `height` and updates `key` with the result. 44 | 45 | **Reply:** String, "OK" on success. Error on error. 46 | 47 | ### `GRAPHICSMAGICK.TYPE key` 48 | 49 | Return the format of the image stored in `key` ("PNG", "GIF", etc.). Returns an error if no valid image is stored in `key`. 50 | 51 | **Reply:** String or error. 52 | 53 | ### Python example 54 | ```python 55 | import redis 56 | r = redis.Redis() 57 | with open('/tmp/some_image.png') as f: 58 | r.set('image_key', f.read()) 59 | r.execute_command('GRAPHICSMAGICK.SWIRL', 'image_key', 232.3) 60 | with open('/tmp/swirled_image.png', 'w') as f: 61 | f.write(r.get('image_key')) 62 | ``` 63 | 64 | ## Extending it 65 | 66 | See here for details of GraphicsMagick core API: http://www.graphicsmagick.org/api/api.html 67 | Look at the implementation of the actually commads `GMXXXCommand()` functions and add new ones accordingly. 68 | 69 | There are a million good ideas about what more can be done with this module, here are some: 70 | 71 | * STORE stye commands so key isn't modified. 72 | * Format conversion commands. 73 | * Multi key commands for composing multiple images into new images. 74 | * Profiling performance and finding optimal formats for doing the manipulation including working with RAW formats and perhaps doing the transformantion in place without copying the data. 75 | * ... 76 | 77 | ## License 78 | 79 | see [LICENSE](LICENSE) 80 | -------------------------------------------------------------------------------- /redismodule.h: -------------------------------------------------------------------------------- 1 | #ifndef REDISMODULE_H 2 | #define REDISMODULE_H 3 | 4 | #include 5 | #include 6 | #include 7 | 8 | /* ---------------- Defines common between core and modules --------------- */ 9 | 10 | /* Error status return values. */ 11 | #define REDISMODULE_OK 0 12 | #define REDISMODULE_ERR 1 13 | 14 | /* API versions. */ 15 | #define REDISMODULE_APIVER_1 1 16 | 17 | /* API flags and constants */ 18 | #define REDISMODULE_READ (1<<0) 19 | #define REDISMODULE_WRITE (1<<1) 20 | 21 | #define REDISMODULE_LIST_HEAD 0 22 | #define REDISMODULE_LIST_TAIL 1 23 | 24 | /* Key types. */ 25 | #define REDISMODULE_KEYTYPE_EMPTY 0 26 | #define REDISMODULE_KEYTYPE_STRING 1 27 | #define REDISMODULE_KEYTYPE_LIST 2 28 | #define REDISMODULE_KEYTYPE_HASH 3 29 | #define REDISMODULE_KEYTYPE_SET 4 30 | #define REDISMODULE_KEYTYPE_ZSET 5 31 | 32 | /* Reply types. */ 33 | #define REDISMODULE_REPLY_UNKNOWN -1 34 | #define REDISMODULE_REPLY_STRING 0 35 | #define REDISMODULE_REPLY_ERROR 1 36 | #define REDISMODULE_REPLY_INTEGER 2 37 | #define REDISMODULE_REPLY_ARRAY 3 38 | #define REDISMODULE_REPLY_NULL 4 39 | 40 | /* Postponed array length. */ 41 | #define REDISMODULE_POSTPONED_ARRAY_LEN -1 42 | 43 | /* Expire */ 44 | #define REDISMODULE_NO_EXPIRE -1 45 | 46 | /* Sorted set API flags. */ 47 | #define REDISMODULE_ZADD_XX (1<<0) 48 | #define REDISMODULE_ZADD_NX (1<<1) 49 | #define REDISMODULE_ZADD_ADDED (1<<2) 50 | #define REDISMODULE_ZADD_UPDATED (1<<3) 51 | #define REDISMODULE_ZADD_NOP (1<<4) 52 | 53 | /* Hash API flags. */ 54 | #define REDISMODULE_HASH_NONE 0 55 | #define REDISMODULE_HASH_NX (1<<0) 56 | #define REDISMODULE_HASH_XX (1<<1) 57 | #define REDISMODULE_HASH_CFIELDS (1<<2) 58 | #define REDISMODULE_HASH_EXISTS (1<<3) 59 | 60 | /* A special pointer that we can use between the core and the module to signal 61 | * field deletion, and that is impossible to be a valid pointer. */ 62 | #define REDISMODULE_HASH_DELETE ((RedisModuleString*)(long)1) 63 | 64 | /* Error messages. */ 65 | #define REDISMODULE_ERRORMSG_WRONGTYPE "WRONGTYPE Operation against a key holding the wrong kind of value" 66 | 67 | #define REDISMODULE_POSITIVE_INFINITE (1.0/0.0) 68 | #define REDISMODULE_NEGATIVE_INFINITE (-1.0/0.0) 69 | 70 | /* ------------------------- End of common defines ------------------------ */ 71 | 72 | #ifndef REDISMODULE_CORE 73 | 74 | typedef long long mstime_t; 75 | 76 | /* Incomplete structures for compiler checks but opaque access. */ 77 | typedef struct RedisModuleCtx RedisModuleCtx; 78 | typedef struct RedisModuleKey RedisModuleKey; 79 | typedef struct RedisModuleString RedisModuleString; 80 | typedef struct RedisModuleCallReply RedisModuleCallReply; 81 | 82 | typedef int (*RedisModuleCmdFunc) (RedisModuleCtx *ctx, RedisModuleString **argv, int argc); 83 | 84 | #define REDISMODULE_GET_API(name) \ 85 | RedisModule_GetApi("RedisModule_" #name, ((void **)&RedisModule_ ## name)) 86 | 87 | #define REDISMODULE_API_FUNC(x) (*x) 88 | 89 | int REDISMODULE_API_FUNC(RedisModule_GetApi)(const char *, void *); 90 | int REDISMODULE_API_FUNC(RedisModule_CreateCommand)(RedisModuleCtx *ctx, const char *name, RedisModuleCmdFunc cmdfunc, const char *strflags, int firstkey, int lastkey, int keystep); 91 | int REDISMODULE_API_FUNC(RedisModule_SetModuleAttribs)(RedisModuleCtx *ctx, const char *name, int ver, int apiver); 92 | int REDISMODULE_API_FUNC(RedisModule_WrongArity)(RedisModuleCtx *ctx); 93 | int REDISMODULE_API_FUNC(RedisModule_ReplyWithLongLong)(RedisModuleCtx *ctx, long long ll); 94 | int REDISMODULE_API_FUNC(RedisModule_GetSelectedDb)(RedisModuleCtx *ctx); 95 | int REDISMODULE_API_FUNC(RedisModule_SelectDb)(RedisModuleCtx *ctx, int newid); 96 | void *REDISMODULE_API_FUNC(RedisModule_OpenKey)(RedisModuleCtx *ctx, RedisModuleString *keyname, int mode); 97 | void REDISMODULE_API_FUNC(RedisModule_CloseKey)(RedisModuleKey *kp); 98 | int REDISMODULE_API_FUNC(RedisModule_KeyType)(RedisModuleKey *kp); 99 | size_t REDISMODULE_API_FUNC(RedisModule_ValueLength)(RedisModuleKey *kp); 100 | int REDISMODULE_API_FUNC(RedisModule_ListPush)(RedisModuleKey *kp, int where, RedisModuleString *ele); 101 | RedisModuleString *REDISMODULE_API_FUNC(RedisModule_ListPop)(RedisModuleKey *key, int where); 102 | RedisModuleCallReply *REDISMODULE_API_FUNC(RedisModule_Call)(RedisModuleCtx *ctx, const char *cmdname, const char *fmt, ...); 103 | const char *REDISMODULE_API_FUNC(RedisModule_CallReplyProto)(RedisModuleCallReply *reply, size_t *len); 104 | void REDISMODULE_API_FUNC(RedisModule_FreeCallReply)(RedisModuleCallReply *reply); 105 | int REDISMODULE_API_FUNC(RedisModule_CallReplyType)(RedisModuleCallReply *reply); 106 | long long REDISMODULE_API_FUNC(RedisModule_CallReplyInteger)(RedisModuleCallReply *reply); 107 | size_t REDISMODULE_API_FUNC(RedisModule_CallReplyLength)(RedisModuleCallReply *reply); 108 | RedisModuleCallReply *REDISMODULE_API_FUNC(RedisModule_CallReplyArrayElement)(RedisModuleCallReply *reply, size_t idx); 109 | RedisModuleString *REDISMODULE_API_FUNC(RedisModule_CreateString)(RedisModuleCtx *ctx, const char *ptr, size_t len); 110 | RedisModuleString *REDISMODULE_API_FUNC(RedisModule_CreateStringFromLongLong)(RedisModuleCtx *ctx, long long ll); 111 | void REDISMODULE_API_FUNC(RedisModule_FreeString)(RedisModuleCtx *ctx, RedisModuleString *str); 112 | const char *REDISMODULE_API_FUNC(RedisModule_StringPtrLen)(RedisModuleString *str, size_t *len); 113 | int REDISMODULE_API_FUNC(RedisModule_ReplyWithError)(RedisModuleCtx *ctx, const char *err); 114 | int REDISMODULE_API_FUNC(RedisModule_ReplyWithSimpleString)(RedisModuleCtx *ctx, const char *msg); 115 | int REDISMODULE_API_FUNC(RedisModule_ReplyWithArray)(RedisModuleCtx *ctx, long len); 116 | void REDISMODULE_API_FUNC(RedisModule_ReplySetArrayLength)(RedisModuleCtx *ctx, long len); 117 | int REDISMODULE_API_FUNC(RedisModule_ReplyWithStringBuffer)(RedisModuleCtx *ctx, const char *buf, size_t len); 118 | int REDISMODULE_API_FUNC(RedisModule_ReplyWithString)(RedisModuleCtx *ctx, RedisModuleString *str); 119 | int REDISMODULE_API_FUNC(RedisModule_ReplyWithNull)(RedisModuleCtx *ctx); 120 | int REDISMODULE_API_FUNC(RedisModule_ReplyWithDouble)(RedisModuleCtx *ctx, double d); 121 | int REDISMODULE_API_FUNC(RedisModule_ReplyWithCallReply)(RedisModuleCtx *ctx, RedisModuleCallReply *reply); 122 | int REDISMODULE_API_FUNC(RedisModule_StringToLongLong)(RedisModuleString *str, long long *ll); 123 | int REDISMODULE_API_FUNC(RedisModule_StringToDouble)(RedisModuleString *str, double *d); 124 | void REDISMODULE_API_FUNC(RedisModule_AutoMemory)(RedisModuleCtx *ctx); 125 | int REDISMODULE_API_FUNC(RedisModule_Replicate)(RedisModuleCtx *ctx, const char *cmdname, const char *fmt, ...); 126 | int REDISMODULE_API_FUNC(RedisModule_ReplicateVerbatim)(RedisModuleCtx *ctx); 127 | const char *REDISMODULE_API_FUNC(RedisModule_CallReplyStringPtr)(RedisModuleCallReply *reply, size_t *len); 128 | RedisModuleString *REDISMODULE_API_FUNC(RedisModule_CreateStringFromCallReply)(RedisModuleCallReply *reply); 129 | int REDISMODULE_API_FUNC(RedisModule_DeleteKey)(RedisModuleKey *key); 130 | int REDISMODULE_API_FUNC(RedisModule_StringSet)(RedisModuleKey *key, RedisModuleString *str); 131 | char *REDISMODULE_API_FUNC(RedisModule_StringDMA)(RedisModuleKey *key, size_t *len, int mode); 132 | int REDISMODULE_API_FUNC(RedisModule_StringTruncate)(RedisModuleKey *key, size_t newlen); 133 | mstime_t REDISMODULE_API_FUNC(RedisModule_GetExpire)(RedisModuleKey *key); 134 | int REDISMODULE_API_FUNC(RedisModule_SetExpire)(RedisModuleKey *key, mstime_t expire); 135 | int REDISMODULE_API_FUNC(RedisModule_ZsetAdd)(RedisModuleKey *key, double score, RedisModuleString *ele, int *flagsptr); 136 | int REDISMODULE_API_FUNC(RedisModule_ZsetIncrby)(RedisModuleKey *key, double score, RedisModuleString *ele, int *flagsptr, double *newscore); 137 | int REDISMODULE_API_FUNC(RedisModule_ZsetScore)(RedisModuleKey *key, RedisModuleString *ele, double *score); 138 | int REDISMODULE_API_FUNC(RedisModule_ZsetRem)(RedisModuleKey *key, RedisModuleString *ele, int *deleted); 139 | void REDISMODULE_API_FUNC(RedisModule_ZsetRangeStop)(RedisModuleKey *key); 140 | int REDISMODULE_API_FUNC(RedisModule_ZsetFirstInScoreRange)(RedisModuleKey *key, double min, double max, int minex, int maxex); 141 | int REDISMODULE_API_FUNC(RedisModule_ZsetLastInScoreRange)(RedisModuleKey *key, double min, double max, int minex, int maxex); 142 | int REDISMODULE_API_FUNC(RedisModule_ZsetFirstInLexRange)(RedisModuleKey *key, RedisModuleString *min, RedisModuleString *max); 143 | int REDISMODULE_API_FUNC(RedisModule_ZsetLastInLexRange)(RedisModuleKey *key, RedisModuleString *min, RedisModuleString *max); 144 | RedisModuleString *REDISMODULE_API_FUNC(RedisModule_ZsetRangeCurrentElement)(RedisModuleKey *key, double *score); 145 | int REDISMODULE_API_FUNC(RedisModule_ZsetRangeNext)(RedisModuleKey *key); 146 | int REDISMODULE_API_FUNC(RedisModule_ZsetRangePrev)(RedisModuleKey *key); 147 | int REDISMODULE_API_FUNC(RedisModule_ZsetRangeEndReached)(RedisModuleKey *key); 148 | int REDISMODULE_API_FUNC(RedisModule_HashSet)(RedisModuleKey *key, int flags, ...); 149 | int REDISMODULE_API_FUNC(RedisModule_HashGet)(RedisModuleKey *key, int flags, ...); 150 | int REDISMODULE_API_FUNC(RedisModule_IsKeysPositionRequest)(RedisModuleCtx *ctx); 151 | void REDISMODULE_API_FUNC(RedisModule_KeyAtPos)(RedisModuleCtx *ctx, int pos); 152 | 153 | /* This is included inline inside each Redis module. */ 154 | static int RedisModule_Init(RedisModuleCtx *ctx, const char *name, int ver, int apiver) { 155 | void *getapifuncptr = ((void**)ctx)[0]; 156 | RedisModule_GetApi = (int (*)(const char *, void *)) (unsigned long)getapifuncptr; 157 | REDISMODULE_GET_API(CreateCommand); 158 | REDISMODULE_GET_API(SetModuleAttribs); 159 | REDISMODULE_GET_API(WrongArity); 160 | REDISMODULE_GET_API(ReplyWithLongLong); 161 | REDISMODULE_GET_API(ReplyWithError); 162 | REDISMODULE_GET_API(ReplyWithSimpleString); 163 | REDISMODULE_GET_API(ReplyWithArray); 164 | REDISMODULE_GET_API(ReplySetArrayLength); 165 | REDISMODULE_GET_API(ReplyWithStringBuffer); 166 | REDISMODULE_GET_API(ReplyWithString); 167 | REDISMODULE_GET_API(ReplyWithNull); 168 | REDISMODULE_GET_API(ReplyWithCallReply); 169 | REDISMODULE_GET_API(ReplyWithDouble); 170 | REDISMODULE_GET_API(ReplySetArrayLength); 171 | REDISMODULE_GET_API(GetSelectedDb); 172 | REDISMODULE_GET_API(SelectDb); 173 | REDISMODULE_GET_API(OpenKey); 174 | REDISMODULE_GET_API(CloseKey); 175 | REDISMODULE_GET_API(KeyType); 176 | REDISMODULE_GET_API(ValueLength); 177 | REDISMODULE_GET_API(ListPush); 178 | REDISMODULE_GET_API(ListPop); 179 | REDISMODULE_GET_API(StringToLongLong); 180 | REDISMODULE_GET_API(StringToDouble); 181 | REDISMODULE_GET_API(Call); 182 | REDISMODULE_GET_API(CallReplyProto); 183 | REDISMODULE_GET_API(FreeCallReply); 184 | REDISMODULE_GET_API(CallReplyInteger); 185 | REDISMODULE_GET_API(CallReplyType); 186 | REDISMODULE_GET_API(CallReplyLength); 187 | REDISMODULE_GET_API(CallReplyArrayElement); 188 | REDISMODULE_GET_API(CallReplyStringPtr); 189 | REDISMODULE_GET_API(CreateStringFromCallReply); 190 | REDISMODULE_GET_API(CreateString); 191 | REDISMODULE_GET_API(CreateStringFromLongLong); 192 | REDISMODULE_GET_API(FreeString); 193 | REDISMODULE_GET_API(StringPtrLen); 194 | REDISMODULE_GET_API(AutoMemory); 195 | REDISMODULE_GET_API(Replicate); 196 | REDISMODULE_GET_API(ReplicateVerbatim); 197 | REDISMODULE_GET_API(DeleteKey); 198 | REDISMODULE_GET_API(StringSet); 199 | REDISMODULE_GET_API(StringDMA); 200 | REDISMODULE_GET_API(StringTruncate); 201 | REDISMODULE_GET_API(GetExpire); 202 | REDISMODULE_GET_API(SetExpire); 203 | REDISMODULE_GET_API(ZsetAdd); 204 | REDISMODULE_GET_API(ZsetIncrby); 205 | REDISMODULE_GET_API(ZsetScore); 206 | REDISMODULE_GET_API(ZsetRem); 207 | REDISMODULE_GET_API(ZsetRangeStop); 208 | REDISMODULE_GET_API(ZsetFirstInScoreRange); 209 | REDISMODULE_GET_API(ZsetLastInScoreRange); 210 | REDISMODULE_GET_API(ZsetFirstInLexRange); 211 | REDISMODULE_GET_API(ZsetLastInLexRange); 212 | REDISMODULE_GET_API(ZsetRangeCurrentElement); 213 | REDISMODULE_GET_API(ZsetRangeNext); 214 | REDISMODULE_GET_API(ZsetRangePrev); 215 | REDISMODULE_GET_API(ZsetRangeEndReached); 216 | REDISMODULE_GET_API(HashSet); 217 | REDISMODULE_GET_API(HashGet); 218 | REDISMODULE_GET_API(IsKeysPositionRequest); 219 | REDISMODULE_GET_API(KeyAtPos); 220 | 221 | RedisModule_SetModuleAttribs(ctx,name,ver,apiver); 222 | return REDISMODULE_OK; 223 | } 224 | 225 | #else 226 | 227 | /* Things only defined for the modules core, not exported to modules 228 | * including this file. */ 229 | #define RedisModuleString robj 230 | 231 | #endif /* REDISMODULE_CORE */ 232 | #endif /* REDISMOUDLE_H */ 233 | -------------------------------------------------------------------------------- /rm_graphicsmagick.c: -------------------------------------------------------------------------------- 1 | #include "redismodule.h" 2 | 3 | #include 4 | #include 5 | 6 | static char gm_err_str[100]; 7 | static void GMErrorHandler(const ExceptionType severity, const char *reason, const char *description) { 8 | snprintf(gm_err_str, sizeof(gm_err_str), "GraphicsMagick error %d, %s: %s", severity, reason, description); 9 | } 10 | 11 | static void GMExceptionReply(RedisModuleCtx *ctx, ExceptionInfo *ex, const char* default_msg) { 12 | gm_err_str[0] = '\0'; 13 | CatchException(ex); 14 | if (gm_err_str[0]) 15 | RedisModule_ReplyWithError(ctx, gm_err_str); 16 | else if (default_msg) { 17 | snprintf(gm_err_str, sizeof(gm_err_str), "GraphicsMagick error %s", default_msg); 18 | RedisModule_ReplyWithError(ctx, gm_err_str); 19 | } 20 | else 21 | RedisModule_ReplyWithError(ctx, "GraphicsMagick error"); 22 | } 23 | 24 | typedef struct { 25 | RedisModuleKey *key; 26 | Image *org_img, *transformed_img; 27 | ImageInfo *ii; 28 | ExceptionInfo gm_exception; 29 | } ImageTransforCtx; 30 | 31 | static void CleanupImageTransformCtx(ImageTransforCtx *img_tr_ctx) { 32 | if (img_tr_ctx->ii) 33 | DestroyImageInfo(img_tr_ctx->ii); 34 | if (img_tr_ctx->org_img) 35 | DestroyImage(img_tr_ctx->org_img); 36 | if (img_tr_ctx->transformed_img) 37 | DestroyImage(img_tr_ctx->transformed_img); 38 | 39 | DestroyExceptionInfo(&img_tr_ctx->gm_exception); 40 | 41 | memset(img_tr_ctx, 0, sizeof(ImageTransforCtx)); 42 | } 43 | 44 | static int GetImageToTransform(RedisModuleCtx *ctx, RedisModuleString *img_key, ImageTransforCtx *img_tr_ctx) { 45 | memset(img_tr_ctx, 0, sizeof(ImageTransforCtx)); // Init img_tr_ctx 46 | 47 | // open the key 48 | img_tr_ctx->key = RedisModule_OpenKey(ctx, img_key, REDISMODULE_READ | REDISMODULE_WRITE); 49 | 50 | // If key doesn't exist then return immediately 51 | if (RedisModule_KeyType(img_tr_ctx->key) == REDISMODULE_KEYTYPE_EMPTY) { 52 | RedisModule_ReplyWithSimpleString(ctx, "OK"); 53 | return REDISMODULE_ERR; // We return REDISMODULE_ERR so caller knows there's no point in continuing 54 | } 55 | 56 | // Validate key is a string 57 | if (RedisModule_KeyType(img_tr_ctx->key) != REDISMODULE_KEYTYPE_STRING) { 58 | RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE); 59 | return REDISMODULE_ERR; 60 | } 61 | 62 | // Generic GM setup 63 | img_tr_ctx->ii = CloneImageInfo(NULL); 64 | GetExceptionInfo(&img_tr_ctx->gm_exception); 65 | 66 | // Get access to the image 67 | size_t key_len; 68 | char *buf = RedisModule_StringDMA(img_tr_ctx->key, &key_len, REDISMODULE_READ); 69 | if (!buf) { 70 | RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE); 71 | goto err; 72 | } 73 | 74 | // Read the source image 75 | img_tr_ctx->org_img = BlobToImage(img_tr_ctx->ii, buf, key_len, &img_tr_ctx->gm_exception); 76 | if (!img_tr_ctx->org_img) { 77 | GMExceptionReply(ctx, &img_tr_ctx->gm_exception, "bad input image"); 78 | goto err; 79 | } 80 | 81 | return REDISMODULE_OK; 82 | 83 | err: 84 | // Cleanup on error 85 | CleanupImageTransformCtx(img_tr_ctx); 86 | 87 | return REDISMODULE_ERR; 88 | } 89 | 90 | static int UpdateTransformedImage(RedisModuleCtx *ctx, ImageTransforCtx *img_tr_ctx) { 91 | int res = REDISMODULE_ERR; 92 | 93 | // Get memory blob of transformed image 94 | size_t key_len; 95 | void *transformed_blob = ImageToBlob(img_tr_ctx->ii, img_tr_ctx->transformed_img, &key_len, &img_tr_ctx->gm_exception); 96 | if (!transformed_blob) { 97 | GMExceptionReply(ctx, &img_tr_ctx->gm_exception, NULL); 98 | goto err; 99 | } 100 | 101 | // Resize the key to contain the transformed image buffer 102 | if (RedisModule_StringTruncate(img_tr_ctx->key, key_len) == REDISMODULE_ERR) { 103 | RedisModule_ReplyWithError(ctx, "Error resizing string key"); 104 | goto err; 105 | } 106 | 107 | // Get write access to the resized key 108 | char *buf = RedisModule_StringDMA(img_tr_ctx->key, &key_len, REDISMODULE_WRITE); 109 | if (!buf) { 110 | RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE); 111 | goto err; 112 | } 113 | 114 | // Write transformed blob to output 115 | memcpy(buf, transformed_blob, key_len); 116 | 117 | // Setup success reply 118 | RedisModule_ReplyWithSimpleString(ctx, "OK"); 119 | res = REDISMODULE_OK; 120 | 121 | err: 122 | CleanupImageTransformCtx(img_tr_ctx); 123 | return res; 124 | } 125 | 126 | int GMRotateCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) { 127 | if (argc != 3) { 128 | return RedisModule_WrongArity(ctx); 129 | } 130 | 131 | // init auto memory for created strings 132 | RedisModule_AutoMemory(ctx); 133 | 134 | // Validate input is valid float 135 | double degrees; 136 | if (RedisModule_StringToDouble(argv[2], °rees) == REDISMODULE_ERR) { 137 | RedisModule_ReplyWithError(ctx, "Invalid arguments"); 138 | return REDISMODULE_ERR; 139 | } 140 | 141 | // Setup transformation context 142 | ImageTransforCtx img_tr_ctx; 143 | if (GetImageToTransform(ctx, argv[1], &img_tr_ctx) == REDISMODULE_ERR) 144 | return REDISMODULE_ERR; 145 | 146 | // Rotate original image 147 | img_tr_ctx.transformed_img = RotateImage(img_tr_ctx.org_img, degrees, &img_tr_ctx.gm_exception); 148 | if (!img_tr_ctx.transformed_img) { 149 | GMExceptionReply(ctx, &img_tr_ctx.gm_exception, NULL); 150 | goto err; 151 | } 152 | 153 | // Update key and finalize the transformation contex 154 | if (UpdateTransformedImage(ctx, &img_tr_ctx) == REDISMODULE_ERR) 155 | goto err; 156 | 157 | return REDISMODULE_OK; 158 | 159 | err: 160 | CleanupImageTransformCtx(&img_tr_ctx); 161 | return REDISMODULE_ERR; 162 | } 163 | 164 | int GMSwirlCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) { 165 | if (argc != 3) { 166 | return RedisModule_WrongArity(ctx); 167 | } 168 | 169 | // init auto memory for created strings 170 | RedisModule_AutoMemory(ctx); 171 | 172 | // Validate input is valid float 173 | double degrees; 174 | if (RedisModule_StringToDouble(argv[2], °rees) == REDISMODULE_ERR) { 175 | RedisModule_ReplyWithError(ctx, "Invalid arguments"); 176 | return REDISMODULE_ERR; 177 | } 178 | 179 | // Setup transformation context 180 | ImageTransforCtx img_tr_ctx; 181 | if (GetImageToTransform(ctx, argv[1], &img_tr_ctx) == REDISMODULE_ERR) 182 | return REDISMODULE_ERR; 183 | 184 | // Swirl it 185 | img_tr_ctx.transformed_img = SwirlImage(img_tr_ctx.org_img, degrees, &img_tr_ctx.gm_exception); 186 | if (!img_tr_ctx.transformed_img) { 187 | GMExceptionReply(ctx, &img_tr_ctx.gm_exception, NULL); 188 | goto err; 189 | } 190 | 191 | // Update key and finalize the transformation contex 192 | if (UpdateTransformedImage(ctx, &img_tr_ctx) == REDISMODULE_ERR) 193 | goto err; 194 | 195 | return REDISMODULE_OK; 196 | 197 | err: 198 | CleanupImageTransformCtx(&img_tr_ctx); 199 | return REDISMODULE_ERR; 200 | } 201 | 202 | int GMBlurCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) { 203 | if (argc != 4) { 204 | return RedisModule_WrongArity(ctx); 205 | } 206 | 207 | // init auto memory for created strings 208 | RedisModule_AutoMemory(ctx); 209 | 210 | // Validate inputs are valid floats 211 | double radius; 212 | if (RedisModule_StringToDouble(argv[2], &radius) == REDISMODULE_ERR) { 213 | RedisModule_ReplyWithError(ctx, "Invalid arguments"); 214 | return REDISMODULE_ERR; 215 | } 216 | double sigma; 217 | if (RedisModule_StringToDouble(argv[3], &sigma) == REDISMODULE_ERR) { 218 | RedisModule_ReplyWithError(ctx, "Invalid arguments"); 219 | return REDISMODULE_ERR; 220 | } 221 | 222 | // Setup transformation context 223 | ImageTransforCtx img_tr_ctx; 224 | if (GetImageToTransform(ctx, argv[1], &img_tr_ctx) == REDISMODULE_ERR) 225 | return REDISMODULE_ERR; 226 | 227 | // Blur it 228 | img_tr_ctx.transformed_img = BlurImage(img_tr_ctx.org_img, radius, sigma, &img_tr_ctx.gm_exception); 229 | if (!img_tr_ctx.transformed_img) { 230 | GMExceptionReply(ctx, &img_tr_ctx.gm_exception, NULL); 231 | goto err; 232 | } 233 | 234 | // Update key and finalize the transformation contex 235 | if (UpdateTransformedImage(ctx, &img_tr_ctx) == REDISMODULE_ERR) 236 | goto err; 237 | 238 | return REDISMODULE_OK; 239 | 240 | err: 241 | CleanupImageTransformCtx(&img_tr_ctx); 242 | return REDISMODULE_ERR; 243 | } 244 | 245 | int GMThumbnailCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) { 246 | if (argc != 4) { 247 | return RedisModule_WrongArity(ctx); 248 | } 249 | 250 | // init auto memory for created strings 251 | RedisModule_AutoMemory(ctx); 252 | 253 | // Validate inputs are valid unsigned ints 254 | long long width; 255 | if (RedisModule_StringToLongLong(argv[2], &width) == REDISMODULE_ERR || width <= 0) { 256 | RedisModule_ReplyWithError(ctx, "Invalid arguments"); 257 | return REDISMODULE_ERR; 258 | } 259 | long long height; 260 | if (RedisModule_StringToLongLong(argv[3], &height) == REDISMODULE_ERR || height <= 0) { 261 | RedisModule_ReplyWithError(ctx, "Invalid arguments"); 262 | return REDISMODULE_ERR; 263 | } 264 | 265 | // Setup transformation context 266 | ImageTransforCtx img_tr_ctx; 267 | if (GetImageToTransform(ctx, argv[1], &img_tr_ctx) == REDISMODULE_ERR) 268 | return REDISMODULE_ERR; 269 | 270 | // Generate thumbnail 271 | img_tr_ctx.transformed_img = ThumbnailImage(img_tr_ctx.org_img, (unsigned long)width, (unsigned long)height, &img_tr_ctx.gm_exception); 272 | if (!img_tr_ctx.transformed_img) { 273 | GMExceptionReply(ctx, &img_tr_ctx.gm_exception, NULL); 274 | goto err; 275 | } 276 | 277 | // Update key and finalize the transformation contex 278 | if (UpdateTransformedImage(ctx, &img_tr_ctx) == REDISMODULE_ERR) 279 | goto err; 280 | 281 | return REDISMODULE_OK; 282 | 283 | err: 284 | CleanupImageTransformCtx(&img_tr_ctx); 285 | return REDISMODULE_ERR; 286 | } 287 | 288 | int GMGetTypeCommand(RedisModuleCtx *ctx, RedisModuleString **argv, int argc) { 289 | int res = REDISMODULE_ERR; 290 | 291 | if (argc != 2) { 292 | return RedisModule_WrongArity(ctx); 293 | } 294 | 295 | // init auto memory for created strings 296 | RedisModule_AutoMemory(ctx); 297 | 298 | RedisModuleKey *key; 299 | Image *img = NULL; 300 | ImageInfo *ii = NULL; 301 | ExceptionInfo gm_exception; 302 | 303 | // open the key 304 | key = RedisModule_OpenKey(ctx, argv[1], REDISMODULE_READ); 305 | 306 | // If key doesn't exist then return immediately 307 | if (RedisModule_KeyType(key) == REDISMODULE_KEYTYPE_EMPTY) { 308 | RedisModule_ReplyWithError(ctx, "empty key"); 309 | return REDISMODULE_OK; 310 | } 311 | 312 | // Validate key is a string 313 | if (RedisModule_KeyType(key) != REDISMODULE_KEYTYPE_STRING) { 314 | RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE); 315 | return REDISMODULE_ERR; 316 | } 317 | 318 | // Generic GM setup 319 | ii = CloneImageInfo(NULL); 320 | GetExceptionInfo(&gm_exception); 321 | 322 | // Get access to the image 323 | size_t key_len; 324 | char *buf = RedisModule_StringDMA(key, &key_len, REDISMODULE_READ); 325 | if (!buf) { 326 | RedisModule_ReplyWithError(ctx, REDISMODULE_ERRORMSG_WRONGTYPE); 327 | goto err; 328 | } 329 | 330 | // Read the source image 331 | img = PingBlob(ii, buf, key_len, &gm_exception); 332 | if (!img) { 333 | GMExceptionReply(ctx, &gm_exception, "unknown image format"); 334 | goto err; 335 | } 336 | 337 | RedisModule_ReplyWithSimpleString(ctx, img->magick); 338 | 339 | res = REDISMODULE_OK; 340 | 341 | err: 342 | if (ii) 343 | DestroyImageInfo(ii); 344 | if (img) 345 | DestroyImage(img); 346 | DestroyExceptionInfo(&gm_exception); 347 | 348 | return res; 349 | } 350 | 351 | int RedisModule_OnLoad(RedisModuleCtx *ctx) { 352 | 353 | // Register the module itself 354 | if (RedisModule_Init(ctx, "graphicsmagick", 1, REDISMODULE_APIVER_1) == REDISMODULE_ERR) { 355 | return REDISMODULE_ERR; 356 | } 357 | 358 | // Register the commands 359 | if (RedisModule_CreateCommand(ctx, "GRAPHICSMAGICK.ROTATE", GMRotateCommand, "write", 1, 1, 1) == REDISMODULE_ERR) { 360 | return REDISMODULE_ERR; 361 | } 362 | 363 | if (RedisModule_CreateCommand(ctx, "GRAPHICSMAGICK.SWIRL", GMSwirlCommand, "write", 1, 1, 1) == REDISMODULE_ERR) { 364 | return REDISMODULE_ERR; 365 | } 366 | 367 | if (RedisModule_CreateCommand(ctx, "GRAPHICSMAGICK.BLUR", GMBlurCommand, "write", 1, 1, 1) == REDISMODULE_ERR) { 368 | return REDISMODULE_ERR; 369 | } 370 | 371 | if (RedisModule_CreateCommand(ctx, "GRAPHICSMAGICK.THUMBNAIL", GMThumbnailCommand, "write", 1, 1, 1) == REDISMODULE_ERR) { 372 | return REDISMODULE_ERR; 373 | } 374 | 375 | if (RedisModule_CreateCommand(ctx, "GRAPHICSMAGICK.TYPE", GMGetTypeCommand, "readonly", 1, 1, 1) == REDISMODULE_ERR) { 376 | return REDISMODULE_ERR; 377 | } 378 | 379 | // Do this last so if we fail earlier we don't need to cleanup 380 | InitializeMagick(NULL); //TODO: when should I call the de-init: DestroyMagick() ?? 381 | SetErrorHandler(GMErrorHandler); 382 | SetFatalErrorHandler(GMErrorHandler); 383 | 384 | return REDISMODULE_OK; 385 | } --------------------------------------------------------------------------------