1 | /* |
1 | /* |
2 | * Copyright (c) 2000-2005 Marc Alexander Lehmann <schmorp@schmorp.de> |
2 | * Copyright (c) 2000-2007 Marc Alexander Lehmann <schmorp@schmorp.de> |
3 | * |
3 | * |
4 | * Redistribution and use in source and binary forms, with or without modifica- |
4 | * Redistribution and use in source and binary forms, with or without modifica- |
5 | * tion, are permitted provided that the following conditions are met: |
5 | * tion, are permitted provided that the following conditions are met: |
6 | * |
6 | * |
7 | * 1. Redistributions of source code must retain the above copyright notice, |
7 | * 1. Redistributions of source code must retain the above copyright notice, |
8 | * this list of conditions and the following disclaimer. |
8 | * this list of conditions and the following disclaimer. |
9 | * |
9 | * |
10 | * 2. Redistributions in binary form must reproduce the above copyright |
10 | * 2. Redistributions in binary form must reproduce the above copyright |
11 | * notice, this list of conditions and the following disclaimer in the |
11 | * notice, this list of conditions and the following disclaimer in the |
12 | * documentation and/or other materials provided with the distribution. |
12 | * documentation and/or other materials provided with the distribution. |
13 | * |
|
|
14 | * 3. The name of the author may not be used to endorse or promote products |
|
|
15 | * derived from this software without specific prior written permission. |
|
|
16 | * |
13 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
14 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
18 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
15 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MER- |
19 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
16 | * CHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO |
20 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
17 | * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPE- |
… | |
… | |
46 | ** |
43 | ** |
47 | ** This algorithm is believed to be patent-free. |
44 | ** This algorithm is believed to be patent-free. |
48 | ** |
45 | ** |
49 | ***********************************************************************/ |
46 | ***********************************************************************/ |
50 | |
47 | |
|
|
48 | #define LZF_VERSION 0x0105 /* 1.5 */ |
|
|
49 | |
51 | /* |
50 | /* |
52 | * Compress in_len bytes stored at the memory block starting at |
51 | * Compress in_len bytes stored at the memory block starting at |
53 | * in_data and write the result to out_data, up to a maximum length |
52 | * in_data and write the result to out_data, up to a maximum length |
54 | * of out_len bytes. |
53 | * of out_len bytes. |
55 | * |
54 | * |
… | |
… | |
58 | * be considerably larger than in_len, so it makes sense to always |
57 | * be considerably larger than in_len, so it makes sense to always |
59 | * use out_len == in_len - 1), to ensure _some_ compression, and store |
58 | * use out_len == in_len - 1), to ensure _some_ compression, and store |
60 | * the data uncompressed otherwise. |
59 | * the data uncompressed otherwise. |
61 | * |
60 | * |
62 | * lzf_compress might use different algorithms on different systems and |
61 | * lzf_compress might use different algorithms on different systems and |
63 | * thus might result in different compressed strings depending on the |
62 | * even diferent runs, thus might result in different compressed strings |
64 | * phase of the moon or similar factors. However, all these strings are |
63 | * depending on the phase of the moon or similar factors. However, all |
65 | * architecture-independent and will result in the original data when |
64 | * these strings are architecture-independent and will result in the |
66 | * decompressed using lzf_decompress. |
65 | * original data when decompressed using lzf_decompress. |
67 | * |
66 | * |
68 | * The buffers must not be overlapping. |
67 | * The buffers must not be overlapping. |
69 | * |
68 | * |
70 | * If the option LZF_STATE_ARG is enabled, an extra argument must be |
69 | * If the option LZF_STATE_ARG is enabled, an extra argument must be |
71 | * supplied which is not reflected in this header file. Refer to lzf_c.c. |
70 | * supplied which is not reflected in this header file. Refer to lzfP.h |
|
|
71 | * and lzf_c.c. |
72 | * |
72 | * |
73 | */ |
73 | */ |
74 | unsigned int |
74 | unsigned int |
75 | lzf_compress (const void *const in_data, unsigned int in_len, |
75 | lzf_compress (const void *const in_data, unsigned int in_len, |
76 | void *out_data, unsigned int out_len); |
76 | void *out_data, unsigned int out_len); |