1 /////////////////////////////////////////////////////////////////////////// 2 // 3 // Copyright (c) 2002, Industrial Light & Magic, a division of Lucas 4 // Digital Ltd. LLC 5 // 6 // All rights reserved. 7 // 8 // Redistribution and use in source and binary forms, with or without 9 // modification, are permitted provided that the following conditions are 10 // met: 11 // * Redistributions of source code must retain the above copyright 12 // notice, this list of conditions and the following disclaimer. 13 // * Redistributions in binary form must reproduce the above 14 // copyright notice, this list of conditions and the following disclaimer 15 // in the documentation and/or other materials provided with the 16 // distribution. 17 // * Neither the name of Industrial Light & Magic nor the names of 18 // its contributors may be used to endorse or promote products derived 19 // from this software without specific prior written permission. 20 // 21 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 22 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 23 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 24 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 25 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 26 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 27 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 28 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 29 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 30 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 31 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 32 // 33 /////////////////////////////////////////////////////////////////////////// 34 35 36 37 #ifndef INCLUDED_IMF_HUF_H 38 #define INCLUDED_IMF_HUF_H 39 40 41 //----------------------------------------------------------------------------- 42 // 43 // 16-bit Huffman compression and decompression: 44 // 45 // hufCompress (r, nr, c) 46 // 47 // Compresses the contents of array r (of length nr), 48 // stores the compressed data in array c, and returns 49 // the size of the compressed data (in bytes). 50 // 51 // To avoid buffer overflows, the size of array c should 52 // be at least 2 * nr + 65536. 53 // 54 // hufUncompress (c, nc, r, nr) 55 // 56 // Uncompresses the data in array c (with length nc), 57 // and stores the results in array r (with length nr). 58 // 59 //----------------------------------------------------------------------------- 60 61 namespace Imf { 62 63 64 int 65 hufCompress (const unsigned short raw[/*nRaw*/], 66 int nRaw, 67 char compressed[/*2 * nRaw + 65536*/]); 68 69 70 void 71 hufUncompress (const char compressed[/*nCompressed*/], 72 int nCompressed, 73 unsigned short raw[/*nRaw*/], 74 int nRaw); 75 76 77 } // namespace Imf 78 79 #endif 80