pax_global_header00006660000000000000000000000064132230201070014500gustar00rootroot0000000000000052 comment=c4c56cadf9e0904b948ea00a6a37cf46c185aaa3 orcania-1.1.1/000077500000000000000000000000001322302010700131145ustar00rootroot00000000000000orcania-1.1.1/.gitignore000066400000000000000000000001011322302010700150740ustar00rootroot00000000000000*.o *.so *.so.* *.a str_test split_test memory_test jansson_test orcania-1.1.1/LICENSE000066400000000000000000000635351322302010700141350ustar00rootroot00000000000000 GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. (This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.) Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. {description} Copyright (C) {year} {fullname} This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. {signature of Ty Coon}, 1 April 1990 Ty Coon, President of Vice That's all there is to it! orcania-1.1.1/Makefile000066400000000000000000000015221322302010700145540ustar00rootroot00000000000000# # Orcania Framework # # Makefile used to build all programs # # Copyright 2017 Nicolas Mora # # This program is free software; you can redistribute it and/or # modify it under the terms of the MIT License # # This library is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. # LIBORCANIA_LOCATION=./src TESTS_LOCATION=./test all: liborcania.so debug: cd $(LIBORCANIA_LOCATION) && $(MAKE) debug clean: cd $(LIBORCANIA_LOCATION) && $(MAKE) clean cd $(TESTS_LOCATION) && $(MAKE) clean run_test: cd $(TESTS_LOCATION) && $(MAKE) test install: cd $(LIBORCANIA_LOCATION) && $(MAKE) install uninstall: cd $(LIBORCANIA_LOCATION) && $(MAKE) uninstall liborcania.so: cd $(LIBORCANIA_LOCATION) && $(MAKE) orcania-1.1.1/README.md000066400000000000000000000040371322302010700143770ustar00rootroot00000000000000# Orcania Potluck with different functions for different purposes that can be shared among c programs Used for my other projects. ## Installation ### Debian-ish packages [![Packaging status](https://repology.org/badge/vertical-allrepos/orcania.svg)](https://repology.org/metapackage/orcania) Orcania is now available in Debian Buster (testing) and some Debian based distributions. To install it on your device, use the following command as root: ```shell # apt install liborcania-dev # Or apt install liborcania1.1 if you don't need the development files ``` ### Manual install #### Prerequisites You need [Jansson library](http://www.digip.org/jansson/) in order to install Orcania. On a Debain based distribution, simply run the following command: ```shell $ sudo apt-get install libjansson-dev ``` If you don't want `libjansson` specific functions, you can skip it with the build option `JANSSONFLAG=-DU_DISABLE_JANSSON` ``` $ cd src $ make JANSSONFLAG=-DU_DISABLE_JANSSON ``` #### Install Orcania library Download Orcania source code from Github, compile and install: ```shell $ git clone https://github.com/babelouest/orcania.git $ cd orcania/src $ make && sudo make install ``` ##### Install in a different directory To install Orcania library on a dfferent library, use a different $(PREFIX) value during install. Example: install orcania in /tmp/lib directory ```shell $ cd src $ make && make PREFIX=/tmp install ``` You can install Orcania without root permission if your user has write access to `$(PREFIX)`. A `ldconfig` command is executed at the end of the install, it will probably fail if you don't have root permission, but this is harmless. If you choose to install Orcania in another directory, you must set your environment variable `LD_LIBRARY_PATH` properly. ##### Install as a static archive To install Orcania library as a static archive, `liborcania.a`, use the make commands `make static*`: ```shell $ cd src $ make static && sudo make static-install # or make PREFIX=/tmp static-install if you want to install in `/tmp/lib` ``` orcania-1.1.1/src/000077500000000000000000000000001322302010700137035ustar00rootroot00000000000000orcania-1.1.1/src/Makefile000066400000000000000000000036771322302010700153600ustar00rootroot00000000000000# # Ulfius Framework # # Makefile used to build the software # # Copyright 2014-2017 Nicolas Mora # # This program is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public License # as published by the Free Software Foundation; # version 2.1 of the License. # # This library is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU GENERAL PUBLIC LICENSE for more details. # # You should have received a copy of the GNU General Public # License along with this library. If not, see . # PREFIX=/usr/local CC=gcc CFLAGS=-c -fPIC -Wall -D_REENTRANT $(ADDITIONALFLAGS) $(JANSSONFLAG) OUTPUT=liborcania.so VERSION=1.1.1 ifndef JANSSONFLAG LJANSSON=-ljansson endif LIBS=-lc $(LJANSSON) all: release liborcania.so: memory.o orcania.o base64.o $(CC) -shared -Wl,-soname,$(OUTPUT) -o $(OUTPUT).$(VERSION) orcania.o memory.o base64.o $(LIBS) ln -sf $(OUTPUT).$(VERSION) $(OUTPUT) liborcania.a: memory.o orcania.o base64.o ar rcs liborcania.a memory.o orcania.o base64.o orcania.o: orcania.h orcania.c $(CC) $(CFLAGS) orcania.c memory.o: orcania.h memory.c $(CC) $(CFLAGS) memory.c base64.o: orcania.h base64.c $(CC) $(CFLAGS) base64.c clean: rm -f *.o *.so *.a $(OUTPUT) $(OUTPUT).* install: all cp $(OUTPUT).$(VERSION) $(PREFIX)/lib cp orcania.h $(PREFIX)/include -ldconfig static-install: static cp liborcania.a $(PREFIX)/lib cp orcania.h $(PREFIX)/include uninstall: rm -f $(PREFIX)/lib/$(OUTPUT) $(PREFIX)/lib/liborcania.a rm -f $(PREFIX)/lib/$(OUTPUT).* rm -f $(PREFIX)/include/orcania.h debug: ADDITIONALFLAGS=-DDEBUG -g -O0 debug: liborcania.so release: ADDITIONALFLAGS=-O3 release: liborcania.so static-debug: ADDITIONALFLAGS=-DDEBUG -g -O0 static-debug: liborcania.a static: ADDITIONALFLAGS=-O3 static: liborcania.a orcania-1.1.1/src/base64.c000066400000000000000000000061271322302010700151410ustar00rootroot00000000000000/* * Base64 encoding/decoding (RFC1341) * Copyright (c) 2005-2011, Jouni Malinen * Copyright (c) 2017, Nicolas Mora * * This software may be distributed under the terms of the BSD license. */ #include #include "orcania.h" static const unsigned char base64_table[65] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; /** * o_base64_encode - Base64 encode * @src: Data to be encoded * @len: Length of the data to be encoded * @out: Pointer to output variable * @out_len: Pointer to output length variable * Returns: 1 on success, 0 on failure * * The nul terminator is not included in out_len. */ int o_base64_encode(const unsigned char * src, size_t len, unsigned char * out, size_t * out_len) { unsigned char * pos; const unsigned char * end, * in; size_t olen; int line_len; olen = len * 4 / 3 + 4; /* 3-byte blocks to 4-byte */ olen += olen / 72; /* line feeds */ olen++; /* nul termination */ if (olen < len || src == NULL || out == NULL) { return 0; } end = src + len; in = src; pos = out; line_len = 0; while (end - in >= 3) { *pos++ = base64_table[in[0] >> 2]; *pos++ = base64_table[((in[0] & 0x03) << 4) | (in[1] >> 4)]; *pos++ = base64_table[((in[1] & 0x0f) << 2) | (in[2] >> 6)]; *pos++ = base64_table[in[2] & 0x3f]; in += 3; line_len += 4; if (line_len >= 72) { line_len = 0; } } if (end - in) { *pos++ = base64_table[in[0] >> 2]; if (end - in == 1) { *pos++ = base64_table[(in[0] & 0x03) << 4]; *pos++ = '='; } else { *pos++ = base64_table[((in[0] & 0x03) << 4) | (in[1] >> 4)]; *pos++ = base64_table[(in[1] & 0x0f) << 2]; } *pos++ = '='; line_len += 4; } *pos = '\0'; if (out_len) { *out_len = pos - out; } return 1; } /** * o_base64_decode - Base64 decode * @src: Data to be decoded * @len: Length of the data to be decoded * @out: Pointer to output variable * @out_len: Pointer to output length variable * Returns: 1 on success, 0 on failure * * The nul terminator is not included in out_len. */ int o_base64_decode(const unsigned char *src, size_t len, unsigned char * out, size_t * out_len) { unsigned char dtable[256], *pos = out, block[4], tmp; size_t i, count; int pad = 0; memset(dtable, 0x80, 256); for (i = 0; i < sizeof(base64_table) - 1; i++) { dtable[base64_table[i]] = (unsigned char) i; } dtable['='] = 0; count = 0; for (i = 0; i < len; i++) { if (dtable[src[i]] != 0x80) { count++; } } if (count == 0 || count % 4 || src == NULL || out == NULL) { return 0; } count = 0; for (i = 0; i < len; i++) { tmp = dtable[src[i]]; if (tmp == 0x80) { continue; } if (src[i] == '=') { pad++; } block[count] = tmp; count++; if (count == 4) { *pos++ = (block[0] << 2) | (block[1] >> 4); *pos++ = (block[1] << 4) | (block[2] >> 2); *pos++ = (block[2] << 6) | block[3]; count = 0; if (pad) { if (pad == 1) { pos--; } else if (pad == 2) { pos -= 2; } else { /* Invalid padding */ return 0; } break; } } } *out_len = pos - out; return 1; } orcania-1.1.1/src/memory.c000066400000000000000000000025501322302010700153610ustar00rootroot00000000000000/* * Copyright (c) 2017 Nicolas Mora * Copyright (c) 2009-2014 Petri Lehtinen * Copyright (c) 2011-2012 Basile Starynkevitch * * Inspired by jansson memory.c * Jansson is free software; you can redistribute it and/or modify it * under the terms of the MIT license. See LICENSE for details. */ #include #include "orcania.h" /* memory function pointers */ static o_malloc_t do_malloc = malloc; static o_realloc_t do_realloc = realloc; static o_free_t do_free = free; void * o_malloc(size_t size) { if (!size) { return NULL; } else { return (*do_malloc)(size); } } void * o_realloc(void * ptr, size_t size) { if (!size) { return NULL; } else { return (*do_realloc)(ptr, size); } } void o_free(void * ptr) { if (ptr == NULL) { return; } else { (*do_free)(ptr); } } void o_set_alloc_funcs(o_malloc_t malloc_fn, o_realloc_t realloc_fn, o_free_t free_fn) { do_malloc = malloc_fn; do_realloc = realloc_fn; do_free = free_fn; #ifndef U_DISABLE_JANSSON json_set_alloc_funcs(malloc_fn, free_fn); #endif } void o_get_alloc_funcs(o_malloc_t * malloc_fn, o_realloc_t * realloc_fn, o_free_t * free_fn) { if (malloc_fn) { *malloc_fn = do_malloc; } if (realloc_fn) { *realloc_fn = do_realloc; } if (free_fn) { *free_fn = do_free; } } orcania-1.1.1/src/orcania.c000066400000000000000000000327111322302010700154670ustar00rootroot00000000000000#define _GNU_SOURCE #include #include #include #include #include "orcania.h" /** * * Orcania library * * Different functions for different purposes but that can be shared between * other projects * */ /** * char * str_replace(const char * source, char * str_old, char * str_new) * replace all occurences of str_old by str_new in the string source * return a char * with the str_new value * return NULL on error * returned value must be free'd after use */ char * str_replace(const char * source, const char * str_old, const char * str_new) { char * to_return, * ptr, * pre, * next; size_t len, pre_len; if (source == NULL || str_old == NULL || str_new == NULL) { return NULL; } ptr = strstr(source, str_old); if (ptr == NULL) { return o_strdup(source); } else { pre_len = ptr-source; pre = o_malloc((pre_len+1)*sizeof(char)); if (pre == NULL) { return NULL; } memcpy(pre, source, pre_len); pre[pre_len] = '\0'; next = str_replace(source+strlen(pre)+strlen(str_old), str_old, str_new); if (next == NULL) { o_free(pre); return NULL; } len = ((ptr-source)+strlen(str_new)+strlen(next)); to_return = o_malloc((len+1)*sizeof(char)); if (to_return == NULL) { o_free(pre); o_free(next); return NULL; } if (snprintf(to_return, (len+1), "%s%s%s", pre, str_new, next) < 0) { o_free(pre); o_free(next); o_free(to_return); return NULL; } o_free(pre); o_free(next); return to_return; } } /** * char * msprintf(const char * message, ...) * Implementation of sprintf that return a malloc'd char * with the string construction * because life is too short to use 3 lines instead of 1 * but don't forget to free the returned value after use! */ char * msprintf(const char * message, ...) { va_list argp, argp_cpy; size_t out_len = 0; char * out = NULL; if (message != NULL) { va_start(argp, message); va_copy(argp_cpy, argp); // We make a copy because in some architectures, vsnprintf can modify argp out_len = vsnprintf(NULL, 0, message, argp); out = o_malloc(out_len+sizeof(char)); if (out == NULL) { return NULL; } vsnprintf(out, (out_len+sizeof(char)), message, argp_cpy); va_end(argp); va_end(argp_cpy); } return out; } /** * o_strdup * a modified strdup function that don't crash when source is NULL, instead return NULL * Returned value must be free'd after use */ char * o_strdup(const char * source) { return (source==NULL?NULL:o_strndup(source, strlen(source))); } /** * o_strndup * a modified strndup function that don't crash when source is NULL, instead return NULL * Returned value must be free'd after use */ char * o_strndup(const char * source, size_t len) { char *new_str; if (source == NULL || len < 0) { return NULL; } else { new_str = o_malloc(len + 1); if(!new_str) { return NULL; } memcpy(new_str, source, len); new_str[len] = '\0'; return new_str; } } /** * o_strcmp * a modified strcmp function that don't crash when p1 is NULL or p2 us NULL */ int o_strcmp(const char * p1, const char * p2) { if (p1 == NULL && p2 == NULL) { return 0; } else if (p1 != NULL && p2 == NULL) { return -1; } else if (p1 == NULL && p2 != NULL) { return 1; } else { return strcmp(p1, p2); } } /** * o_strncmp * a modified strncmp function that don't crash when p1 is NULL or p2 us NULL */ int o_strncmp(const char * p1, const char * p2, size_t n) { if ((p1 == NULL && p2 == NULL) || n <= 0) { return 0; } else if (p1 != NULL && p2 == NULL) { return -1; } else if (p1 == NULL && p2 != NULL) { return 1; } else { return strncmp(p1, p2, n); } } /** * o_strcpy * a modified strcpy function that don't crash when p1 is NULL or p2 us NULL */ char * o_strcpy(char * p1, const char * p2) { if (p1 == NULL || p2 == NULL) { return NULL; } else { return strcpy(p1, p2); } } /** * o_strncpy * a modified strncpy function that don't crash when p1 is NULL or p2 us NULL */ char * o_strncpy(char * p1, const char * p2, size_t n) { if (p1 == NULL || p2 == NULL) { return NULL; } else { return strncpy(p1, p2, n); } } /** * o_strcasecmp * a modified strcasecmp function that don't crash when p1 is NULL or p2 us NULL */ int o_strcasecmp(const char * p1, const char * p2) { if (p1 == NULL && p2 == NULL) { return 0; } else if (p1 != NULL && p2 == NULL) { return -1; } else if (p1 == NULL && p2 != NULL) { return 1; } else { return strcasecmp(p1, p2); } } /** * o_strncasecmp * a modified strncasecmp function that don't crash when p1 is NULL or p2 us NULL */ int o_strncasecmp(const char * p1, const char * p2, size_t n) { if ((p1 == NULL && p2 == NULL) || n <= 0) { return 0; } else if (p1 != NULL && p2 == NULL) { return -1; } else if (p1 == NULL && p2 != NULL) { return 1; } else { return strncasecmp(p1, p2, n); } } /** * o_strstr * a modified strstr function that don't crash when haystack is NULL or needle us NULL */ char * o_strstr(const char * haystack, const char * needle) { if (haystack == NULL || needle == NULL) { return NULL; } else { return strstr(haystack, needle); } } /** * o_strchr * a modified strchr function that don't crash when haystack is NULL */ char * o_strchr(const char * haystack, int c) { if (haystack == NULL) { return NULL; } else { return strchr(haystack, c); } } /** * o_strrchr * a modified strrchr function that don't crash when haystack is NULL */ char * o_strrchr(const char * haystack, int c) { if (haystack == NULL) { return NULL; } else { return strrchr(haystack, c); } } #if defined(__linux__) || defined(__GLIBC__) static char *strnstr(const char *haystack, const char *needle, size_t len) { int i; size_t needle_len; /* segfault here if needle is not NULL terminated */ if (0 == (needle_len = strlen(needle))) return (char *)haystack; for (i=0; i<=(int)(len - needle_len); i++) { if ((haystack[0] == needle[0]) && (0 == strncmp(haystack, needle, needle_len))) return (char *)haystack; haystack++; } return NULL; } #endif /** * o_strnstr * a modified strnstr function that don't crash when haystack is NULL or needle us NULL */ char * o_strnstr(const char * haystack, const char * needle, size_t len) { if (haystack == NULL || needle == NULL) { return NULL; } else { return strnstr(haystack, needle, len); } } /** * o_strcasestr * a modified strcasestr function that don't crash when haystack is NULL or needle us NULL */ char * o_strcasestr(const char * haystack, const char * needle) { if (haystack == NULL || needle == NULL) { return NULL; } else { return strcasestr(haystack, needle); } } /** * o_strlen * a modified version of strlen that don't crash when s is NULL */ size_t o_strlen(const char * s) { if (s == NULL) { return 0; } else { return strlen(s); } } /** * Split a string into an array of strings using separator string * return the number of elements to be returned, 0 on error * if return_array is not NULL, set the returned array in it * return_array is an array of char * ending with a NULL value * return_array must be free'd after use * you can use free_string_array to free return_array */ int split_string(const char * string, const char * separator, char *** return_array) { int result = 0; char * token; const char * begin = string; if (string != NULL && separator != NULL) { if (return_array != NULL) { *return_array = NULL; } result = 1; token = strstr(begin, separator); while (token != NULL) { if (return_array != NULL) { (*return_array) = o_realloc((*return_array), (result + 1)*sizeof(char*)); if ((*return_array) != NULL) { (*return_array)[result-1] = o_strndup(begin, (token-begin)); (*return_array)[result] = NULL; } } result++; begin = token+strlen(separator); token = strstr(begin, separator); } if (return_array != NULL) { (*return_array) = o_realloc((*return_array), (result + 1)*sizeof(char*)); if ((*return_array) != NULL) { (*return_array)[result-1] = o_strdup(begin); (*return_array)[result] = NULL; } } } return result; } /** * Clean an array of strings */ void free_string_array(char ** array) { int i; if (array != NULL) { for (i=0; array[i] != NULL; i++) { o_free(array[i]); array[i] = NULL; } o_free(array); } } /** * Remove string of beginning and ending whitespaces */ char * trimwhitespace(char * str) { char * end; if (str == NULL) { return NULL; } else if(*str == 0) { return str; } while(isspace((unsigned char)*str)) str++; end = str + strlen(str) - 1; while(end > str && isspace((unsigned char)*end)) { end--; } *(end+1) = 0; return str; } /** * Check if an array of string has a specified value, case sensitive */ int string_array_has_value(const char ** array, const char * needle) { int i; if (array != NULL && needle != NULL) { for (i=0; array[i] != NULL; i++) { if (o_strcmp(array[i], needle) == 0) { return 1; } } return 0; } else { return 0; } } /** * Check if an array of string has a specified value, case insensitive */ int string_array_has_value_case(const char ** array, const char * needle) { int i; if (array != NULL && needle != NULL) { for (i=0; array[i] != NULL; i++) { if (o_strcasecmp(array[i], needle) == 0) { return 1; } } return 0; } else { return 0; } } /** * Check if an array of string has a specified value, case sensitive, limit to len characters */ int string_array_has_value_n(const char ** array, const char * needle, size_t len) { int i; if (array != NULL && needle != NULL) { for (i=0; array[i] != NULL; i++) { if (o_strncmp(array[i], needle, len) == 0) { return 1; } } return 0; } else { return 0; } } /** * Check if an array of string has a specified value, case insensitive, limit to len characters */ int string_array_has_value_ncase(const char ** array, const char * needle, size_t len) { int i; if (array != NULL && needle != NULL) { for (i=0; array[i] != NULL; i++) { if (o_strncasecmp(array[i], needle, len) == 0) { return 1; } } return 0; } else { return 0; } } /** * Check if an array of string has a specified trimmed value */ int string_array_has_trimmed_value(const char ** array, const char * needle) { int i, to_return; char * duplicate_needle, * trimmed_needle, * duplicate_value, * trimmed_value; if (array != NULL && needle != NULL) { duplicate_needle = o_strdup(needle); if (duplicate_needle == NULL) { to_return = 0; } else { trimmed_needle = trimwhitespace(duplicate_needle); for (i=0; array[i] != NULL; i++) { duplicate_value = o_strdup(array[i]); if (duplicate_value == NULL) { to_return = 0; break; } else { trimmed_value = trimwhitespace(duplicate_value); if (o_strcmp(trimmed_value, trimmed_needle) == 0) { to_return = 1; } } o_free(duplicate_value); } to_return = 0; } o_free(duplicate_needle); } else { to_return = 0; } return to_return; } #ifndef U_DISABLE_JANSSON /** * json_t * json_search(json_t * haystack, json_t * needle) * jansson library addon * Look for an occurence of needle within haystack * If needle is present in haystack, return the reference to the json_t * that is equal to needle * If needle is not found, return NULL */ json_t * json_search(json_t * haystack, json_t * needle) { json_t * value1, * value2; size_t index; const char * key; if (!haystack || !needle) return NULL; if (haystack == needle) return haystack; // If both haystack and needle are the same type, test them if (json_typeof(haystack) == json_typeof(needle) && !json_is_object(haystack)) if (json_equal(haystack, needle)) return haystack; // If they are not equals, test json_search in haystack elements recursively if it's an array or an object if (json_is_array(haystack)) { json_array_foreach(haystack, index, value1) { if (json_equal(value1, needle)) { return value1; } else { value2 = json_search(value1, needle); if (value2 != NULL) { return value2; } } } } else if (json_is_object(haystack) && json_is_object(needle)) { int same = 1; json_object_foreach(needle, key, value1) { value2 = json_object_get(haystack, key); if (!json_equal(value1, value2)) { same = 0; } } if (same) { return haystack; } } else if (json_is_object(haystack)) { json_object_foreach(haystack, key, value1) { if (json_equal(value1, needle)) { return value1; } else { value2 = json_search(value1, needle); if (value2 != NULL) { return value2; } } } } return NULL; } /** * Check if the result json object has a "result" element that is equal to value */ int check_result_value(json_t * result, const int value) { return (result != NULL && json_is_object(result) && json_object_get(result, "result") != NULL && json_is_integer(json_object_get(result, "result")) && json_integer_value(json_object_get(result, "result")) == value); } #endif orcania-1.1.1/src/orcania.h000066400000000000000000000147021322302010700154740ustar00rootroot00000000000000/** * * Orcania library * * Different functions for different purposes but that can be shared between * other projects * */ #ifndef __ORCANIA_H__ #define __ORCANIA_H__ #ifndef U_DISABLE_JANSSON #include #endif #define ORCANIA_VERSION 1.1.1 /** * char * str_replace(const char * source, char * old, char * new) * replace all occurences of old by new in the string source * return a char * with the new value * return NULL on error * returned value must be free'd after use */ char * str_replace(const char * source, const char * str_old, const char * str_new); /** * o_strdup * a modified strdup function that don't crash when source is NULL, instead return NULL * Returned value must be free'd after use */ char * o_strdup(const char * source); /** * o_strndup * a modified strndup function that don't crash when source is NULL, instead return NULL * Returned value must be free'd after use */ char * o_strndup(const char * source, size_t len); /** * o_strcmp * a modified strcmp function that don't crash when p1 is NULL or p2 us NULL */ int o_strcmp(const char * p1, const char * p2); /** * o_strncmp * a modified strncmp function that don't crash when p1 is NULL or p2 us NULL */ int o_strncmp(const char * p1, const char * p2, size_t n); /** * o_strcpy * a modified strcpy function that don't crash when p1 is NULL or p2 us NULL */ char * o_strcpy(char * p1, const char * p2); /** * o_strncpy * a modified strncpy function that don't crash when p1 is NULL or p2 us NULL */ char * o_strncpy(char * p1, const char * p2, size_t n); /** * o_strcasecmp * a modified strcasecmp function that don't crash when p1 is NULL or p2 us NULL */ int o_strcasecmp(const char * p1, const char * p2); /** * o_strncasecmp * a modified strncasecmp function that don't crash when p1 is NULL or p2 us NULL */ int o_strncasecmp(const char * p1, const char * p2, size_t n); /** * o_strstr * a modified strstr function that don't crash when haystack is NULL or needle us NULL */ char * o_strstr(const char * haystack, const char * needle); /** * o_strnstr * a modified strnstr function that don't crash when haystack is NULL or needle us NULL */ char * o_strnstr(const char * haystack, const char * needle, size_t len); /** * o_strcasestr * a modified strcasestr function that don't crash when haystack is NULL or needle us NULL */ char * o_strcasestr(const char * haystack, const char * needle); /** * o_strchr * a modified strchr function that don't crash when haystack is NULL */ char * o_strchr(const char * haystack, int c); /** * o_strrchr * a modified strrchr function that don't crash when haystack is NULL */ char * o_strrchr(const char * haystack, int c); /** * o_strlen * a modified version of strlen that don't crash when s is NULL */ size_t o_strlen(const char * s); /** * char * msprintf(const char * message, ...) * Implementation of sprintf that return a malloc'd char * with the string construction * because life is too short to use 3 lines instead of 1 * but don't forget to free the returned value after use! */ char * msprintf(const char * message, ...); /** * Split a string into an array of strings using separator string * return the number of elements to be returned, 0 on error * if return_array is not NULL, set the returned array in it * return_array is an array of char * ending with a NULL value * return_array must be free'd after use * you can use free_string_array to free return_array */ int split_string(const char * string, const char * separator, char *** return_array); /** * Clean an array of strings */ void free_string_array(char ** array); /** * Check if an array of string has a specified value, case sensitive */ int string_array_has_value(const char ** array, const char * needle); /** * Check if an array of string has a specified value, case insensitive */ int string_array_has_value_case(const char ** array, const char * needle); /** * Check if an array of string has a specified value, case sensitive, limit to len characters */ int string_array_has_value_n(const char ** array, const char * needle, size_t len); /** * Check if an array of string has a specified value, case insensitive, limit to len characters */ int string_array_has_value_ncase(const char ** array, const char * needle, size_t len); /** * Check if an array of string has a specified trimmed value */ int string_array_has_trimmed_value(const char ** array, const char * needle); /** * Remove string of beginning and ending whitespaces */ char * trimwhitespace(char * str); #ifndef U_DISABLE_JANSSON /** * json_t * json_search(json_t * haystack, json_t * needle) * jansson library addon * This function could be removed if y pull request is accepted in jansson official repository: * https://github.com/akheron/jansson/pull/265 * Look for an occurence of needle within haystack * If needle is present in haystack, return the reference to the json_t * that is equal to needle * If needle is not found, return NULL */ json_t * json_search(json_t * haystack, json_t * needle); /** * Check if the result json object has a "result" element that is equal to value */ int check_result_value(json_t * result, const int value); #endif /** * Memory functions */ /* C89 allows these to be macros */ #undef malloc #undef realloc #undef free typedef void *(*o_malloc_t)(size_t); typedef void *(*o_realloc_t)(void *, size_t); typedef void (*o_free_t)(void *); void * o_malloc(size_t size); void * o_realloc(void * ptr, size_t size); void o_free(void * ptr); void o_set_alloc_funcs(o_malloc_t malloc_fn, o_realloc_t realloc_fn, o_free_t free_fn); void o_get_alloc_funcs(o_malloc_t * malloc_fn, o_realloc_t * realloc_fn, o_free_t * free_fn); /** * Base64 encode and decode functions */ /** * o_base64_encode - Base64 encode * @src: Data to be encoded * @len: Length of the data to be encoded * @out: Pointer to output variable * @out_len: Pointer to output length variable * Returns: 1 on success, 0 on failure * * The nul terminator is not included in out_len. */ int o_base64_encode(const unsigned char * src, size_t len, unsigned char * out, size_t * out_len); /** * o_base64_decode - Base64 decode * @src: Data to be decoded * @len: Length of the data to be decoded * @out: Pointer to output variable * @out_len: Pointer to output length variable * Returns: 1 on success, 0 on failure * * The nul terminator is not included in out_len. */ int o_base64_decode(const unsigned char *src, size_t len, unsigned char * out, size_t * out_len); #endif orcania-1.1.1/test/000077500000000000000000000000001322302010700140735ustar00rootroot00000000000000orcania-1.1.1/test/Makefile000066400000000000000000000034631322302010700155410ustar00rootroot00000000000000# # Orcania library # # Makefile used to build the tests # # Copyright 2017 Nicolas Mora # # This program is free software; you can redistribute it and/or # modify it under the terms of the GNU GENERAL PUBLIC LICENSE # License as published by the Free Software Foundation; # version 3 of the License. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU GENERAL PUBLIC LICENSE for more details. # # You should have received a copy of the GNU General Public # License along with this program. If not, see . # CC=gcc CFLAGS=-Wall -D_REENTRANT -DDEBUG -g -O0 ORCANIA_LOCATION=../src LIBS=-lc -lorcania -ljansson -lcheck -lpthread -lm -lrt -lsubunit -L$(ORCANIA_LOCATION) all: test clean: rm -f *.o str_test split_test memory_test jansson_test valgrind.txt liborcania.so: cd $(ORCANIA_LOCATION) && $(MAKE) debug str_test: str_test.c $(CC) $(CFLAGS) str_test.c -o str_test $(LIBS) test_str_test: liborcania.so str_test -LD_LIBRARY_PATH=$(ORCANIA_LOCATION):${LD_LIBRARY_PATH} ./str_test split_test: split_test.c $(CC) $(CFLAGS) split_test.c -o split_test $(LIBS) test_split_test: liborcania.so split_test -LD_LIBRARY_PATH=$(ORCANIA_LOCATION):${LD_LIBRARY_PATH} ./split_test memory_test: memory_test.c $(CC) $(CFLAGS) memory_test.c -o memory_test $(LIBS) test_memory_test: liborcania.so memory_test -LD_LIBRARY_PATH=$(ORCANIA_LOCATION):${LD_LIBRARY_PATH} ./memory_test jansson_test: jansson_test.c $(CC) $(CFLAGS) jansson_test.c -o jansson_test $(LIBS) test_jansson_test: liborcania.so jansson_test -LD_LIBRARY_PATH=$(ORCANIA_LOCATION):${LD_LIBRARY_PATH} ./jansson_test test: test_str_test test_split_test test_jansson_test orcania-1.1.1/test/jansson_test.c000066400000000000000000000037151322302010700167570ustar00rootroot00000000000000/* Public domain, no copyright. Use at your own risk. */ #include #include #include #include #include #include #include #include "../src/orcania.h" START_TEST(test_json_search) { json_t * haystack = json_pack("{sss{sssss{si}}}", "a", "b", "c", "d", "e", "f", "g", "h", "i", 42), * needle_found = json_string("e"), * needle_not_found = json_string("nope"); ck_assert_ptr_ne(json_search(haystack, needle_found), NULL); ck_assert_ptr_eq(json_search(haystack, needle_not_found), NULL); ck_assert_ptr_eq(json_search(haystack, NULL), NULL); ck_assert_ptr_eq(json_search(NULL, needle_found), NULL); json_decref(haystack); json_decref(needle_found); json_decref(needle_not_found); } END_TEST START_TEST(test_check_result_value) { json_t * j_result = json_pack("{sis{sss{sssss{si}}}}", "result", 1, "value", "result", "b", "c", "d", "e", "f", "g", "h", "i", 42); ck_assert_int_eq(check_result_value(j_result, 1), 1); ck_assert_int_eq(check_result_value(j_result, 42), 0); ck_assert_int_eq(check_result_value(NULL, 1), 0); ck_assert_int_eq(check_result_value(json_object_get(j_result, "value"), 1), 0); ck_assert_int_eq(check_result_value(json_object_get(json_object_get(j_result, "value"), "h"), 1), 0); json_decref(j_result); } END_TEST static Suite *orcania_suite(void) { Suite *s; TCase *tc_core; s = suite_create("Orcania tests jansson functions"); tc_core = tcase_create("test_orcania_jansson"); tcase_add_test(tc_core, test_json_search); tcase_add_test(tc_core, test_check_result_value); tcase_set_timeout(tc_core, 30); suite_add_tcase(s, tc_core); return s; } int main(int argc, char *argv[]) { int number_failed; Suite *s; SRunner *sr; s = orcania_suite(); sr = srunner_create(s); srunner_run_all(sr, CK_VERBOSE); number_failed = srunner_ntests_failed(sr); srunner_free(sr); return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE; } orcania-1.1.1/test/memory_test.c000066400000000000000000000023461322302010700166130ustar00rootroot00000000000000/* Public domain, no copyright. Use at your own risk. */ #include #include #include #include #include #include #include "../src/orcania.h" START_TEST(test_o_malloc) { void * var; var = malloc(8); ck_assert_ptr_ne(var, NULL); o_free(var); var = malloc(-1); ck_assert_ptr_eq(var, NULL); } END_TEST START_TEST(test_o_realloc) { void * var, * new_var; var = malloc(8); ck_assert_ptr_ne(var, NULL); var = realloc(var, 16); ck_assert_ptr_ne(var, NULL); new_var = realloc(var, -1); ck_assert_ptr_eq(new_var, NULL); o_free(var); } END_TEST static Suite *orcania_suite(void) { Suite *s; TCase *tc_core; s = suite_create("Orcania tests memory functions"); tc_core = tcase_create("test_orcania_memory"); tcase_add_test(tc_core, test_o_malloc); tcase_add_test(tc_core, test_o_realloc); tcase_set_timeout(tc_core, 30); suite_add_tcase(s, tc_core); return s; } int main(int argc, char *argv[]) { int number_failed; Suite *s; SRunner *sr; s = orcania_suite(); sr = srunner_create(s); srunner_run_all(sr, CK_VERBOSE); number_failed = srunner_ntests_failed(sr); srunner_free(sr); return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE; } orcania-1.1.1/test/split_test.c000066400000000000000000000033141322302010700164320ustar00rootroot00000000000000/* Public domain, no copyright. Use at your own risk. */ #include #include #include #include #include #include #include "../src/orcania.h" START_TEST(test_split_string) { char * str = "ab,cd,ef,gghhii,jkl", * separator = ",", ** splitted; int nb_elt; nb_elt = split_string(str, separator, &splitted); ck_assert_ptr_ne(splitted, NULL); ck_assert_int_eq(nb_elt, 5); ck_assert_int_eq(split_string(str, "nope", NULL), 1); ck_assert_str_eq(splitted[0], "ab"); free_string_array(splitted); } END_TEST START_TEST(test_string_array_has_value) { char * str = "ab,cd,ef,gghhii,jkl", * separator = ",", ** splitted; ck_assert_int_eq(split_string(str, separator, &splitted), 5); ck_assert_int_eq(string_array_has_value((const char **)splitted, "ab"), 1); ck_assert_int_eq(string_array_has_value((const char **)splitted, "nope"), 0); ck_assert_int_eq(string_array_has_value((const char **)splitted, NULL), 0); ck_assert_int_eq(string_array_has_value(NULL, "ab"), 0); free_string_array(splitted); } END_TEST static Suite *orcania_suite(void) { Suite *s; TCase *tc_core; s = suite_create("Orcania tests split string functions"); tc_core = tcase_create("test_orcania_split"); tcase_add_test(tc_core, test_split_string); tcase_add_test(tc_core, test_string_array_has_value); tcase_set_timeout(tc_core, 30); suite_add_tcase(s, tc_core); return s; } int main(int argc, char *argv[]) { int number_failed; Suite *s; SRunner *sr; s = orcania_suite(); sr = srunner_create(s); srunner_run_all(sr, CK_VERBOSE); number_failed = srunner_ntests_failed(sr); srunner_free(sr); return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE; } orcania-1.1.1/test/str_test.c000066400000000000000000000171711322302010700161150ustar00rootroot00000000000000/* Public domain, no copyright. Use at your own risk. */ #include #include #include #include #include #include #include "../src/orcania.h" START_TEST(test_str_replace) { char * str = "abcdeffedcba", * old_1 = "cd", * new_1 = "gh", * old_2 = "f", * target; target = str_replace(str, old_1, new_1); ck_assert_str_eq(target, "abgheffedcba"); ck_assert_ptr_eq(str_replace(NULL, old_1, new_1), NULL); ck_assert_ptr_eq(str_replace(str, NULL, new_1), NULL); ck_assert_ptr_eq(str_replace(str, old_1, NULL), NULL); o_free(target); target = str_replace(str, old_2, new_1); ck_assert_str_eq(target, "abcdeghghedcba"); o_free(target); target = str_replace(str, str, ""); ck_assert_str_eq(target, ""); o_free(target); } END_TEST START_TEST(test_o_strdup) { char * str = "abcdeffedcba", * target; target = o_strdup(str); ck_assert_str_eq(target, str); o_free(target); ck_assert_ptr_eq(o_strdup(NULL), NULL); } END_TEST START_TEST(test_o_strndup) { char * str = "abcdeffedcba", * target; target = o_strndup(str, strlen(str)); ck_assert_str_eq(target, str); o_free(target); target = o_strndup(str, strlen(str)-2); ck_assert_str_eq(target, "abcdeffedc"); o_free(target); ck_assert_ptr_eq(o_strndup(NULL, 12), NULL); target = o_strndup("abcdeffedc", 0); ck_assert_ptr_ne(target, NULL); o_free(target); } END_TEST START_TEST(test_o_strcmp) { char * str_1 = "abcdeffedcba", * str_2 = "bob", * str_3 = "abcdeffedcba"; ck_assert_int_eq(o_strcmp(str_1, str_3), 0); ck_assert_int_ne(o_strcmp(str_1, str_2), 0); ck_assert_int_ne(o_strcmp(str_1, NULL), 0); ck_assert_int_ne(o_strcmp(NULL, str_1), 0); ck_assert_int_eq(o_strcmp(NULL, NULL), 0); } END_TEST START_TEST(test_o_strncmp) { char * str_1 = "abcdeffedcba", * str_2 = "abc", * str_3 = "abcdeffedcba"; ck_assert_int_eq(o_strncmp(str_1, str_3, strlen(str_3)), 0); ck_assert_int_eq(o_strncmp(str_1, str_2, strlen(str_2)), 0); ck_assert_int_ne(o_strncmp(str_1, str_2, strlen(str_1)), 0); ck_assert_int_ne(o_strncmp(str_1, NULL, strlen(str_1)), 0); ck_assert_int_ne(o_strncmp(NULL, str_1, strlen(str_1)), 0); ck_assert_int_eq(o_strncmp(NULL, NULL, 0), 0); ck_assert_int_eq(o_strncmp(NULL, NULL, 1), 0); } END_TEST START_TEST(test_o_strcasecmp) { char * str_1 = "abcdeffedcba", * str_2 = "bob", * str_3 = "AbcdeFfedcba"; ck_assert_int_eq(o_strcasecmp(str_1, str_3), 0); ck_assert_int_ne(o_strcasecmp(str_1, str_2), 0); ck_assert_int_ne(o_strcasecmp(str_1, NULL), 0); ck_assert_int_ne(o_strcasecmp(NULL, str_1), 0); ck_assert_int_eq(o_strcasecmp(NULL, NULL), 0); } END_TEST START_TEST(test_o_strncasecmp) { char * str_1 = "abcdeFfedcba", * str_2 = "abC", * str_3 = "abCdeffedCba"; ck_assert_int_eq(o_strncasecmp(str_1, str_3, strlen(str_3)), 0); ck_assert_int_eq(o_strncasecmp(str_1, str_2, strlen(str_2)), 0); ck_assert_int_ne(o_strncasecmp(str_1, str_2, strlen(str_1)), 0); ck_assert_int_ne(o_strncasecmp(str_1, NULL, strlen(str_1)), 0); ck_assert_int_ne(o_strncasecmp(NULL, str_1, strlen(str_1)), 0); ck_assert_int_eq(o_strncasecmp(NULL, NULL, 0), 0); ck_assert_int_eq(o_strncasecmp(NULL, NULL, 1), 0); } END_TEST START_TEST(test_o_strcpy) { char * src = "abcd", target[5]; ck_assert_ptr_ne(o_strcpy(target, src), NULL); ck_assert_str_eq(target, src); ck_assert_ptr_eq(o_strcpy(target, NULL), NULL); ck_assert_ptr_eq(o_strcpy(NULL, src), NULL); ck_assert_ptr_eq(o_strcpy(NULL, NULL), NULL); } END_TEST START_TEST(test_o_strncpy) { char * src = "abcd", target[5] = {0}; ck_assert_ptr_ne(o_strncpy(target, src, 3), NULL); ck_assert_str_eq(target, "abc"); ck_assert_ptr_eq(o_strncpy(target, NULL, 4), NULL); ck_assert_ptr_eq(o_strncpy(NULL, src, 4), NULL); ck_assert_ptr_eq(o_strncpy(NULL, NULL, 4), NULL); } END_TEST START_TEST(test_o_strstr) { char * str_1 = "abcdeffedcba", * str_2 = "def", * str_3 = "bob"; ck_assert_ptr_ne(o_strstr(str_1, str_2), NULL); ck_assert_ptr_eq(o_strstr(str_1, str_3), NULL); ck_assert_ptr_eq(o_strstr(NULL, str_3), NULL); ck_assert_ptr_eq(o_strstr(str_1, NULL), NULL); ck_assert_ptr_eq(o_strstr(NULL, NULL), NULL); } END_TEST START_TEST(test_o_strnstr) { char * str_1 = "abcdeffedcba", * str_2 = "def", * str_3 = "bob"; ck_assert_ptr_ne(o_strnstr(str_1, str_2, strlen(str_1)), NULL); ck_assert_ptr_eq(o_strnstr(str_1, str_3, strlen(str_1)), NULL); ck_assert_ptr_eq(o_strnstr(str_1, str_3, 0), NULL); ck_assert_ptr_eq(o_strnstr(NULL, str_3, strlen(str_3)), NULL); ck_assert_ptr_eq(o_strnstr(str_1, NULL, strlen(str_1)), NULL); ck_assert_ptr_eq(o_strnstr(NULL, NULL, strlen(str_3)), NULL); } END_TEST START_TEST(test_o_strchr) { char * str_1 = "abcdef", str_2 = 'd', str_3 = 'g'; ck_assert_ptr_ne(o_strchr(str_1, str_2), NULL); ck_assert_ptr_eq(o_strchr(str_1, str_3), NULL); ck_assert_ptr_eq(o_strchr(NULL, str_3), NULL); } END_TEST START_TEST(test_o_strrchr) { char * str_1 = "abcdef", str_2 = 'd', str_3 = 'g'; ck_assert_ptr_ne(o_strrchr(str_1, str_2), NULL); ck_assert_ptr_eq(o_strrchr(str_1, str_3), NULL); ck_assert_ptr_ne(o_strrchr(str_1, str_2), NULL); ck_assert_ptr_eq(o_strrchr(NULL, str_3), NULL); } END_TEST START_TEST(test_o_strlen) { ck_assert_int_eq(o_strlen("abcdef"), 6); ck_assert_int_eq(o_strlen(NULL), 0); ck_assert_int_eq(o_strlen(""), 0); } END_TEST START_TEST(test_msprintf) { char * target; target = msprintf("target1 %s %d %p", "str1", 42, NULL); ck_assert_str_eq(target, "target1 str1 42 (nil)"); o_free(target); ck_assert_ptr_eq(msprintf(NULL, "str1", 42, NULL), NULL); } END_TEST START_TEST(test_trimwhitespace) { char * test1 = o_strdup(" bob trimmed "), * test2 = o_strdup(" \t \t"), * test3 = o_strdup(""); ck_assert_str_eq(trimwhitespace(test1), "bob trimmed"); ck_assert_str_eq(trimwhitespace(test2), ""); ck_assert_str_eq(trimwhitespace(test3), ""); ck_assert_ptr_eq(trimwhitespace(NULL), NULL); o_free(test1); o_free(test2); o_free(test3); } END_TEST START_TEST(test_base64) { char * src = "source string", encoded[128], decoded[128]; size_t encoded_size, decoded_size; ck_assert_int_eq(o_base64_encode((unsigned char *)src, strlen(src), (unsigned char *)encoded, &encoded_size), 1); ck_assert_str_eq(encoded, "c291cmNlIHN0cmluZw=="); ck_assert_int_eq(o_base64_decode((unsigned char *)encoded, encoded_size, (unsigned char *)decoded, &decoded_size), 1); ck_assert_str_eq(decoded, src); ck_assert_int_eq(decoded_size, strlen(src)); } END_TEST static Suite *orcania_suite(void) { Suite *s; TCase *tc_core; s = suite_create("Orcania tests string functions"); tc_core = tcase_create("test_orcania_str"); tcase_add_test(tc_core, test_str_replace); tcase_add_test(tc_core, test_o_strdup); tcase_add_test(tc_core, test_o_strndup); tcase_add_test(tc_core, test_o_strcmp); tcase_add_test(tc_core, test_o_strncmp); tcase_add_test(tc_core, test_o_strcasecmp); tcase_add_test(tc_core, test_o_strncasecmp); tcase_add_test(tc_core, test_o_strcpy); tcase_add_test(tc_core, test_o_strncpy); tcase_add_test(tc_core, test_o_strstr); tcase_add_test(tc_core, test_o_strnstr); tcase_add_test(tc_core, test_o_strchr); tcase_add_test(tc_core, test_o_strrchr); tcase_add_test(tc_core, test_o_strlen); tcase_add_test(tc_core, test_msprintf); tcase_add_test(tc_core, test_trimwhitespace); tcase_add_test(tc_core, test_base64); tcase_set_timeout(tc_core, 30); suite_add_tcase(s, tc_core); return s; } int main(int argc, char *argv[]) { int number_failed; Suite *s; SRunner *sr; s = orcania_suite(); sr = srunner_create(s); srunner_run_all(sr, CK_VERBOSE); number_failed = srunner_ntests_failed(sr); srunner_free(sr); return (number_failed == 0) ? EXIT_SUCCESS : EXIT_FAILURE; }