Index: ext/libicpf/src/crypt.cpp =================================================================== diff -u -N --- ext/libicpf/src/crypt.cpp (revision 2446443341715955423610c01b43fe7841a10e3e) +++ ext/libicpf/src/crypt.cpp (revision 0) @@ -1,166 +0,0 @@ -/*************************************************************************** - * Copyright (C) 2004-2006 by J�zef Starosczyk * - * ixen@copyhandler.com * - * * - * This program is free software; you can redistribute it and/or modify * - * it under the terms of the GNU Library General Public License as * - * published by the Free Software Foundation; either version 2 of the * - * License, or (at your option) any later version. * - * * - * 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 Library General Public * - * License along with this program; if not, write to the * - * Free Software Foundation, Inc., * - * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * - ***************************************************************************/ -#include "crypt.h" -#include "rijndael-api-fst.h" -#include "conv.h" -#include "sha256.h" -#include "exception.h" -#include "err_codes.h" -#include - -#ifdef USE_ENCRYPTION - -BEGIN_ICPF_NAMESPACE - -// output buffer might be in size+16 -LIBICPF_API int_t crypt_aes256(const ptr_t pIn, int_t iCnt, const char_t* pszPass, ptr_t pOut) -{ - // init the cipher - cipherInstance ci; - int_t iRes; - if ((iRes=cipherInit(&ci, MODE_ECB, NULL)) < 0) - THROW(exception::format("cipherInit() in crypt_aes256() failed with result " IFMT, iRes), EE_INIT, 0, 0); - - // make the key - keyInstance ki; - if ((iRes=makeKey(&ki, DIR_ENCRYPT, 256, pszPass)) < 0) - THROW(exception::format("makeKey in crypt_aes256() failed with result " IFMT, iRes), EE_CRYPT, 0, 0); - - // now encrypt the data - if ((iRes=padEncrypt(&ci, &ki, (uchar_t*)pIn, iCnt, (uchar_t*)pOut)) < 0) - THROW(exception::format("padEncrypt() in crypt_aes256() failed with result " IFMT, iRes), EE_CRYPT, 0, 0); - - return iRes; -} - -// output buffer has to have iCnt size -LIBICPF_API int_t decrypt_aes256(const ptr_t pIn, int_t iCnt, const char_t* pszPass, ptr_t pOut) -{ - // init the cipher - cipherInstance ci; - int iRes; - if ((iRes=cipherInit(&ci, MODE_ECB, NULL)) < 0) - THROW(exception::format("cipherInit() in decrypt_aes256() failed with result " IFMT, iRes), EE_INIT, 0, 0); - - // make the key - keyInstance ki; - if ((iRes=makeKey(&ki, DIR_DECRYPT, 256, pszPass)) < 0) - THROW(exception::format("makeKey in decrypt_aes256() failed with result " IFMT, iRes), EE_DECRYPT, 0, 0); - - // decrypt the data - if ((iRes=padDecrypt(&ci, &ki, (uchar_t*)pIn, iCnt, (uchar_t*)pOut)) <= 0) - THROW(exception::format("padEncrypt() in decrypt_aes256() failed with result " IFMT, iRes), EE_DECRYPT, 0, 0); - - return iRes; -} - -// out buffer has to be of size ((_tcslen(pszIn)+1)*sizeof(char_t)+16)*2 -LIBICPF_API int_t strcrypt_aes256(const char_t* pszIn, const char_t* pszPass, char_t* pszOut) -{ - // init the cipher - cipherInstance ci; - int_t iRes; - if ((iRes=cipherInit(&ci, MODE_ECB, NULL)) < 0) - THROW(exception::format("cipherInit() in strcrypt_aes256() failed with result " IFMT, iRes), EE_INIT, 0, 0); - - // make the key - keyInstance ki; - if ((iRes=makeKey(&ki, DIR_ENCRYPT, 256, pszPass)) < 0) - THROW(exception::format("cipherInit() in strcrypt_aes256() failed with result " IFMT, iRes), EE_INIT, 0, 0); - - // count of data to encrypt, buffer for encrypted output - size_t tLen=strlen(pszIn)+1; - char_t *pszData=new char_t[tLen+16]; // for padding - - // now encrypt the data - if ((iRes=padEncrypt(&ci, &ki, (uchar_t*)pszIn, (int_t)(tLen*sizeof(char_t)), (uchar_t*)pszData)) < 0) - { - delete [] pszData; - THROW(exception::format("padEncrypt() in strcrypt_aes256() failed with result " IFMT, iRes), EE_DECRYPT, 0, 0); - } - - // make the data hex - bin2hex((uchar_t*)pszData, (uint_t)iRes, pszOut); - pszOut[iRes*2]='\0'; - - // delete the old stuff - delete [] pszData; - - return iRes*2; -} - -// out buffer size must be _tcslen(pszIn)/2 -LIBICPF_API int_t strdecrypt_aes256(const char_t* pszIn, const char_t* pszPass, char_t* pszOut) -{ - // count of input data - check if there is anything to process - size_t tLen=strlen(pszIn); - - // init the cipher - cipherInstance ci; - int iRes; - if ((iRes=cipherInit(&ci, MODE_ECB, NULL)) < 0) - THROW(exception::format("cipherInit() in crypt_aes256() failed with result " IFMT, iRes), EE_INIT, 0, 0); - - // make the key - keyInstance ki; - if ((iRes=makeKey(&ki, DIR_DECRYPT, 256, pszPass)) < 0) - THROW(exception::format("cipherInit() in strcrypt_aes256() failed with result " IFMT, iRes), EE_INIT, 0, 0); - - // buffer for hex data - uchar_t *pby=new uchar_t[tLen/2]; - - // decode hex data - if (!hex2bin(pszIn, (uint_t)tLen, pby)) - { - delete [] pby; - THROW("hex2bin in strdecrypt_aes256() failed", CE_HEX2BIN, 0, 0); - } - - // decrypt the data - if ((iRes=padDecrypt(&ci, &ki, pby, (int)tLen/2, (uchar_t*)(pszOut))) <= 0) - { - delete [] pby; - THROW(exception::format("padDecrypt() in strdecrypt_aes256() failed with result " IFMT, iRes), EE_DECRYPT, 0, 0); - } - - // delete buffers - delete [] pby; - - return (int_t)strlen(pszOut); -} - -// pszKey of size 64+1B -LIBICPF_API void str2key256(const char_t* pszString, char_t* pszKey) -{ - // generate the SHA256 from this password - uchar_t byData[32]; - sha256_context sc; - sha256_starts(&sc); - sha256_update(&sc, (uchar_t*)pszString, (ulong_t)strlen(pszString)*sizeof(char_t)); - sha256_finish(&sc, byData); - - // now the hexed hash - bin2hex(byData, 32, pszKey); - pszKey[64]='\0'; -} - -END_ICPF_NAMESPACE - -#endif Index: ext/libicpf/src/crypt.h =================================================================== diff -u -N --- ext/libicpf/src/crypt.h (revision 2446443341715955423610c01b43fe7841a10e3e) +++ ext/libicpf/src/crypt.h (revision 0) @@ -1,49 +0,0 @@ -/*************************************************************************** - * Copyright (C) 2004-2006 by J�zef Starosczyk * - * ixen@copyhandler.com * - * * - * This program is free software; you can redistribute it and/or modify * - * it under the terms of the GNU Library General Public License as * - * published by the Free Software Foundation; either version 2 of the * - * License, or (at your option) any later version. * - * * - * 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 Library General Public * - * License along with this program; if not, write to the * - * Free Software Foundation, Inc., * - * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * - ***************************************************************************/ -#ifndef __CRYPT_H__ -#define __CRYPT_H__ - -#include "libicpf.h" -#include "gen_types.h" - -#ifdef USE_ENCRYPTION - -BEGIN_ICPF_NAMESPACE - -/// output buffer might be in size+16 -LIBICPF_API int_t crypt_aes256(const ptr_t pIn, int_t iCnt, const char_t* pszPass, ptr_t pOut); - -// output buffer has to have iCnt size -LIBICPF_API int_t decrypt_aes256(const ptr_t pIn, int_t iCnt, const char_t* pszPass, ptr_t pOut); - -// out buffer has to be of size ((strlen(pszIn)+1)*sizeof(char_t)+16)*2 -LIBICPF_API int_t strcrypt_aes256(const char_t* pszIn, const char_t* pszPass, char_t* pszOut); - -// out buffer size must be strlen(pszIn)/2 -LIBICPF_API int_t strdecrypt_aes256(const char_t* pszIn, const char_t* pszPass, char_t* pszOut); - -// pszKey of size 64+1B -LIBICPF_API void str2key256(const char_t* pszString, char_t* pszKey); - -END_ICPF_NAMESPACE - -#endif - -#endif Index: ext/libicpf/src/rijndael-alg-fst.c =================================================================== diff -u -N --- ext/libicpf/src/rijndael-alg-fst.c (revision e17c80d36eaa0430313e7d1058aa7a301d1510af) +++ ext/libicpf/src/rijndael-alg-fst.c (revision 0) @@ -1,1402 +0,0 @@ -/** - * rijndael-alg-fst.c - * - * @version 3.0 (December 2000) - * - * Optimised ANSI C code for the Rijndael cipher (now AES) - * - * @author Vincent Rijmen - * @author Antoon Bosselaers - * @author Paulo Barreto - * - * This code is hereby placed in the public domain. - * - * THIS SOFTWARE IS PROVIDED BY THE AUTHORS ''AS IS'' AND ANY EXPRESS - * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE - * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE - * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR - * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF - * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR - * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, - * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE - * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, - * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - */ -#include - -#include - - -#include "rijndael-alg-fst.h" - -/* -Te0[x] = S [x].[02, 01, 01, 03]; -Te1[x] = S [x].[03, 02, 01, 01]; -Te2[x] = S [x].[01, 03, 02, 01]; -Te3[x] = S [x].[01, 01, 03, 02]; -Te4[x] = S [x].[01, 01, 01, 01]; - -Td0[x] = Si[x].[0e, 09, 0d, 0b]; -Td1[x] = Si[x].[0b, 0e, 09, 0d]; -Td2[x] = Si[x].[0d, 0b, 0e, 09]; -Td3[x] = Si[x].[09, 0d, 0b, 0e]; -Td4[x] = Si[x].[01, 01, 01, 01]; -*/ - -static const u32 Te0[256] = { - 0xc66363a5U, 0xf87c7c84U, 0xee777799U, 0xf67b7b8dU, - 0xfff2f20dU, 0xd66b6bbdU, 0xde6f6fb1U, 0x91c5c554U, - 0x60303050U, 0x02010103U, 0xce6767a9U, 0x562b2b7dU, - 0xe7fefe19U, 0xb5d7d762U, 0x4dababe6U, 0xec76769aU, - 0x8fcaca45U, 0x1f82829dU, 0x89c9c940U, 0xfa7d7d87U, - 0xeffafa15U, 0xb25959ebU, 0x8e4747c9U, 0xfbf0f00bU, - 0x41adadecU, 0xb3d4d467U, 0x5fa2a2fdU, 0x45afafeaU, - 0x239c9cbfU, 0x53a4a4f7U, 0xe4727296U, 0x9bc0c05bU, - 0x75b7b7c2U, 0xe1fdfd1cU, 0x3d9393aeU, 0x4c26266aU, - 0x6c36365aU, 0x7e3f3f41U, 0xf5f7f702U, 0x83cccc4fU, - 0x6834345cU, 0x51a5a5f4U, 0xd1e5e534U, 0xf9f1f108U, - 0xe2717193U, 0xabd8d873U, 0x62313153U, 0x2a15153fU, - 0x0804040cU, 0x95c7c752U, 0x46232365U, 0x9dc3c35eU, - 0x30181828U, 0x379696a1U, 0x0a05050fU, 0x2f9a9ab5U, - 0x0e070709U, 0x24121236U, 0x1b80809bU, 0xdfe2e23dU, - 0xcdebeb26U, 0x4e272769U, 0x7fb2b2cdU, 0xea75759fU, - 0x1209091bU, 0x1d83839eU, 0x582c2c74U, 0x341a1a2eU, - 0x361b1b2dU, 0xdc6e6eb2U, 0xb45a5aeeU, 0x5ba0a0fbU, - 0xa45252f6U, 0x763b3b4dU, 0xb7d6d661U, 0x7db3b3ceU, - 0x5229297bU, 0xdde3e33eU, 0x5e2f2f71U, 0x13848497U, - 0xa65353f5U, 0xb9d1d168U, 0x00000000U, 0xc1eded2cU, - 0x40202060U, 0xe3fcfc1fU, 0x79b1b1c8U, 0xb65b5bedU, - 0xd46a6abeU, 0x8dcbcb46U, 0x67bebed9U, 0x7239394bU, - 0x944a4adeU, 0x984c4cd4U, 0xb05858e8U, 0x85cfcf4aU, - 0xbbd0d06bU, 0xc5efef2aU, 0x4faaaae5U, 0xedfbfb16U, - 0x864343c5U, 0x9a4d4dd7U, 0x66333355U, 0x11858594U, - 0x8a4545cfU, 0xe9f9f910U, 0x04020206U, 0xfe7f7f81U, - 0xa05050f0U, 0x783c3c44U, 0x259f9fbaU, 0x4ba8a8e3U, - 0xa25151f3U, 0x5da3a3feU, 0x804040c0U, 0x058f8f8aU, - 0x3f9292adU, 0x219d9dbcU, 0x70383848U, 0xf1f5f504U, - 0x63bcbcdfU, 0x77b6b6c1U, 0xafdada75U, 0x42212163U, - 0x20101030U, 0xe5ffff1aU, 0xfdf3f30eU, 0xbfd2d26dU, - 0x81cdcd4cU, 0x180c0c14U, 0x26131335U, 0xc3ecec2fU, - 0xbe5f5fe1U, 0x359797a2U, 0x884444ccU, 0x2e171739U, - 0x93c4c457U, 0x55a7a7f2U, 0xfc7e7e82U, 0x7a3d3d47U, - 0xc86464acU, 0xba5d5de7U, 0x3219192bU, 0xe6737395U, - 0xc06060a0U, 0x19818198U, 0x9e4f4fd1U, 0xa3dcdc7fU, - 0x44222266U, 0x542a2a7eU, 0x3b9090abU, 0x0b888883U, - 0x8c4646caU, 0xc7eeee29U, 0x6bb8b8d3U, 0x2814143cU, - 0xa7dede79U, 0xbc5e5ee2U, 0x160b0b1dU, 0xaddbdb76U, - 0xdbe0e03bU, 0x64323256U, 0x743a3a4eU, 0x140a0a1eU, - 0x924949dbU, 0x0c06060aU, 0x4824246cU, 0xb85c5ce4U, - 0x9fc2c25dU, 0xbdd3d36eU, 0x43acacefU, 0xc46262a6U, - 0x399191a8U, 0x319595a4U, 0xd3e4e437U, 0xf279798bU, - 0xd5e7e732U, 0x8bc8c843U, 0x6e373759U, 0xda6d6db7U, - 0x018d8d8cU, 0xb1d5d564U, 0x9c4e4ed2U, 0x49a9a9e0U, - 0xd86c6cb4U, 0xac5656faU, 0xf3f4f407U, 0xcfeaea25U, - 0xca6565afU, 0xf47a7a8eU, 0x47aeaee9U, 0x10080818U, - 0x6fbabad5U, 0xf0787888U, 0x4a25256fU, 0x5c2e2e72U, - 0x381c1c24U, 0x57a6a6f1U, 0x73b4b4c7U, 0x97c6c651U, - 0xcbe8e823U, 0xa1dddd7cU, 0xe874749cU, 0x3e1f1f21U, - 0x964b4bddU, 0x61bdbddcU, 0x0d8b8b86U, 0x0f8a8a85U, - 0xe0707090U, 0x7c3e3e42U, 0x71b5b5c4U, 0xcc6666aaU, - 0x904848d8U, 0x06030305U, 0xf7f6f601U, 0x1c0e0e12U, - 0xc26161a3U, 0x6a35355fU, 0xae5757f9U, 0x69b9b9d0U, - 0x17868691U, 0x99c1c158U, 0x3a1d1d27U, 0x279e9eb9U, - 0xd9e1e138U, 0xebf8f813U, 0x2b9898b3U, 0x22111133U, - 0xd26969bbU, 0xa9d9d970U, 0x078e8e89U, 0x339494a7U, - 0x2d9b9bb6U, 0x3c1e1e22U, 0x15878792U, 0xc9e9e920U, - 0x87cece49U, 0xaa5555ffU, 0x50282878U, 0xa5dfdf7aU, - 0x038c8c8fU, 0x59a1a1f8U, 0x09898980U, 0x1a0d0d17U, - 0x65bfbfdaU, 0xd7e6e631U, 0x844242c6U, 0xd06868b8U, - 0x824141c3U, 0x299999b0U, 0x5a2d2d77U, 0x1e0f0f11U, - 0x7bb0b0cbU, 0xa85454fcU, 0x6dbbbbd6U, 0x2c16163aU, -}; -static const u32 Te1[256] = { - 0xa5c66363U, 0x84f87c7cU, 0x99ee7777U, 0x8df67b7bU, - 0x0dfff2f2U, 0xbdd66b6bU, 0xb1de6f6fU, 0x5491c5c5U, - 0x50603030U, 0x03020101U, 0xa9ce6767U, 0x7d562b2bU, - 0x19e7fefeU, 0x62b5d7d7U, 0xe64dababU, 0x9aec7676U, - 0x458fcacaU, 0x9d1f8282U, 0x4089c9c9U, 0x87fa7d7dU, - 0x15effafaU, 0xebb25959U, 0xc98e4747U, 0x0bfbf0f0U, - 0xec41adadU, 0x67b3d4d4U, 0xfd5fa2a2U, 0xea45afafU, - 0xbf239c9cU, 0xf753a4a4U, 0x96e47272U, 0x5b9bc0c0U, - 0xc275b7b7U, 0x1ce1fdfdU, 0xae3d9393U, 0x6a4c2626U, - 0x5a6c3636U, 0x417e3f3fU, 0x02f5f7f7U, 0x4f83ccccU, - 0x5c683434U, 0xf451a5a5U, 0x34d1e5e5U, 0x08f9f1f1U, - 0x93e27171U, 0x73abd8d8U, 0x53623131U, 0x3f2a1515U, - 0x0c080404U, 0x5295c7c7U, 0x65462323U, 0x5e9dc3c3U, - 0x28301818U, 0xa1379696U, 0x0f0a0505U, 0xb52f9a9aU, - 0x090e0707U, 0x36241212U, 0x9b1b8080U, 0x3ddfe2e2U, - 0x26cdebebU, 0x694e2727U, 0xcd7fb2b2U, 0x9fea7575U, - 0x1b120909U, 0x9e1d8383U, 0x74582c2cU, 0x2e341a1aU, - 0x2d361b1bU, 0xb2dc6e6eU, 0xeeb45a5aU, 0xfb5ba0a0U, - 0xf6a45252U, 0x4d763b3bU, 0x61b7d6d6U, 0xce7db3b3U, - 0x7b522929U, 0x3edde3e3U, 0x715e2f2fU, 0x97138484U, - 0xf5a65353U, 0x68b9d1d1U, 0x00000000U, 0x2cc1ededU, - 0x60402020U, 0x1fe3fcfcU, 0xc879b1b1U, 0xedb65b5bU, - 0xbed46a6aU, 0x468dcbcbU, 0xd967bebeU, 0x4b723939U, - 0xde944a4aU, 0xd4984c4cU, 0xe8b05858U, 0x4a85cfcfU, - 0x6bbbd0d0U, 0x2ac5efefU, 0xe54faaaaU, 0x16edfbfbU, - 0xc5864343U, 0xd79a4d4dU, 0x55663333U, 0x94118585U, - 0xcf8a4545U, 0x10e9f9f9U, 0x06040202U, 0x81fe7f7fU, - 0xf0a05050U, 0x44783c3cU, 0xba259f9fU, 0xe34ba8a8U, - 0xf3a25151U, 0xfe5da3a3U, 0xc0804040U, 0x8a058f8fU, - 0xad3f9292U, 0xbc219d9dU, 0x48703838U, 0x04f1f5f5U, - 0xdf63bcbcU, 0xc177b6b6U, 0x75afdadaU, 0x63422121U, - 0x30201010U, 0x1ae5ffffU, 0x0efdf3f3U, 0x6dbfd2d2U, - 0x4c81cdcdU, 0x14180c0cU, 0x35261313U, 0x2fc3ececU, - 0xe1be5f5fU, 0xa2359797U, 0xcc884444U, 0x392e1717U, - 0x5793c4c4U, 0xf255a7a7U, 0x82fc7e7eU, 0x477a3d3dU, - 0xacc86464U, 0xe7ba5d5dU, 0x2b321919U, 0x95e67373U, - 0xa0c06060U, 0x98198181U, 0xd19e4f4fU, 0x7fa3dcdcU, - 0x66442222U, 0x7e542a2aU, 0xab3b9090U, 0x830b8888U, - 0xca8c4646U, 0x29c7eeeeU, 0xd36bb8b8U, 0x3c281414U, - 0x79a7dedeU, 0xe2bc5e5eU, 0x1d160b0bU, 0x76addbdbU, - 0x3bdbe0e0U, 0x56643232U, 0x4e743a3aU, 0x1e140a0aU, - 0xdb924949U, 0x0a0c0606U, 0x6c482424U, 0xe4b85c5cU, - 0x5d9fc2c2U, 0x6ebdd3d3U, 0xef43acacU, 0xa6c46262U, - 0xa8399191U, 0xa4319595U, 0x37d3e4e4U, 0x8bf27979U, - 0x32d5e7e7U, 0x438bc8c8U, 0x596e3737U, 0xb7da6d6dU, - 0x8c018d8dU, 0x64b1d5d5U, 0xd29c4e4eU, 0xe049a9a9U, - 0xb4d86c6cU, 0xfaac5656U, 0x07f3f4f4U, 0x25cfeaeaU, - 0xafca6565U, 0x8ef47a7aU, 0xe947aeaeU, 0x18100808U, - 0xd56fbabaU, 0x88f07878U, 0x6f4a2525U, 0x725c2e2eU, - 0x24381c1cU, 0xf157a6a6U, 0xc773b4b4U, 0x5197c6c6U, - 0x23cbe8e8U, 0x7ca1ddddU, 0x9ce87474U, 0x213e1f1fU, - 0xdd964b4bU, 0xdc61bdbdU, 0x860d8b8bU, 0x850f8a8aU, - 0x90e07070U, 0x427c3e3eU, 0xc471b5b5U, 0xaacc6666U, - 0xd8904848U, 0x05060303U, 0x01f7f6f6U, 0x121c0e0eU, - 0xa3c26161U, 0x5f6a3535U, 0xf9ae5757U, 0xd069b9b9U, - 0x91178686U, 0x5899c1c1U, 0x273a1d1dU, 0xb9279e9eU, - 0x38d9e1e1U, 0x13ebf8f8U, 0xb32b9898U, 0x33221111U, - 0xbbd26969U, 0x70a9d9d9U, 0x89078e8eU, 0xa7339494U, - 0xb62d9b9bU, 0x223c1e1eU, 0x92158787U, 0x20c9e9e9U, - 0x4987ceceU, 0xffaa5555U, 0x78502828U, 0x7aa5dfdfU, - 0x8f038c8cU, 0xf859a1a1U, 0x80098989U, 0x171a0d0dU, - 0xda65bfbfU, 0x31d7e6e6U, 0xc6844242U, 0xb8d06868U, - 0xc3824141U, 0xb0299999U, 0x775a2d2dU, 0x111e0f0fU, - 0xcb7bb0b0U, 0xfca85454U, 0xd66dbbbbU, 0x3a2c1616U, -}; -static const u32 Te2[256] = { - 0x63a5c663U, 0x7c84f87cU, 0x7799ee77U, 0x7b8df67bU, - 0xf20dfff2U, 0x6bbdd66bU, 0x6fb1de6fU, 0xc55491c5U, - 0x30506030U, 0x01030201U, 0x67a9ce67U, 0x2b7d562bU, - 0xfe19e7feU, 0xd762b5d7U, 0xabe64dabU, 0x769aec76U, - 0xca458fcaU, 0x829d1f82U, 0xc94089c9U, 0x7d87fa7dU, - 0xfa15effaU, 0x59ebb259U, 0x47c98e47U, 0xf00bfbf0U, - 0xadec41adU, 0xd467b3d4U, 0xa2fd5fa2U, 0xafea45afU, - 0x9cbf239cU, 0xa4f753a4U, 0x7296e472U, 0xc05b9bc0U, - 0xb7c275b7U, 0xfd1ce1fdU, 0x93ae3d93U, 0x266a4c26U, - 0x365a6c36U, 0x3f417e3fU, 0xf702f5f7U, 0xcc4f83ccU, - 0x345c6834U, 0xa5f451a5U, 0xe534d1e5U, 0xf108f9f1U, - 0x7193e271U, 0xd873abd8U, 0x31536231U, 0x153f2a15U, - 0x040c0804U, 0xc75295c7U, 0x23654623U, 0xc35e9dc3U, - 0x18283018U, 0x96a13796U, 0x050f0a05U, 0x9ab52f9aU, - 0x07090e07U, 0x12362412U, 0x809b1b80U, 0xe23ddfe2U, - 0xeb26cdebU, 0x27694e27U, 0xb2cd7fb2U, 0x759fea75U, - 0x091b1209U, 0x839e1d83U, 0x2c74582cU, 0x1a2e341aU, - 0x1b2d361bU, 0x6eb2dc6eU, 0x5aeeb45aU, 0xa0fb5ba0U, - 0x52f6a452U, 0x3b4d763bU, 0xd661b7d6U, 0xb3ce7db3U, - 0x297b5229U, 0xe33edde3U, 0x2f715e2fU, 0x84971384U, - 0x53f5a653U, 0xd168b9d1U, 0x00000000U, 0xed2cc1edU, - 0x20604020U, 0xfc1fe3fcU, 0xb1c879b1U, 0x5bedb65bU, - 0x6abed46aU, 0xcb468dcbU, 0xbed967beU, 0x394b7239U, - 0x4ade944aU, 0x4cd4984cU, 0x58e8b058U, 0xcf4a85cfU, - 0xd06bbbd0U, 0xef2ac5efU, 0xaae54faaU, 0xfb16edfbU, - 0x43c58643U, 0x4dd79a4dU, 0x33556633U, 0x85941185U, - 0x45cf8a45U, 0xf910e9f9U, 0x02060402U, 0x7f81fe7fU, - 0x50f0a050U, 0x3c44783cU, 0x9fba259fU, 0xa8e34ba8U, - 0x51f3a251U, 0xa3fe5da3U, 0x40c08040U, 0x8f8a058fU, - 0x92ad3f92U, 0x9dbc219dU, 0x38487038U, 0xf504f1f5U, - 0xbcdf63bcU, 0xb6c177b6U, 0xda75afdaU, 0x21634221U, - 0x10302010U, 0xff1ae5ffU, 0xf30efdf3U, 0xd26dbfd2U, - 0xcd4c81cdU, 0x0c14180cU, 0x13352613U, 0xec2fc3ecU, - 0x5fe1be5fU, 0x97a23597U, 0x44cc8844U, 0x17392e17U, - 0xc45793c4U, 0xa7f255a7U, 0x7e82fc7eU, 0x3d477a3dU, - 0x64acc864U, 0x5de7ba5dU, 0x192b3219U, 0x7395e673U, - 0x60a0c060U, 0x81981981U, 0x4fd19e4fU, 0xdc7fa3dcU, - 0x22664422U, 0x2a7e542aU, 0x90ab3b90U, 0x88830b88U, - 0x46ca8c46U, 0xee29c7eeU, 0xb8d36bb8U, 0x143c2814U, - 0xde79a7deU, 0x5ee2bc5eU, 0x0b1d160bU, 0xdb76addbU, - 0xe03bdbe0U, 0x32566432U, 0x3a4e743aU, 0x0a1e140aU, - 0x49db9249U, 0x060a0c06U, 0x246c4824U, 0x5ce4b85cU, - 0xc25d9fc2U, 0xd36ebdd3U, 0xacef43acU, 0x62a6c462U, - 0x91a83991U, 0x95a43195U, 0xe437d3e4U, 0x798bf279U, - 0xe732d5e7U, 0xc8438bc8U, 0x37596e37U, 0x6db7da6dU, - 0x8d8c018dU, 0xd564b1d5U, 0x4ed29c4eU, 0xa9e049a9U, - 0x6cb4d86cU, 0x56faac56U, 0xf407f3f4U, 0xea25cfeaU, - 0x65afca65U, 0x7a8ef47aU, 0xaee947aeU, 0x08181008U, - 0xbad56fbaU, 0x7888f078U, 0x256f4a25U, 0x2e725c2eU, - 0x1c24381cU, 0xa6f157a6U, 0xb4c773b4U, 0xc65197c6U, - 0xe823cbe8U, 0xdd7ca1ddU, 0x749ce874U, 0x1f213e1fU, - 0x4bdd964bU, 0xbddc61bdU, 0x8b860d8bU, 0x8a850f8aU, - 0x7090e070U, 0x3e427c3eU, 0xb5c471b5U, 0x66aacc66U, - 0x48d89048U, 0x03050603U, 0xf601f7f6U, 0x0e121c0eU, - 0x61a3c261U, 0x355f6a35U, 0x57f9ae57U, 0xb9d069b9U, - 0x86911786U, 0xc15899c1U, 0x1d273a1dU, 0x9eb9279eU, - 0xe138d9e1U, 0xf813ebf8U, 0x98b32b98U, 0x11332211U, - 0x69bbd269U, 0xd970a9d9U, 0x8e89078eU, 0x94a73394U, - 0x9bb62d9bU, 0x1e223c1eU, 0x87921587U, 0xe920c9e9U, - 0xce4987ceU, 0x55ffaa55U, 0x28785028U, 0xdf7aa5dfU, - 0x8c8f038cU, 0xa1f859a1U, 0x89800989U, 0x0d171a0dU, - 0xbfda65bfU, 0xe631d7e6U, 0x42c68442U, 0x68b8d068U, - 0x41c38241U, 0x99b02999U, 0x2d775a2dU, 0x0f111e0fU, - 0xb0cb7bb0U, 0x54fca854U, 0xbbd66dbbU, 0x163a2c16U, -}; -static const u32 Te3[256] = { - - 0x6363a5c6U, 0x7c7c84f8U, 0x777799eeU, 0x7b7b8df6U, - 0xf2f20dffU, 0x6b6bbdd6U, 0x6f6fb1deU, 0xc5c55491U, - 0x30305060U, 0x01010302U, 0x6767a9ceU, 0x2b2b7d56U, - 0xfefe19e7U, 0xd7d762b5U, 0xababe64dU, 0x76769aecU, - 0xcaca458fU, 0x82829d1fU, 0xc9c94089U, 0x7d7d87faU, - 0xfafa15efU, 0x5959ebb2U, 0x4747c98eU, 0xf0f00bfbU, - 0xadadec41U, 0xd4d467b3U, 0xa2a2fd5fU, 0xafafea45U, - 0x9c9cbf23U, 0xa4a4f753U, 0x727296e4U, 0xc0c05b9bU, - 0xb7b7c275U, 0xfdfd1ce1U, 0x9393ae3dU, 0x26266a4cU, - 0x36365a6cU, 0x3f3f417eU, 0xf7f702f5U, 0xcccc4f83U, - 0x34345c68U, 0xa5a5f451U, 0xe5e534d1U, 0xf1f108f9U, - 0x717193e2U, 0xd8d873abU, 0x31315362U, 0x15153f2aU, - 0x04040c08U, 0xc7c75295U, 0x23236546U, 0xc3c35e9dU, - 0x18182830U, 0x9696a137U, 0x05050f0aU, 0x9a9ab52fU, - 0x0707090eU, 0x12123624U, 0x80809b1bU, 0xe2e23ddfU, - 0xebeb26cdU, 0x2727694eU, 0xb2b2cd7fU, 0x75759feaU, - 0x09091b12U, 0x83839e1dU, 0x2c2c7458U, 0x1a1a2e34U, - 0x1b1b2d36U, 0x6e6eb2dcU, 0x5a5aeeb4U, 0xa0a0fb5bU, - 0x5252f6a4U, 0x3b3b4d76U, 0xd6d661b7U, 0xb3b3ce7dU, - 0x29297b52U, 0xe3e33eddU, 0x2f2f715eU, 0x84849713U, - 0x5353f5a6U, 0xd1d168b9U, 0x00000000U, 0xeded2cc1U, - 0x20206040U, 0xfcfc1fe3U, 0xb1b1c879U, 0x5b5bedb6U, - 0x6a6abed4U, 0xcbcb468dU, 0xbebed967U, 0x39394b72U, - 0x4a4ade94U, 0x4c4cd498U, 0x5858e8b0U, 0xcfcf4a85U, - 0xd0d06bbbU, 0xefef2ac5U, 0xaaaae54fU, 0xfbfb16edU, - 0x4343c586U, 0x4d4dd79aU, 0x33335566U, 0x85859411U, - 0x4545cf8aU, 0xf9f910e9U, 0x02020604U, 0x7f7f81feU, - 0x5050f0a0U, 0x3c3c4478U, 0x9f9fba25U, 0xa8a8e34bU, - 0x5151f3a2U, 0xa3a3fe5dU, 0x4040c080U, 0x8f8f8a05U, - 0x9292ad3fU, 0x9d9dbc21U, 0x38384870U, 0xf5f504f1U, - 0xbcbcdf63U, 0xb6b6c177U, 0xdada75afU, 0x21216342U, - 0x10103020U, 0xffff1ae5U, 0xf3f30efdU, 0xd2d26dbfU, - 0xcdcd4c81U, 0x0c0c1418U, 0x13133526U, 0xecec2fc3U, - 0x5f5fe1beU, 0x9797a235U, 0x4444cc88U, 0x1717392eU, - 0xc4c45793U, 0xa7a7f255U, 0x7e7e82fcU, 0x3d3d477aU, - 0x6464acc8U, 0x5d5de7baU, 0x19192b32U, 0x737395e6U, - 0x6060a0c0U, 0x81819819U, 0x4f4fd19eU, 0xdcdc7fa3U, - 0x22226644U, 0x2a2a7e54U, 0x9090ab3bU, 0x8888830bU, - 0x4646ca8cU, 0xeeee29c7U, 0xb8b8d36bU, 0x14143c28U, - 0xdede79a7U, 0x5e5ee2bcU, 0x0b0b1d16U, 0xdbdb76adU, - 0xe0e03bdbU, 0x32325664U, 0x3a3a4e74U, 0x0a0a1e14U, - 0x4949db92U, 0x06060a0cU, 0x24246c48U, 0x5c5ce4b8U, - 0xc2c25d9fU, 0xd3d36ebdU, 0xacacef43U, 0x6262a6c4U, - 0x9191a839U, 0x9595a431U, 0xe4e437d3U, 0x79798bf2U, - 0xe7e732d5U, 0xc8c8438bU, 0x3737596eU, 0x6d6db7daU, - 0x8d8d8c01U, 0xd5d564b1U, 0x4e4ed29cU, 0xa9a9e049U, - 0x6c6cb4d8U, 0x5656faacU, 0xf4f407f3U, 0xeaea25cfU, - 0x6565afcaU, 0x7a7a8ef4U, 0xaeaee947U, 0x08081810U, - 0xbabad56fU, 0x787888f0U, 0x25256f4aU, 0x2e2e725cU, - 0x1c1c2438U, 0xa6a6f157U, 0xb4b4c773U, 0xc6c65197U, - 0xe8e823cbU, 0xdddd7ca1U, 0x74749ce8U, 0x1f1f213eU, - 0x4b4bdd96U, 0xbdbddc61U, 0x8b8b860dU, 0x8a8a850fU, - 0x707090e0U, 0x3e3e427cU, 0xb5b5c471U, 0x6666aaccU, - 0x4848d890U, 0x03030506U, 0xf6f601f7U, 0x0e0e121cU, - 0x6161a3c2U, 0x35355f6aU, 0x5757f9aeU, 0xb9b9d069U, - 0x86869117U, 0xc1c15899U, 0x1d1d273aU, 0x9e9eb927U, - 0xe1e138d9U, 0xf8f813ebU, 0x9898b32bU, 0x11113322U, - 0x6969bbd2U, 0xd9d970a9U, 0x8e8e8907U, 0x9494a733U, - 0x9b9bb62dU, 0x1e1e223cU, 0x87879215U, 0xe9e920c9U, - 0xcece4987U, 0x5555ffaaU, 0x28287850U, 0xdfdf7aa5U, - 0x8c8c8f03U, 0xa1a1f859U, 0x89898009U, 0x0d0d171aU, - 0xbfbfda65U, 0xe6e631d7U, 0x4242c684U, 0x6868b8d0U, - 0x4141c382U, 0x9999b029U, 0x2d2d775aU, 0x0f0f111eU, - 0xb0b0cb7bU, 0x5454fca8U, 0xbbbbd66dU, 0x16163a2cU, -}; -static const u32 Te4[256] = { - 0x63636363U, 0x7c7c7c7cU, 0x77777777U, 0x7b7b7b7bU, - 0xf2f2f2f2U, 0x6b6b6b6bU, 0x6f6f6f6fU, 0xc5c5c5c5U, - 0x30303030U, 0x01010101U, 0x67676767U, 0x2b2b2b2bU, - 0xfefefefeU, 0xd7d7d7d7U, 0xababababU, 0x76767676U, - 0xcacacacaU, 0x82828282U, 0xc9c9c9c9U, 0x7d7d7d7dU, - 0xfafafafaU, 0x59595959U, 0x47474747U, 0xf0f0f0f0U, - 0xadadadadU, 0xd4d4d4d4U, 0xa2a2a2a2U, 0xafafafafU, - 0x9c9c9c9cU, 0xa4a4a4a4U, 0x72727272U, 0xc0c0c0c0U, - 0xb7b7b7b7U, 0xfdfdfdfdU, 0x93939393U, 0x26262626U, - 0x36363636U, 0x3f3f3f3fU, 0xf7f7f7f7U, 0xccccccccU, - 0x34343434U, 0xa5a5a5a5U, 0xe5e5e5e5U, 0xf1f1f1f1U, - 0x71717171U, 0xd8d8d8d8U, 0x31313131U, 0x15151515U, - 0x04040404U, 0xc7c7c7c7U, 0x23232323U, 0xc3c3c3c3U, - 0x18181818U, 0x96969696U, 0x05050505U, 0x9a9a9a9aU, - 0x07070707U, 0x12121212U, 0x80808080U, 0xe2e2e2e2U, - 0xebebebebU, 0x27272727U, 0xb2b2b2b2U, 0x75757575U, - 0x09090909U, 0x83838383U, 0x2c2c2c2cU, 0x1a1a1a1aU, - 0x1b1b1b1bU, 0x6e6e6e6eU, 0x5a5a5a5aU, 0xa0a0a0a0U, - 0x52525252U, 0x3b3b3b3bU, 0xd6d6d6d6U, 0xb3b3b3b3U, - 0x29292929U, 0xe3e3e3e3U, 0x2f2f2f2fU, 0x84848484U, - 0x53535353U, 0xd1d1d1d1U, 0x00000000U, 0xededededU, - 0x20202020U, 0xfcfcfcfcU, 0xb1b1b1b1U, 0x5b5b5b5bU, - 0x6a6a6a6aU, 0xcbcbcbcbU, 0xbebebebeU, 0x39393939U, - 0x4a4a4a4aU, 0x4c4c4c4cU, 0x58585858U, 0xcfcfcfcfU, - 0xd0d0d0d0U, 0xefefefefU, 0xaaaaaaaaU, 0xfbfbfbfbU, - 0x43434343U, 0x4d4d4d4dU, 0x33333333U, 0x85858585U, - 0x45454545U, 0xf9f9f9f9U, 0x02020202U, 0x7f7f7f7fU, - 0x50505050U, 0x3c3c3c3cU, 0x9f9f9f9fU, 0xa8a8a8a8U, - 0x51515151U, 0xa3a3a3a3U, 0x40404040U, 0x8f8f8f8fU, - 0x92929292U, 0x9d9d9d9dU, 0x38383838U, 0xf5f5f5f5U, - 0xbcbcbcbcU, 0xb6b6b6b6U, 0xdadadadaU, 0x21212121U, - 0x10101010U, 0xffffffffU, 0xf3f3f3f3U, 0xd2d2d2d2U, - 0xcdcdcdcdU, 0x0c0c0c0cU, 0x13131313U, 0xececececU, - 0x5f5f5f5fU, 0x97979797U, 0x44444444U, 0x17171717U, - 0xc4c4c4c4U, 0xa7a7a7a7U, 0x7e7e7e7eU, 0x3d3d3d3dU, - 0x64646464U, 0x5d5d5d5dU, 0x19191919U, 0x73737373U, - 0x60606060U, 0x81818181U, 0x4f4f4f4fU, 0xdcdcdcdcU, - 0x22222222U, 0x2a2a2a2aU, 0x90909090U, 0x88888888U, - 0x46464646U, 0xeeeeeeeeU, 0xb8b8b8b8U, 0x14141414U, - 0xdedededeU, 0x5e5e5e5eU, 0x0b0b0b0bU, 0xdbdbdbdbU, - 0xe0e0e0e0U, 0x32323232U, 0x3a3a3a3aU, 0x0a0a0a0aU, - 0x49494949U, 0x06060606U, 0x24242424U, 0x5c5c5c5cU, - 0xc2c2c2c2U, 0xd3d3d3d3U, 0xacacacacU, 0x62626262U, - 0x91919191U, 0x95959595U, 0xe4e4e4e4U, 0x79797979U, - 0xe7e7e7e7U, 0xc8c8c8c8U, 0x37373737U, 0x6d6d6d6dU, - 0x8d8d8d8dU, 0xd5d5d5d5U, 0x4e4e4e4eU, 0xa9a9a9a9U, - 0x6c6c6c6cU, 0x56565656U, 0xf4f4f4f4U, 0xeaeaeaeaU, - 0x65656565U, 0x7a7a7a7aU, 0xaeaeaeaeU, 0x08080808U, - 0xbabababaU, 0x78787878U, 0x25252525U, 0x2e2e2e2eU, - 0x1c1c1c1cU, 0xa6a6a6a6U, 0xb4b4b4b4U, 0xc6c6c6c6U, - 0xe8e8e8e8U, 0xddddddddU, 0x74747474U, 0x1f1f1f1fU, - 0x4b4b4b4bU, 0xbdbdbdbdU, 0x8b8b8b8bU, 0x8a8a8a8aU, - 0x70707070U, 0x3e3e3e3eU, 0xb5b5b5b5U, 0x66666666U, - 0x48484848U, 0x03030303U, 0xf6f6f6f6U, 0x0e0e0e0eU, - 0x61616161U, 0x35353535U, 0x57575757U, 0xb9b9b9b9U, - 0x86868686U, 0xc1c1c1c1U, 0x1d1d1d1dU, 0x9e9e9e9eU, - 0xe1e1e1e1U, 0xf8f8f8f8U, 0x98989898U, 0x11111111U, - 0x69696969U, 0xd9d9d9d9U, 0x8e8e8e8eU, 0x94949494U, - 0x9b9b9b9bU, 0x1e1e1e1eU, 0x87878787U, 0xe9e9e9e9U, - 0xcecececeU, 0x55555555U, 0x28282828U, 0xdfdfdfdfU, - 0x8c8c8c8cU, 0xa1a1a1a1U, 0x89898989U, 0x0d0d0d0dU, - 0xbfbfbfbfU, 0xe6e6e6e6U, 0x42424242U, 0x68686868U, - 0x41414141U, 0x99999999U, 0x2d2d2d2dU, 0x0f0f0f0fU, - 0xb0b0b0b0U, 0x54545454U, 0xbbbbbbbbU, 0x16161616U, -}; -static const u32 Td0[256] = { - 0x51f4a750U, 0x7e416553U, 0x1a17a4c3U, 0x3a275e96U, - 0x3bab6bcbU, 0x1f9d45f1U, 0xacfa58abU, 0x4be30393U, - 0x2030fa55U, 0xad766df6U, 0x88cc7691U, 0xf5024c25U, - 0x4fe5d7fcU, 0xc52acbd7U, 0x26354480U, 0xb562a38fU, - 0xdeb15a49U, 0x25ba1b67U, 0x45ea0e98U, 0x5dfec0e1U, - 0xc32f7502U, 0x814cf012U, 0x8d4697a3U, 0x6bd3f9c6U, - 0x038f5fe7U, 0x15929c95U, 0xbf6d7aebU, 0x955259daU, - 0xd4be832dU, 0x587421d3U, 0x49e06929U, 0x8ec9c844U, - 0x75c2896aU, 0xf48e7978U, 0x99583e6bU, 0x27b971ddU, - 0xbee14fb6U, 0xf088ad17U, 0xc920ac66U, 0x7dce3ab4U, - 0x63df4a18U, 0xe51a3182U, 0x97513360U, 0x62537f45U, - 0xb16477e0U, 0xbb6bae84U, 0xfe81a01cU, 0xf9082b94U, - 0x70486858U, 0x8f45fd19U, 0x94de6c87U, 0x527bf8b7U, - 0xab73d323U, 0x724b02e2U, 0xe31f8f57U, 0x6655ab2aU, - 0xb2eb2807U, 0x2fb5c203U, 0x86c57b9aU, 0xd33708a5U, - 0x302887f2U, 0x23bfa5b2U, 0x02036abaU, 0xed16825cU, - 0x8acf1c2bU, 0xa779b492U, 0xf307f2f0U, 0x4e69e2a1U, - 0x65daf4cdU, 0x0605bed5U, 0xd134621fU, 0xc4a6fe8aU, - 0x342e539dU, 0xa2f355a0U, 0x058ae132U, 0xa4f6eb75U, - 0x0b83ec39U, 0x4060efaaU, 0x5e719f06U, 0xbd6e1051U, - 0x3e218af9U, 0x96dd063dU, 0xdd3e05aeU, 0x4de6bd46U, - 0x91548db5U, 0x71c45d05U, 0x0406d46fU, 0x605015ffU, - 0x1998fb24U, 0xd6bde997U, 0x894043ccU, 0x67d99e77U, - 0xb0e842bdU, 0x07898b88U, 0xe7195b38U, 0x79c8eedbU, - 0xa17c0a47U, 0x7c420fe9U, 0xf8841ec9U, 0x00000000U, - 0x09808683U, 0x322bed48U, 0x1e1170acU, 0x6c5a724eU, - 0xfd0efffbU, 0x0f853856U, 0x3daed51eU, 0x362d3927U, - 0x0a0fd964U, 0x685ca621U, 0x9b5b54d1U, 0x24362e3aU, - 0x0c0a67b1U, 0x9357e70fU, 0xb4ee96d2U, 0x1b9b919eU, - 0x80c0c54fU, 0x61dc20a2U, 0x5a774b69U, 0x1c121a16U, - 0xe293ba0aU, 0xc0a02ae5U, 0x3c22e043U, 0x121b171dU, - 0x0e090d0bU, 0xf28bc7adU, 0x2db6a8b9U, 0x141ea9c8U, - 0x57f11985U, 0xaf75074cU, 0xee99ddbbU, 0xa37f60fdU, - 0xf701269fU, 0x5c72f5bcU, 0x44663bc5U, 0x5bfb7e34U, - 0x8b432976U, 0xcb23c6dcU, 0xb6edfc68U, 0xb8e4f163U, - 0xd731dccaU, 0x42638510U, 0x13972240U, 0x84c61120U, - 0x854a247dU, 0xd2bb3df8U, 0xaef93211U, 0xc729a16dU, - 0x1d9e2f4bU, 0xdcb230f3U, 0x0d8652ecU, 0x77c1e3d0U, - 0x2bb3166cU, 0xa970b999U, 0x119448faU, 0x47e96422U, - 0xa8fc8cc4U, 0xa0f03f1aU, 0x567d2cd8U, 0x223390efU, - 0x87494ec7U, 0xd938d1c1U, 0x8ccaa2feU, 0x98d40b36U, - 0xa6f581cfU, 0xa57ade28U, 0xdab78e26U, 0x3fadbfa4U, - 0x2c3a9de4U, 0x5078920dU, 0x6a5fcc9bU, 0x547e4662U, - 0xf68d13c2U, 0x90d8b8e8U, 0x2e39f75eU, 0x82c3aff5U, - 0x9f5d80beU, 0x69d0937cU, 0x6fd52da9U, 0xcf2512b3U, - 0xc8ac993bU, 0x10187da7U, 0xe89c636eU, 0xdb3bbb7bU, - 0xcd267809U, 0x6e5918f4U, 0xec9ab701U, 0x834f9aa8U, - 0xe6956e65U, 0xaaffe67eU, 0x21bccf08U, 0xef15e8e6U, - 0xbae79bd9U, 0x4a6f36ceU, 0xea9f09d4U, 0x29b07cd6U, - 0x31a4b2afU, 0x2a3f2331U, 0xc6a59430U, 0x35a266c0U, - 0x744ebc37U, 0xfc82caa6U, 0xe090d0b0U, 0x33a7d815U, - 0xf104984aU, 0x41ecdaf7U, 0x7fcd500eU, 0x1791f62fU, - 0x764dd68dU, 0x43efb04dU, 0xccaa4d54U, 0xe49604dfU, - 0x9ed1b5e3U, 0x4c6a881bU, 0xc12c1fb8U, 0x4665517fU, - 0x9d5eea04U, 0x018c355dU, 0xfa877473U, 0xfb0b412eU, - 0xb3671d5aU, 0x92dbd252U, 0xe9105633U, 0x6dd64713U, - 0x9ad7618cU, 0x37a10c7aU, 0x59f8148eU, 0xeb133c89U, - 0xcea927eeU, 0xb761c935U, 0xe11ce5edU, 0x7a47b13cU, - 0x9cd2df59U, 0x55f2733fU, 0x1814ce79U, 0x73c737bfU, - 0x53f7cdeaU, 0x5ffdaa5bU, 0xdf3d6f14U, 0x7844db86U, - 0xcaaff381U, 0xb968c43eU, 0x3824342cU, 0xc2a3405fU, - 0x161dc372U, 0xbce2250cU, 0x283c498bU, 0xff0d9541U, - 0x39a80171U, 0x080cb3deU, 0xd8b4e49cU, 0x6456c190U, - 0x7bcb8461U, 0xd532b670U, 0x486c5c74U, 0xd0b85742U, -}; -static const u32 Td1[256] = { - 0x5051f4a7U, 0x537e4165U, 0xc31a17a4U, 0x963a275eU, - 0xcb3bab6bU, 0xf11f9d45U, 0xabacfa58U, 0x934be303U, - 0x552030faU, 0xf6ad766dU, 0x9188cc76U, 0x25f5024cU, - 0xfc4fe5d7U, 0xd7c52acbU, 0x80263544U, 0x8fb562a3U, - 0x49deb15aU, 0x6725ba1bU, 0x9845ea0eU, 0xe15dfec0U, - 0x02c32f75U, 0x12814cf0U, 0xa38d4697U, 0xc66bd3f9U, - 0xe7038f5fU, 0x9515929cU, 0xebbf6d7aU, 0xda955259U, - 0x2dd4be83U, 0xd3587421U, 0x2949e069U, 0x448ec9c8U, - 0x6a75c289U, 0x78f48e79U, 0x6b99583eU, 0xdd27b971U, - 0xb6bee14fU, 0x17f088adU, 0x66c920acU, 0xb47dce3aU, - 0x1863df4aU, 0x82e51a31U, 0x60975133U, 0x4562537fU, - 0xe0b16477U, 0x84bb6baeU, 0x1cfe81a0U, 0x94f9082bU, - 0x58704868U, 0x198f45fdU, 0x8794de6cU, 0xb7527bf8U, - 0x23ab73d3U, 0xe2724b02U, 0x57e31f8fU, 0x2a6655abU, - 0x07b2eb28U, 0x032fb5c2U, 0x9a86c57bU, 0xa5d33708U, - 0xf2302887U, 0xb223bfa5U, 0xba02036aU, 0x5ced1682U, - 0x2b8acf1cU, 0x92a779b4U, 0xf0f307f2U, 0xa14e69e2U, - 0xcd65daf4U, 0xd50605beU, 0x1fd13462U, 0x8ac4a6feU, - 0x9d342e53U, 0xa0a2f355U, 0x32058ae1U, 0x75a4f6ebU, - 0x390b83ecU, 0xaa4060efU, 0x065e719fU, 0x51bd6e10U, - 0xf93e218aU, 0x3d96dd06U, 0xaedd3e05U, 0x464de6bdU, - 0xb591548dU, 0x0571c45dU, 0x6f0406d4U, 0xff605015U, - 0x241998fbU, 0x97d6bde9U, 0xcc894043U, 0x7767d99eU, - 0xbdb0e842U, 0x8807898bU, 0x38e7195bU, 0xdb79c8eeU, - 0x47a17c0aU, 0xe97c420fU, 0xc9f8841eU, 0x00000000U, - 0x83098086U, 0x48322bedU, 0xac1e1170U, 0x4e6c5a72U, - 0xfbfd0effU, 0x560f8538U, 0x1e3daed5U, 0x27362d39U, - 0x640a0fd9U, 0x21685ca6U, 0xd19b5b54U, 0x3a24362eU, - 0xb10c0a67U, 0x0f9357e7U, 0xd2b4ee96U, 0x9e1b9b91U, - 0x4f80c0c5U, 0xa261dc20U, 0x695a774bU, 0x161c121aU, - 0x0ae293baU, 0xe5c0a02aU, 0x433c22e0U, 0x1d121b17U, - 0x0b0e090dU, 0xadf28bc7U, 0xb92db6a8U, 0xc8141ea9U, - 0x8557f119U, 0x4caf7507U, 0xbbee99ddU, 0xfda37f60U, - 0x9ff70126U, 0xbc5c72f5U, 0xc544663bU, 0x345bfb7eU, - 0x768b4329U, 0xdccb23c6U, 0x68b6edfcU, 0x63b8e4f1U, - 0xcad731dcU, 0x10426385U, 0x40139722U, 0x2084c611U, - 0x7d854a24U, 0xf8d2bb3dU, 0x11aef932U, 0x6dc729a1U, - 0x4b1d9e2fU, 0xf3dcb230U, 0xec0d8652U, 0xd077c1e3U, - 0x6c2bb316U, 0x99a970b9U, 0xfa119448U, 0x2247e964U, - 0xc4a8fc8cU, 0x1aa0f03fU, 0xd8567d2cU, 0xef223390U, - 0xc787494eU, 0xc1d938d1U, 0xfe8ccaa2U, 0x3698d40bU, - 0xcfa6f581U, 0x28a57adeU, 0x26dab78eU, 0xa43fadbfU, - 0xe42c3a9dU, 0x0d507892U, 0x9b6a5fccU, 0x62547e46U, - 0xc2f68d13U, 0xe890d8b8U, 0x5e2e39f7U, 0xf582c3afU, - 0xbe9f5d80U, 0x7c69d093U, 0xa96fd52dU, 0xb3cf2512U, - 0x3bc8ac99U, 0xa710187dU, 0x6ee89c63U, 0x7bdb3bbbU, - 0x09cd2678U, 0xf46e5918U, 0x01ec9ab7U, 0xa8834f9aU, - 0x65e6956eU, 0x7eaaffe6U, 0x0821bccfU, 0xe6ef15e8U, - 0xd9bae79bU, 0xce4a6f36U, 0xd4ea9f09U, 0xd629b07cU, - 0xaf31a4b2U, 0x312a3f23U, 0x30c6a594U, 0xc035a266U, - 0x37744ebcU, 0xa6fc82caU, 0xb0e090d0U, 0x1533a7d8U, - 0x4af10498U, 0xf741ecdaU, 0x0e7fcd50U, 0x2f1791f6U, - 0x8d764dd6U, 0x4d43efb0U, 0x54ccaa4dU, 0xdfe49604U, - 0xe39ed1b5U, 0x1b4c6a88U, 0xb8c12c1fU, 0x7f466551U, - 0x049d5eeaU, 0x5d018c35U, 0x73fa8774U, 0x2efb0b41U, - 0x5ab3671dU, 0x5292dbd2U, 0x33e91056U, 0x136dd647U, - 0x8c9ad761U, 0x7a37a10cU, 0x8e59f814U, 0x89eb133cU, - 0xeecea927U, 0x35b761c9U, 0xede11ce5U, 0x3c7a47b1U, - 0x599cd2dfU, 0x3f55f273U, 0x791814ceU, 0xbf73c737U, - 0xea53f7cdU, 0x5b5ffdaaU, 0x14df3d6fU, 0x867844dbU, - 0x81caaff3U, 0x3eb968c4U, 0x2c382434U, 0x5fc2a340U, - 0x72161dc3U, 0x0cbce225U, 0x8b283c49U, 0x41ff0d95U, - 0x7139a801U, 0xde080cb3U, 0x9cd8b4e4U, 0x906456c1U, - 0x617bcb84U, 0x70d532b6U, 0x74486c5cU, 0x42d0b857U, -}; -static const u32 Td2[256] = { - 0xa75051f4U, 0x65537e41U, 0xa4c31a17U, 0x5e963a27U, - 0x6bcb3babU, 0x45f11f9dU, 0x58abacfaU, 0x03934be3U, - 0xfa552030U, 0x6df6ad76U, 0x769188ccU, 0x4c25f502U, - 0xd7fc4fe5U, 0xcbd7c52aU, 0x44802635U, 0xa38fb562U, - 0x5a49deb1U, 0x1b6725baU, 0x0e9845eaU, 0xc0e15dfeU, - 0x7502c32fU, 0xf012814cU, 0x97a38d46U, 0xf9c66bd3U, - 0x5fe7038fU, 0x9c951592U, 0x7aebbf6dU, 0x59da9552U, - 0x832dd4beU, 0x21d35874U, 0x692949e0U, 0xc8448ec9U, - 0x896a75c2U, 0x7978f48eU, 0x3e6b9958U, 0x71dd27b9U, - 0x4fb6bee1U, 0xad17f088U, 0xac66c920U, 0x3ab47dceU, - 0x4a1863dfU, 0x3182e51aU, 0x33609751U, 0x7f456253U, - 0x77e0b164U, 0xae84bb6bU, 0xa01cfe81U, 0x2b94f908U, - 0x68587048U, 0xfd198f45U, 0x6c8794deU, 0xf8b7527bU, - 0xd323ab73U, 0x02e2724bU, 0x8f57e31fU, 0xab2a6655U, - 0x2807b2ebU, 0xc2032fb5U, 0x7b9a86c5U, 0x08a5d337U, - 0x87f23028U, 0xa5b223bfU, 0x6aba0203U, 0x825ced16U, - 0x1c2b8acfU, 0xb492a779U, 0xf2f0f307U, 0xe2a14e69U, - 0xf4cd65daU, 0xbed50605U, 0x621fd134U, 0xfe8ac4a6U, - 0x539d342eU, 0x55a0a2f3U, 0xe132058aU, 0xeb75a4f6U, - 0xec390b83U, 0xefaa4060U, 0x9f065e71U, 0x1051bd6eU, - - 0x8af93e21U, 0x063d96ddU, 0x05aedd3eU, 0xbd464de6U, - 0x8db59154U, 0x5d0571c4U, 0xd46f0406U, 0x15ff6050U, - 0xfb241998U, 0xe997d6bdU, 0x43cc8940U, 0x9e7767d9U, - 0x42bdb0e8U, 0x8b880789U, 0x5b38e719U, 0xeedb79c8U, - 0x0a47a17cU, 0x0fe97c42U, 0x1ec9f884U, 0x00000000U, - 0x86830980U, 0xed48322bU, 0x70ac1e11U, 0x724e6c5aU, - 0xfffbfd0eU, 0x38560f85U, 0xd51e3daeU, 0x3927362dU, - 0xd9640a0fU, 0xa621685cU, 0x54d19b5bU, 0x2e3a2436U, - 0x67b10c0aU, 0xe70f9357U, 0x96d2b4eeU, 0x919e1b9bU, - 0xc54f80c0U, 0x20a261dcU, 0x4b695a77U, 0x1a161c12U, - 0xba0ae293U, 0x2ae5c0a0U, 0xe0433c22U, 0x171d121bU, - 0x0d0b0e09U, 0xc7adf28bU, 0xa8b92db6U, 0xa9c8141eU, - 0x198557f1U, 0x074caf75U, 0xddbbee99U, 0x60fda37fU, - 0x269ff701U, 0xf5bc5c72U, 0x3bc54466U, 0x7e345bfbU, - 0x29768b43U, 0xc6dccb23U, 0xfc68b6edU, 0xf163b8e4U, - 0xdccad731U, 0x85104263U, 0x22401397U, 0x112084c6U, - 0x247d854aU, 0x3df8d2bbU, 0x3211aef9U, 0xa16dc729U, - 0x2f4b1d9eU, 0x30f3dcb2U, 0x52ec0d86U, 0xe3d077c1U, - 0x166c2bb3U, 0xb999a970U, 0x48fa1194U, 0x642247e9U, - 0x8cc4a8fcU, 0x3f1aa0f0U, 0x2cd8567dU, 0x90ef2233U, - 0x4ec78749U, 0xd1c1d938U, 0xa2fe8ccaU, 0x0b3698d4U, - 0x81cfa6f5U, 0xde28a57aU, 0x8e26dab7U, 0xbfa43fadU, - 0x9de42c3aU, 0x920d5078U, 0xcc9b6a5fU, 0x4662547eU, - 0x13c2f68dU, 0xb8e890d8U, 0xf75e2e39U, 0xaff582c3U, - 0x80be9f5dU, 0x937c69d0U, 0x2da96fd5U, 0x12b3cf25U, - 0x993bc8acU, 0x7da71018U, 0x636ee89cU, 0xbb7bdb3bU, - 0x7809cd26U, 0x18f46e59U, 0xb701ec9aU, 0x9aa8834fU, - 0x6e65e695U, 0xe67eaaffU, 0xcf0821bcU, 0xe8e6ef15U, - 0x9bd9bae7U, 0x36ce4a6fU, 0x09d4ea9fU, 0x7cd629b0U, - 0xb2af31a4U, 0x23312a3fU, 0x9430c6a5U, 0x66c035a2U, - 0xbc37744eU, 0xcaa6fc82U, 0xd0b0e090U, 0xd81533a7U, - 0x984af104U, 0xdaf741ecU, 0x500e7fcdU, 0xf62f1791U, - 0xd68d764dU, 0xb04d43efU, 0x4d54ccaaU, 0x04dfe496U, - 0xb5e39ed1U, 0x881b4c6aU, 0x1fb8c12cU, 0x517f4665U, - 0xea049d5eU, 0x355d018cU, 0x7473fa87U, 0x412efb0bU, - 0x1d5ab367U, 0xd25292dbU, 0x5633e910U, 0x47136dd6U, - 0x618c9ad7U, 0x0c7a37a1U, 0x148e59f8U, 0x3c89eb13U, - 0x27eecea9U, 0xc935b761U, 0xe5ede11cU, 0xb13c7a47U, - 0xdf599cd2U, 0x733f55f2U, 0xce791814U, 0x37bf73c7U, - 0xcdea53f7U, 0xaa5b5ffdU, 0x6f14df3dU, 0xdb867844U, - 0xf381caafU, 0xc43eb968U, 0x342c3824U, 0x405fc2a3U, - 0xc372161dU, 0x250cbce2U, 0x498b283cU, 0x9541ff0dU, - 0x017139a8U, 0xb3de080cU, 0xe49cd8b4U, 0xc1906456U, - 0x84617bcbU, 0xb670d532U, 0x5c74486cU, 0x5742d0b8U, -}; -static const u32 Td3[256] = { - 0xf4a75051U, 0x4165537eU, 0x17a4c31aU, 0x275e963aU, - 0xab6bcb3bU, 0x9d45f11fU, 0xfa58abacU, 0xe303934bU, - 0x30fa5520U, 0x766df6adU, 0xcc769188U, 0x024c25f5U, - 0xe5d7fc4fU, 0x2acbd7c5U, 0x35448026U, 0x62a38fb5U, - 0xb15a49deU, 0xba1b6725U, 0xea0e9845U, 0xfec0e15dU, - 0x2f7502c3U, 0x4cf01281U, 0x4697a38dU, 0xd3f9c66bU, - 0x8f5fe703U, 0x929c9515U, 0x6d7aebbfU, 0x5259da95U, - 0xbe832dd4U, 0x7421d358U, 0xe0692949U, 0xc9c8448eU, - 0xc2896a75U, 0x8e7978f4U, 0x583e6b99U, 0xb971dd27U, - 0xe14fb6beU, 0x88ad17f0U, 0x20ac66c9U, 0xce3ab47dU, - 0xdf4a1863U, 0x1a3182e5U, 0x51336097U, 0x537f4562U, - 0x6477e0b1U, 0x6bae84bbU, 0x81a01cfeU, 0x082b94f9U, - 0x48685870U, 0x45fd198fU, 0xde6c8794U, 0x7bf8b752U, - 0x73d323abU, 0x4b02e272U, 0x1f8f57e3U, 0x55ab2a66U, - 0xeb2807b2U, 0xb5c2032fU, 0xc57b9a86U, 0x3708a5d3U, - 0x2887f230U, 0xbfa5b223U, 0x036aba02U, 0x16825cedU, - 0xcf1c2b8aU, 0x79b492a7U, 0x07f2f0f3U, 0x69e2a14eU, - 0xdaf4cd65U, 0x05bed506U, 0x34621fd1U, 0xa6fe8ac4U, - 0x2e539d34U, 0xf355a0a2U, 0x8ae13205U, 0xf6eb75a4U, - 0x83ec390bU, 0x60efaa40U, 0x719f065eU, 0x6e1051bdU, - 0x218af93eU, 0xdd063d96U, 0x3e05aeddU, 0xe6bd464dU, - 0x548db591U, 0xc45d0571U, 0x06d46f04U, 0x5015ff60U, - 0x98fb2419U, 0xbde997d6U, 0x4043cc89U, 0xd99e7767U, - 0xe842bdb0U, 0x898b8807U, 0x195b38e7U, 0xc8eedb79U, - 0x7c0a47a1U, 0x420fe97cU, 0x841ec9f8U, 0x00000000U, - 0x80868309U, 0x2bed4832U, 0x1170ac1eU, 0x5a724e6cU, - 0x0efffbfdU, 0x8538560fU, 0xaed51e3dU, 0x2d392736U, - 0x0fd9640aU, 0x5ca62168U, 0x5b54d19bU, 0x362e3a24U, - 0x0a67b10cU, 0x57e70f93U, 0xee96d2b4U, 0x9b919e1bU, - 0xc0c54f80U, 0xdc20a261U, 0x774b695aU, 0x121a161cU, - 0x93ba0ae2U, 0xa02ae5c0U, 0x22e0433cU, 0x1b171d12U, - 0x090d0b0eU, 0x8bc7adf2U, 0xb6a8b92dU, 0x1ea9c814U, - 0xf1198557U, 0x75074cafU, 0x99ddbbeeU, 0x7f60fda3U, - 0x01269ff7U, 0x72f5bc5cU, 0x663bc544U, 0xfb7e345bU, - 0x4329768bU, 0x23c6dccbU, 0xedfc68b6U, 0xe4f163b8U, - 0x31dccad7U, 0x63851042U, 0x97224013U, 0xc6112084U, - 0x4a247d85U, 0xbb3df8d2U, 0xf93211aeU, 0x29a16dc7U, - 0x9e2f4b1dU, 0xb230f3dcU, 0x8652ec0dU, 0xc1e3d077U, - 0xb3166c2bU, 0x70b999a9U, 0x9448fa11U, 0xe9642247U, - 0xfc8cc4a8U, 0xf03f1aa0U, 0x7d2cd856U, 0x3390ef22U, - 0x494ec787U, 0x38d1c1d9U, 0xcaa2fe8cU, 0xd40b3698U, - 0xf581cfa6U, 0x7ade28a5U, 0xb78e26daU, 0xadbfa43fU, - 0x3a9de42cU, 0x78920d50U, 0x5fcc9b6aU, 0x7e466254U, - 0x8d13c2f6U, 0xd8b8e890U, 0x39f75e2eU, 0xc3aff582U, - 0x5d80be9fU, 0xd0937c69U, 0xd52da96fU, 0x2512b3cfU, - 0xac993bc8U, 0x187da710U, 0x9c636ee8U, 0x3bbb7bdbU, - 0x267809cdU, 0x5918f46eU, 0x9ab701ecU, 0x4f9aa883U, - 0x956e65e6U, 0xffe67eaaU, 0xbccf0821U, 0x15e8e6efU, - 0xe79bd9baU, 0x6f36ce4aU, 0x9f09d4eaU, 0xb07cd629U, - 0xa4b2af31U, 0x3f23312aU, 0xa59430c6U, 0xa266c035U, - 0x4ebc3774U, 0x82caa6fcU, 0x90d0b0e0U, 0xa7d81533U, - 0x04984af1U, 0xecdaf741U, 0xcd500e7fU, 0x91f62f17U, - 0x4dd68d76U, 0xefb04d43U, 0xaa4d54ccU, 0x9604dfe4U, - 0xd1b5e39eU, 0x6a881b4cU, 0x2c1fb8c1U, 0x65517f46U, - 0x5eea049dU, 0x8c355d01U, 0x877473faU, 0x0b412efbU, - 0x671d5ab3U, 0xdbd25292U, 0x105633e9U, 0xd647136dU, - 0xd7618c9aU, 0xa10c7a37U, 0xf8148e59U, 0x133c89ebU, - 0xa927eeceU, 0x61c935b7U, 0x1ce5ede1U, 0x47b13c7aU, - 0xd2df599cU, 0xf2733f55U, 0x14ce7918U, 0xc737bf73U, - 0xf7cdea53U, 0xfdaa5b5fU, 0x3d6f14dfU, 0x44db8678U, - 0xaff381caU, 0x68c43eb9U, 0x24342c38U, 0xa3405fc2U, - 0x1dc37216U, 0xe2250cbcU, 0x3c498b28U, 0x0d9541ffU, - 0xa8017139U, 0x0cb3de08U, 0xb4e49cd8U, 0x56c19064U, - 0xcb84617bU, 0x32b670d5U, 0x6c5c7448U, 0xb85742d0U, -}; -static const u32 Td4[256] = { - 0x52525252U, 0x09090909U, 0x6a6a6a6aU, 0xd5d5d5d5U, - 0x30303030U, 0x36363636U, 0xa5a5a5a5U, 0x38383838U, - 0xbfbfbfbfU, 0x40404040U, 0xa3a3a3a3U, 0x9e9e9e9eU, - 0x81818181U, 0xf3f3f3f3U, 0xd7d7d7d7U, 0xfbfbfbfbU, - 0x7c7c7c7cU, 0xe3e3e3e3U, 0x39393939U, 0x82828282U, - 0x9b9b9b9bU, 0x2f2f2f2fU, 0xffffffffU, 0x87878787U, - 0x34343434U, 0x8e8e8e8eU, 0x43434343U, 0x44444444U, - 0xc4c4c4c4U, 0xdedededeU, 0xe9e9e9e9U, 0xcbcbcbcbU, - 0x54545454U, 0x7b7b7b7bU, 0x94949494U, 0x32323232U, - 0xa6a6a6a6U, 0xc2c2c2c2U, 0x23232323U, 0x3d3d3d3dU, - 0xeeeeeeeeU, 0x4c4c4c4cU, 0x95959595U, 0x0b0b0b0bU, - 0x42424242U, 0xfafafafaU, 0xc3c3c3c3U, 0x4e4e4e4eU, - 0x08080808U, 0x2e2e2e2eU, 0xa1a1a1a1U, 0x66666666U, - 0x28282828U, 0xd9d9d9d9U, 0x24242424U, 0xb2b2b2b2U, - 0x76767676U, 0x5b5b5b5bU, 0xa2a2a2a2U, 0x49494949U, - 0x6d6d6d6dU, 0x8b8b8b8bU, 0xd1d1d1d1U, 0x25252525U, - 0x72727272U, 0xf8f8f8f8U, 0xf6f6f6f6U, 0x64646464U, - 0x86868686U, 0x68686868U, 0x98989898U, 0x16161616U, - 0xd4d4d4d4U, 0xa4a4a4a4U, 0x5c5c5c5cU, 0xccccccccU, - 0x5d5d5d5dU, 0x65656565U, 0xb6b6b6b6U, 0x92929292U, - 0x6c6c6c6cU, 0x70707070U, 0x48484848U, 0x50505050U, - 0xfdfdfdfdU, 0xededededU, 0xb9b9b9b9U, 0xdadadadaU, - 0x5e5e5e5eU, 0x15151515U, 0x46464646U, 0x57575757U, - 0xa7a7a7a7U, 0x8d8d8d8dU, 0x9d9d9d9dU, 0x84848484U, - 0x90909090U, 0xd8d8d8d8U, 0xababababU, 0x00000000U, - 0x8c8c8c8cU, 0xbcbcbcbcU, 0xd3d3d3d3U, 0x0a0a0a0aU, - 0xf7f7f7f7U, 0xe4e4e4e4U, 0x58585858U, 0x05050505U, - 0xb8b8b8b8U, 0xb3b3b3b3U, 0x45454545U, 0x06060606U, - 0xd0d0d0d0U, 0x2c2c2c2cU, 0x1e1e1e1eU, 0x8f8f8f8fU, - 0xcacacacaU, 0x3f3f3f3fU, 0x0f0f0f0fU, 0x02020202U, - 0xc1c1c1c1U, 0xafafafafU, 0xbdbdbdbdU, 0x03030303U, - 0x01010101U, 0x13131313U, 0x8a8a8a8aU, 0x6b6b6b6bU, - 0x3a3a3a3aU, 0x91919191U, 0x11111111U, 0x41414141U, - 0x4f4f4f4fU, 0x67676767U, 0xdcdcdcdcU, 0xeaeaeaeaU, - 0x97979797U, 0xf2f2f2f2U, 0xcfcfcfcfU, 0xcecececeU, - 0xf0f0f0f0U, 0xb4b4b4b4U, 0xe6e6e6e6U, 0x73737373U, - 0x96969696U, 0xacacacacU, 0x74747474U, 0x22222222U, - 0xe7e7e7e7U, 0xadadadadU, 0x35353535U, 0x85858585U, - 0xe2e2e2e2U, 0xf9f9f9f9U, 0x37373737U, 0xe8e8e8e8U, - 0x1c1c1c1cU, 0x75757575U, 0xdfdfdfdfU, 0x6e6e6e6eU, - 0x47474747U, 0xf1f1f1f1U, 0x1a1a1a1aU, 0x71717171U, - 0x1d1d1d1dU, 0x29292929U, 0xc5c5c5c5U, 0x89898989U, - 0x6f6f6f6fU, 0xb7b7b7b7U, 0x62626262U, 0x0e0e0e0eU, - 0xaaaaaaaaU, 0x18181818U, 0xbebebebeU, 0x1b1b1b1bU, - 0xfcfcfcfcU, 0x56565656U, 0x3e3e3e3eU, 0x4b4b4b4bU, - 0xc6c6c6c6U, 0xd2d2d2d2U, 0x79797979U, 0x20202020U, - 0x9a9a9a9aU, 0xdbdbdbdbU, 0xc0c0c0c0U, 0xfefefefeU, - 0x78787878U, 0xcdcdcdcdU, 0x5a5a5a5aU, 0xf4f4f4f4U, - 0x1f1f1f1fU, 0xddddddddU, 0xa8a8a8a8U, 0x33333333U, - 0x88888888U, 0x07070707U, 0xc7c7c7c7U, 0x31313131U, - 0xb1b1b1b1U, 0x12121212U, 0x10101010U, 0x59595959U, - 0x27272727U, 0x80808080U, 0xececececU, 0x5f5f5f5fU, - 0x60606060U, 0x51515151U, 0x7f7f7f7fU, 0xa9a9a9a9U, - 0x19191919U, 0xb5b5b5b5U, 0x4a4a4a4aU, 0x0d0d0d0dU, - 0x2d2d2d2dU, 0xe5e5e5e5U, 0x7a7a7a7aU, 0x9f9f9f9fU, - 0x93939393U, 0xc9c9c9c9U, 0x9c9c9c9cU, 0xefefefefU, - 0xa0a0a0a0U, 0xe0e0e0e0U, 0x3b3b3b3bU, 0x4d4d4d4dU, - 0xaeaeaeaeU, 0x2a2a2a2aU, 0xf5f5f5f5U, 0xb0b0b0b0U, - 0xc8c8c8c8U, 0xebebebebU, 0xbbbbbbbbU, 0x3c3c3c3cU, - 0x83838383U, 0x53535353U, 0x99999999U, 0x61616161U, - 0x17171717U, 0x2b2b2b2bU, 0x04040404U, 0x7e7e7e7eU, - 0xbabababaU, 0x77777777U, 0xd6d6d6d6U, 0x26262626U, - 0xe1e1e1e1U, 0x69696969U, 0x14141414U, 0x63636363U, - 0x55555555U, 0x21212121U, 0x0c0c0c0cU, 0x7d7d7d7dU, -}; -static const u32 rcon[] = { - 0x01000000, 0x02000000, 0x04000000, 0x08000000, - 0x10000000, 0x20000000, 0x40000000, 0x80000000, - 0x1B000000, 0x36000000, /* for 128-bit blocks, Rijndael never uses more than 10 rcon values */ -}; - -#define SWAP(x) (_lrotl(x, 8) & 0x00ff00ff | _lrotr(x, 8) & 0xff00ff00) - -#ifdef _MSC_VER -#define GETU32(p) SWAP(*((u32 *)(p))) -#define PUTU32(ct, st) { *((u32 *)(ct)) = SWAP((st)); } -#else -#define GETU32(pt) (((u32)(pt)[0] << 24) ^ ((u32)(pt)[1] << 16) ^ ((u32)(pt)[2] << 8) ^ ((u32)(pt)[3])) -#define PUTU32(ct, st) { (ct)[0] = (u8)((st) >> 24); (ct)[1] = (u8)((st) >> 16); (ct)[2] = (u8)((st) >> 8); (ct)[3] = (u8)(st); } -#endif - -/** - * Expand the cipher key into the encryption key schedule. - * - * @return the number of rounds for the given cipher key size. - */ -int rijndaelKeySetupEnc(u32 rk[/*4*(Nr + 1)*/], const u8 cipherKey[], int keyBits) { - int i = 0; - u32 temp; - - rk[0] = GETU32(cipherKey ); - rk[1] = GETU32(cipherKey + 4); - rk[2] = GETU32(cipherKey + 8); - rk[3] = GETU32(cipherKey + 12); - if (keyBits == 128) { - for (;;) { - temp = rk[3]; - rk[4] = rk[0] ^ - (Te4[(temp >> 16) & 0xff] & 0xff000000) ^ - (Te4[(temp >> 8) & 0xff] & 0x00ff0000) ^ - (Te4[(temp ) & 0xff] & 0x0000ff00) ^ - (Te4[(temp >> 24) ] & 0x000000ff) ^ - rcon[i]; - rk[5] = rk[1] ^ rk[4]; - rk[6] = rk[2] ^ rk[5]; - rk[7] = rk[3] ^ rk[6]; - if (++i == 10) { - return 10; - } - rk += 4; - } - } - rk[4] = GETU32(cipherKey + 16); - rk[5] = GETU32(cipherKey + 20); - if (keyBits == 192) { - for (;;) { - temp = rk[ 5]; - rk[ 6] = rk[ 0] ^ - (Te4[(temp >> 16) & 0xff] & 0xff000000) ^ - (Te4[(temp >> 8) & 0xff] & 0x00ff0000) ^ - (Te4[(temp ) & 0xff] & 0x0000ff00) ^ - (Te4[(temp >> 24) ] & 0x000000ff) ^ - rcon[i]; - rk[ 7] = rk[ 1] ^ rk[ 6]; - rk[ 8] = rk[ 2] ^ rk[ 7]; - rk[ 9] = rk[ 3] ^ rk[ 8]; - if (++i == 8) { - return 12; - } - rk[10] = rk[ 4] ^ rk[ 9]; - rk[11] = rk[ 5] ^ rk[10]; - rk += 6; - } - } - rk[6] = GETU32(cipherKey + 24); - rk[7] = GETU32(cipherKey + 28); - if (keyBits == 256) { - for (;;) { - temp = rk[ 7]; - rk[ 8] = rk[ 0] ^ - (Te4[(temp >> 16) & 0xff] & 0xff000000) ^ - (Te4[(temp >> 8) & 0xff] & 0x00ff0000) ^ - (Te4[(temp ) & 0xff] & 0x0000ff00) ^ - (Te4[(temp >> 24) ] & 0x000000ff) ^ - rcon[i]; - rk[ 9] = rk[ 1] ^ rk[ 8]; - rk[10] = rk[ 2] ^ rk[ 9]; - rk[11] = rk[ 3] ^ rk[10]; - if (++i == 7) { - return 14; - } - temp = rk[11]; - rk[12] = rk[ 4] ^ - (Te4[(temp >> 24) ] & 0xff000000) ^ - (Te4[(temp >> 16) & 0xff] & 0x00ff0000) ^ - (Te4[(temp >> 8) & 0xff] & 0x0000ff00) ^ - (Te4[(temp ) & 0xff] & 0x000000ff); - rk[13] = rk[ 5] ^ rk[12]; - rk[14] = rk[ 6] ^ rk[13]; - rk[15] = rk[ 7] ^ rk[14]; - - rk += 8; - } - } - return 0; -} - -/** - * Expand the cipher key into the decryption key schedule. - * - * @return the number of rounds for the given cipher key size. - */ -int rijndaelKeySetupDec(u32 rk[/*4*(Nr + 1)*/], const u8 cipherKey[], int keyBits) { - int Nr, i, j; - u32 temp; - - /* expand the cipher key: */ - Nr = rijndaelKeySetupEnc(rk, cipherKey, keyBits); - /* invert the order of the round keys: */ - for (i = 0, j = 4*Nr; i < j; i += 4, j -= 4) { - temp = rk[i ]; rk[i ] = rk[j ]; rk[j ] = temp; - temp = rk[i + 1]; rk[i + 1] = rk[j + 1]; rk[j + 1] = temp; - temp = rk[i + 2]; rk[i + 2] = rk[j + 2]; rk[j + 2] = temp; - temp = rk[i + 3]; rk[i + 3] = rk[j + 3]; rk[j + 3] = temp; - } - /* apply the inverse MixColumn transform to all round keys but the first and the last: */ - for (i = 1; i < Nr; i++) { - rk += 4; - rk[0] = - Td0[Te4[(rk[0] >> 24) ] & 0xff] ^ - Td1[Te4[(rk[0] >> 16) & 0xff] & 0xff] ^ - Td2[Te4[(rk[0] >> 8) & 0xff] & 0xff] ^ - Td3[Te4[(rk[0] ) & 0xff] & 0xff]; - rk[1] = - Td0[Te4[(rk[1] >> 24) ] & 0xff] ^ - Td1[Te4[(rk[1] >> 16) & 0xff] & 0xff] ^ - Td2[Te4[(rk[1] >> 8) & 0xff] & 0xff] ^ - Td3[Te4[(rk[1] ) & 0xff] & 0xff]; - rk[2] = - Td0[Te4[(rk[2] >> 24) ] & 0xff] ^ - Td1[Te4[(rk[2] >> 16) & 0xff] & 0xff] ^ - Td2[Te4[(rk[2] >> 8) & 0xff] & 0xff] ^ - Td3[Te4[(rk[2] ) & 0xff] & 0xff]; - rk[3] = - Td0[Te4[(rk[3] >> 24) ] & 0xff] ^ - Td1[Te4[(rk[3] >> 16) & 0xff] & 0xff] ^ - Td2[Te4[(rk[3] >> 8) & 0xff] & 0xff] ^ - Td3[Te4[(rk[3] ) & 0xff] & 0xff]; - } - return Nr; -} - -void rijndaelEncrypt(const u32 rk[/*4*(Nr + 1)*/], int Nr, const u8 pt[16], u8 ct[16]) { - u32 s0, s1, s2, s3, t0, t1, t2, t3; -#ifndef FULL_UNROLL - int r; -#endif /* ?FULL_UNROLL */ - - /* - * map byte array block to cipher state - * and add initial round key: - */ - s0 = GETU32(pt ) ^ rk[0]; - s1 = GETU32(pt + 4) ^ rk[1]; - s2 = GETU32(pt + 8) ^ rk[2]; - s3 = GETU32(pt + 12) ^ rk[3]; -#ifdef FULL_UNROLL - /* round 1: */ - t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[ 4]; - t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[ 5]; - t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[ 6]; - t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[ 7]; - /* round 2: */ - s0 = Te0[t0 >> 24] ^ Te1[(t1 >> 16) & 0xff] ^ Te2[(t2 >> 8) & 0xff] ^ Te3[t3 & 0xff] ^ rk[ 8]; - s1 = Te0[t1 >> 24] ^ Te1[(t2 >> 16) & 0xff] ^ Te2[(t3 >> 8) & 0xff] ^ Te3[t0 & 0xff] ^ rk[ 9]; - s2 = Te0[t2 >> 24] ^ Te1[(t3 >> 16) & 0xff] ^ Te2[(t0 >> 8) & 0xff] ^ Te3[t1 & 0xff] ^ rk[10]; - s3 = Te0[t3 >> 24] ^ Te1[(t0 >> 16) & 0xff] ^ Te2[(t1 >> 8) & 0xff] ^ Te3[t2 & 0xff] ^ rk[11]; - /* round 3: */ - t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[12]; - t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[13]; - t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[14]; - t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[15]; - /* round 4: */ - s0 = Te0[t0 >> 24] ^ Te1[(t1 >> 16) & 0xff] ^ Te2[(t2 >> 8) & 0xff] ^ Te3[t3 & 0xff] ^ rk[16]; - s1 = Te0[t1 >> 24] ^ Te1[(t2 >> 16) & 0xff] ^ Te2[(t3 >> 8) & 0xff] ^ Te3[t0 & 0xff] ^ rk[17]; - s2 = Te0[t2 >> 24] ^ Te1[(t3 >> 16) & 0xff] ^ Te2[(t0 >> 8) & 0xff] ^ Te3[t1 & 0xff] ^ rk[18]; - s3 = Te0[t3 >> 24] ^ Te1[(t0 >> 16) & 0xff] ^ Te2[(t1 >> 8) & 0xff] ^ Te3[t2 & 0xff] ^ rk[19]; - /* round 5: */ - t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[20]; - t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[21]; - t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[22]; - t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[23]; - /* round 6: */ - s0 = Te0[t0 >> 24] ^ Te1[(t1 >> 16) & 0xff] ^ Te2[(t2 >> 8) & 0xff] ^ Te3[t3 & 0xff] ^ rk[24]; - s1 = Te0[t1 >> 24] ^ Te1[(t2 >> 16) & 0xff] ^ Te2[(t3 >> 8) & 0xff] ^ Te3[t0 & 0xff] ^ rk[25]; - s2 = Te0[t2 >> 24] ^ Te1[(t3 >> 16) & 0xff] ^ Te2[(t0 >> 8) & 0xff] ^ Te3[t1 & 0xff] ^ rk[26]; - s3 = Te0[t3 >> 24] ^ Te1[(t0 >> 16) & 0xff] ^ Te2[(t1 >> 8) & 0xff] ^ Te3[t2 & 0xff] ^ rk[27]; - /* round 7: */ - t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[28]; - t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[29]; - t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[30]; - t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[31]; - /* round 8: */ - s0 = Te0[t0 >> 24] ^ Te1[(t1 >> 16) & 0xff] ^ Te2[(t2 >> 8) & 0xff] ^ Te3[t3 & 0xff] ^ rk[32]; - s1 = Te0[t1 >> 24] ^ Te1[(t2 >> 16) & 0xff] ^ Te2[(t3 >> 8) & 0xff] ^ Te3[t0 & 0xff] ^ rk[33]; - s2 = Te0[t2 >> 24] ^ Te1[(t3 >> 16) & 0xff] ^ Te2[(t0 >> 8) & 0xff] ^ Te3[t1 & 0xff] ^ rk[34]; - s3 = Te0[t3 >> 24] ^ Te1[(t0 >> 16) & 0xff] ^ Te2[(t1 >> 8) & 0xff] ^ Te3[t2 & 0xff] ^ rk[35]; - /* round 9: */ - t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[36]; - t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[37]; - t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[38]; - t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[39]; - if (Nr > 10) { - /* round 10: */ - s0 = Te0[t0 >> 24] ^ Te1[(t1 >> 16) & 0xff] ^ Te2[(t2 >> 8) & 0xff] ^ Te3[t3 & 0xff] ^ rk[40]; - s1 = Te0[t1 >> 24] ^ Te1[(t2 >> 16) & 0xff] ^ Te2[(t3 >> 8) & 0xff] ^ Te3[t0 & 0xff] ^ rk[41]; - s2 = Te0[t2 >> 24] ^ Te1[(t3 >> 16) & 0xff] ^ Te2[(t0 >> 8) & 0xff] ^ Te3[t1 & 0xff] ^ rk[42]; - s3 = Te0[t3 >> 24] ^ Te1[(t0 >> 16) & 0xff] ^ Te2[(t1 >> 8) & 0xff] ^ Te3[t2 & 0xff] ^ rk[43]; - /* round 11: */ - t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[44]; - t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[45]; - t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[46]; - t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[47]; - if (Nr > 12) { - /* round 12: */ - s0 = Te0[t0 >> 24] ^ Te1[(t1 >> 16) & 0xff] ^ Te2[(t2 >> 8) & 0xff] ^ Te3[t3 & 0xff] ^ rk[48]; - s1 = Te0[t1 >> 24] ^ Te1[(t2 >> 16) & 0xff] ^ Te2[(t3 >> 8) & 0xff] ^ Te3[t0 & 0xff] ^ rk[49]; - s2 = Te0[t2 >> 24] ^ Te1[(t3 >> 16) & 0xff] ^ Te2[(t0 >> 8) & 0xff] ^ Te3[t1 & 0xff] ^ rk[50]; - s3 = Te0[t3 >> 24] ^ Te1[(t0 >> 16) & 0xff] ^ Te2[(t1 >> 8) & 0xff] ^ Te3[t2 & 0xff] ^ rk[51]; - /* round 13: */ - t0 = Te0[s0 >> 24] ^ Te1[(s1 >> 16) & 0xff] ^ Te2[(s2 >> 8) & 0xff] ^ Te3[s3 & 0xff] ^ rk[52]; - t1 = Te0[s1 >> 24] ^ Te1[(s2 >> 16) & 0xff] ^ Te2[(s3 >> 8) & 0xff] ^ Te3[s0 & 0xff] ^ rk[53]; - t2 = Te0[s2 >> 24] ^ Te1[(s3 >> 16) & 0xff] ^ Te2[(s0 >> 8) & 0xff] ^ Te3[s1 & 0xff] ^ rk[54]; - t3 = Te0[s3 >> 24] ^ Te1[(s0 >> 16) & 0xff] ^ Te2[(s1 >> 8) & 0xff] ^ Te3[s2 & 0xff] ^ rk[55]; - } - } - rk += Nr << 2; -#else /* !FULL_UNROLL */ - /* - * Nr - 1 full rounds: - */ - r = Nr >> 1; - for (;;) { - t0 = - Te0[(s0 >> 24) ] ^ - Te1[(s1 >> 16) & 0xff] ^ - Te2[(s2 >> 8) & 0xff] ^ - Te3[(s3 ) & 0xff] ^ - rk[4]; - t1 = - Te0[(s1 >> 24) ] ^ - Te1[(s2 >> 16) & 0xff] ^ - Te2[(s3 >> 8) & 0xff] ^ - Te3[(s0 ) & 0xff] ^ - rk[5]; - t2 = - Te0[(s2 >> 24) ] ^ - Te1[(s3 >> 16) & 0xff] ^ - Te2[(s0 >> 8) & 0xff] ^ - Te3[(s1 ) & 0xff] ^ - rk[6]; - t3 = - Te0[(s3 >> 24) ] ^ - Te1[(s0 >> 16) & 0xff] ^ - Te2[(s1 >> 8) & 0xff] ^ - Te3[(s2 ) & 0xff] ^ - rk[7]; - - rk += 8; - if (--r == 0) { - break; - } - - s0 = - Te0[(t0 >> 24) ] ^ - Te1[(t1 >> 16) & 0xff] ^ - Te2[(t2 >> 8) & 0xff] ^ - Te3[(t3 ) & 0xff] ^ - rk[0]; - s1 = - Te0[(t1 >> 24) ] ^ - Te1[(t2 >> 16) & 0xff] ^ - Te2[(t3 >> 8) & 0xff] ^ - Te3[(t0 ) & 0xff] ^ - rk[1]; - s2 = - Te0[(t2 >> 24) ] ^ - Te1[(t3 >> 16) & 0xff] ^ - Te2[(t0 >> 8) & 0xff] ^ - Te3[(t1 ) & 0xff] ^ - rk[2]; - s3 = - Te0[(t3 >> 24) ] ^ - Te1[(t0 >> 16) & 0xff] ^ - Te2[(t1 >> 8) & 0xff] ^ - Te3[(t2 ) & 0xff] ^ - rk[3]; - } -#endif /* ?FULL_UNROLL */ - /* - * apply last round and - * map cipher state to byte array block: - */ - s0 = - (Te4[(t0 >> 24) ] & 0xff000000) ^ - (Te4[(t1 >> 16) & 0xff] & 0x00ff0000) ^ - (Te4[(t2 >> 8) & 0xff] & 0x0000ff00) ^ - (Te4[(t3 ) & 0xff] & 0x000000ff) ^ - rk[0]; - PUTU32(ct , s0); - s1 = - (Te4[(t1 >> 24) ] & 0xff000000) ^ - (Te4[(t2 >> 16) & 0xff] & 0x00ff0000) ^ - (Te4[(t3 >> 8) & 0xff] & 0x0000ff00) ^ - (Te4[(t0 ) & 0xff] & 0x000000ff) ^ - rk[1]; - PUTU32(ct + 4, s1); - s2 = - (Te4[(t2 >> 24) ] & 0xff000000) ^ - (Te4[(t3 >> 16) & 0xff] & 0x00ff0000) ^ - (Te4[(t0 >> 8) & 0xff] & 0x0000ff00) ^ - (Te4[(t1 ) & 0xff] & 0x000000ff) ^ - rk[2]; - PUTU32(ct + 8, s2); - s3 = - (Te4[(t3 >> 24) ] & 0xff000000) ^ - (Te4[(t0 >> 16) & 0xff] & 0x00ff0000) ^ - (Te4[(t1 >> 8) & 0xff] & 0x0000ff00) ^ - (Te4[(t2 ) & 0xff] & 0x000000ff) ^ - rk[3]; - PUTU32(ct + 12, s3); -} - -void rijndaelDecrypt(const u32 rk[/*4*(Nr + 1)*/], int Nr, const u8 ct[16], u8 pt[16]) { - u32 s0, s1, s2, s3, t0, t1, t2, t3; -#ifndef FULL_UNROLL - int r; -#endif /* ?FULL_UNROLL */ - - /* - * map byte array block to cipher state - * and add initial round key: - */ - s0 = GETU32(ct ) ^ rk[0]; - s1 = GETU32(ct + 4) ^ rk[1]; - s2 = GETU32(ct + 8) ^ rk[2]; - s3 = GETU32(ct + 12) ^ rk[3]; -#ifdef FULL_UNROLL - /* round 1: */ - t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[ 4]; - t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[ 5]; - t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[ 6]; - t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[ 7]; - /* round 2: */ - s0 = Td0[t0 >> 24] ^ Td1[(t3 >> 16) & 0xff] ^ Td2[(t2 >> 8) & 0xff] ^ Td3[t1 & 0xff] ^ rk[ 8]; - s1 = Td0[t1 >> 24] ^ Td1[(t0 >> 16) & 0xff] ^ Td2[(t3 >> 8) & 0xff] ^ Td3[t2 & 0xff] ^ rk[ 9]; - s2 = Td0[t2 >> 24] ^ Td1[(t1 >> 16) & 0xff] ^ Td2[(t0 >> 8) & 0xff] ^ Td3[t3 & 0xff] ^ rk[10]; - s3 = Td0[t3 >> 24] ^ Td1[(t2 >> 16) & 0xff] ^ Td2[(t1 >> 8) & 0xff] ^ Td3[t0 & 0xff] ^ rk[11]; - /* round 3: */ - t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[12]; - t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[13]; - t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[14]; - t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[15]; - /* round 4: */ - s0 = Td0[t0 >> 24] ^ Td1[(t3 >> 16) & 0xff] ^ Td2[(t2 >> 8) & 0xff] ^ Td3[t1 & 0xff] ^ rk[16]; - s1 = Td0[t1 >> 24] ^ Td1[(t0 >> 16) & 0xff] ^ Td2[(t3 >> 8) & 0xff] ^ Td3[t2 & 0xff] ^ rk[17]; - s2 = Td0[t2 >> 24] ^ Td1[(t1 >> 16) & 0xff] ^ Td2[(t0 >> 8) & 0xff] ^ Td3[t3 & 0xff] ^ rk[18]; - s3 = Td0[t3 >> 24] ^ Td1[(t2 >> 16) & 0xff] ^ Td2[(t1 >> 8) & 0xff] ^ Td3[t0 & 0xff] ^ rk[19]; - /* round 5: */ - t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[20]; - t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[21]; - t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[22]; - t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[23]; - /* round 6: */ - s0 = Td0[t0 >> 24] ^ Td1[(t3 >> 16) & 0xff] ^ Td2[(t2 >> 8) & 0xff] ^ Td3[t1 & 0xff] ^ rk[24]; - s1 = Td0[t1 >> 24] ^ Td1[(t0 >> 16) & 0xff] ^ Td2[(t3 >> 8) & 0xff] ^ Td3[t2 & 0xff] ^ rk[25]; - s2 = Td0[t2 >> 24] ^ Td1[(t1 >> 16) & 0xff] ^ Td2[(t0 >> 8) & 0xff] ^ Td3[t3 & 0xff] ^ rk[26]; - s3 = Td0[t3 >> 24] ^ Td1[(t2 >> 16) & 0xff] ^ Td2[(t1 >> 8) & 0xff] ^ Td3[t0 & 0xff] ^ rk[27]; - /* round 7: */ - t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[28]; - t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[29]; - t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[30]; - t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[31]; - /* round 8: */ - s0 = Td0[t0 >> 24] ^ Td1[(t3 >> 16) & 0xff] ^ Td2[(t2 >> 8) & 0xff] ^ Td3[t1 & 0xff] ^ rk[32]; - s1 = Td0[t1 >> 24] ^ Td1[(t0 >> 16) & 0xff] ^ Td2[(t3 >> 8) & 0xff] ^ Td3[t2 & 0xff] ^ rk[33]; - s2 = Td0[t2 >> 24] ^ Td1[(t1 >> 16) & 0xff] ^ Td2[(t0 >> 8) & 0xff] ^ Td3[t3 & 0xff] ^ rk[34]; - s3 = Td0[t3 >> 24] ^ Td1[(t2 >> 16) & 0xff] ^ Td2[(t1 >> 8) & 0xff] ^ Td3[t0 & 0xff] ^ rk[35]; - /* round 9: */ - t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[36]; - t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[37]; - t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[38]; - t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[39]; - if (Nr > 10) { - /* round 10: */ - s0 = Td0[t0 >> 24] ^ Td1[(t3 >> 16) & 0xff] ^ Td2[(t2 >> 8) & 0xff] ^ Td3[t1 & 0xff] ^ rk[40]; - s1 = Td0[t1 >> 24] ^ Td1[(t0 >> 16) & 0xff] ^ Td2[(t3 >> 8) & 0xff] ^ Td3[t2 & 0xff] ^ rk[41]; - s2 = Td0[t2 >> 24] ^ Td1[(t1 >> 16) & 0xff] ^ Td2[(t0 >> 8) & 0xff] ^ Td3[t3 & 0xff] ^ rk[42]; - s3 = Td0[t3 >> 24] ^ Td1[(t2 >> 16) & 0xff] ^ Td2[(t1 >> 8) & 0xff] ^ Td3[t0 & 0xff] ^ rk[43]; - /* round 11: */ - t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[44]; - t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[45]; - t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[46]; - t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[47]; - if (Nr > 12) { - /* round 12: */ - s0 = Td0[t0 >> 24] ^ Td1[(t3 >> 16) & 0xff] ^ Td2[(t2 >> 8) & 0xff] ^ Td3[t1 & 0xff] ^ rk[48]; - s1 = Td0[t1 >> 24] ^ Td1[(t0 >> 16) & 0xff] ^ Td2[(t3 >> 8) & 0xff] ^ Td3[t2 & 0xff] ^ rk[49]; - s2 = Td0[t2 >> 24] ^ Td1[(t1 >> 16) & 0xff] ^ Td2[(t0 >> 8) & 0xff] ^ Td3[t3 & 0xff] ^ rk[50]; - s3 = Td0[t3 >> 24] ^ Td1[(t2 >> 16) & 0xff] ^ Td2[(t1 >> 8) & 0xff] ^ Td3[t0 & 0xff] ^ rk[51]; - /* round 13: */ - t0 = Td0[s0 >> 24] ^ Td1[(s3 >> 16) & 0xff] ^ Td2[(s2 >> 8) & 0xff] ^ Td3[s1 & 0xff] ^ rk[52]; - t1 = Td0[s1 >> 24] ^ Td1[(s0 >> 16) & 0xff] ^ Td2[(s3 >> 8) & 0xff] ^ Td3[s2 & 0xff] ^ rk[53]; - t2 = Td0[s2 >> 24] ^ Td1[(s1 >> 16) & 0xff] ^ Td2[(s0 >> 8) & 0xff] ^ Td3[s3 & 0xff] ^ rk[54]; - t3 = Td0[s3 >> 24] ^ Td1[(s2 >> 16) & 0xff] ^ Td2[(s1 >> 8) & 0xff] ^ Td3[s0 & 0xff] ^ rk[55]; - } - } - rk += Nr << 2; -#else /* !FULL_UNROLL */ - /* - * Nr - 1 full rounds: - */ - r = Nr >> 1; - for (;;) { - t0 = - Td0[(s0 >> 24) ] ^ - Td1[(s3 >> 16) & 0xff] ^ - Td2[(s2 >> 8) & 0xff] ^ - Td3[(s1 ) & 0xff] ^ - rk[4]; - t1 = - Td0[(s1 >> 24) ] ^ - Td1[(s0 >> 16) & 0xff] ^ - Td2[(s3 >> 8) & 0xff] ^ - Td3[(s2 ) & 0xff] ^ - rk[5]; - t2 = - Td0[(s2 >> 24) ] ^ - Td1[(s1 >> 16) & 0xff] ^ - Td2[(s0 >> 8) & 0xff] ^ - Td3[(s3 ) & 0xff] ^ - rk[6]; - t3 = - Td0[(s3 >> 24) ] ^ - Td1[(s2 >> 16) & 0xff] ^ - Td2[(s1 >> 8) & 0xff] ^ - Td3[(s0 ) & 0xff] ^ - rk[7]; - - rk += 8; - if (--r == 0) { - break; - } - - s0 = - Td0[(t0 >> 24) ] ^ - Td1[(t3 >> 16) & 0xff] ^ - Td2[(t2 >> 8) & 0xff] ^ - Td3[(t1 ) & 0xff] ^ - rk[0]; - s1 = - Td0[(t1 >> 24) ] ^ - Td1[(t0 >> 16) & 0xff] ^ - Td2[(t3 >> 8) & 0xff] ^ - Td3[(t2 ) & 0xff] ^ - rk[1]; - s2 = - Td0[(t2 >> 24) ] ^ - Td1[(t1 >> 16) & 0xff] ^ - Td2[(t0 >> 8) & 0xff] ^ - Td3[(t3 ) & 0xff] ^ - rk[2]; - s3 = - Td0[(t3 >> 24) ] ^ - Td1[(t2 >> 16) & 0xff] ^ - Td2[(t1 >> 8) & 0xff] ^ - Td3[(t0 ) & 0xff] ^ - rk[3]; - } -#endif /* ?FULL_UNROLL */ - /* - * apply last round and - * map cipher state to byte array block: - */ - s0 = - (Td4[(t0 >> 24) ] & 0xff000000) ^ - (Td4[(t3 >> 16) & 0xff] & 0x00ff0000) ^ - (Td4[(t2 >> 8) & 0xff] & 0x0000ff00) ^ - (Td4[(t1 ) & 0xff] & 0x000000ff) ^ - rk[0]; - PUTU32(pt , s0); - s1 = - (Td4[(t1 >> 24) ] & 0xff000000) ^ - (Td4[(t0 >> 16) & 0xff] & 0x00ff0000) ^ - (Td4[(t3 >> 8) & 0xff] & 0x0000ff00) ^ - (Td4[(t2 ) & 0xff] & 0x000000ff) ^ - rk[1]; - PUTU32(pt + 4, s1); - s2 = - (Td4[(t2 >> 24) ] & 0xff000000) ^ - (Td4[(t1 >> 16) & 0xff] & 0x00ff0000) ^ - (Td4[(t0 >> 8) & 0xff] & 0x0000ff00) ^ - (Td4[(t3 ) & 0xff] & 0x000000ff) ^ - rk[2]; - PUTU32(pt + 8, s2); - s3 = - (Td4[(t3 >> 24) ] & 0xff000000) ^ - (Td4[(t2 >> 16) & 0xff] & 0x00ff0000) ^ - (Td4[(t1 >> 8) & 0xff] & 0x0000ff00) ^ - (Td4[(t0 ) & 0xff] & 0x000000ff) ^ - rk[3]; - PUTU32(pt + 12, s3); -} - -#ifdef INTERMEDIATE_VALUE_KAT - -void rijndaelEncryptRound(const u32 rk[/*4*(Nr + 1)*/], int Nr, u8 block[16], int rounds) { - int r; - u32 s0, s1, s2, s3, t0, t1, t2, t3; - - /* - * map byte array block to cipher state - * and add initial round key: - */ - s0 = GETU32(block ) ^ rk[0]; - s1 = GETU32(block + 4) ^ rk[1]; - s2 = GETU32(block + 8) ^ rk[2]; - s3 = GETU32(block + 12) ^ rk[3]; - rk += 4; - - /* - * Nr - 1 full rounds: - */ - for (r = (rounds < Nr ? rounds : Nr - 1); r > 0; r--) { - t0 = - Te0[(s0 >> 24) ] ^ - Te1[(s1 >> 16) & 0xff] ^ - Te2[(s2 >> 8) & 0xff] ^ - Te3[(s3 ) & 0xff] ^ - rk[0]; - t1 = - Te0[(s1 >> 24) ] ^ - Te1[(s2 >> 16) & 0xff] ^ - Te2[(s3 >> 8) & 0xff] ^ - Te3[(s0 ) & 0xff] ^ - rk[1]; - t2 = - Te0[(s2 >> 24) ] ^ - Te1[(s3 >> 16) & 0xff] ^ - Te2[(s0 >> 8) & 0xff] ^ - Te3[(s1 ) & 0xff] ^ - rk[2]; - t3 = - Te0[(s3 >> 24) ] ^ - Te1[(s0 >> 16) & 0xff] ^ - Te2[(s1 >> 8) & 0xff] ^ - Te3[(s2 ) & 0xff] ^ - rk[3]; - - s0 = t0; - s1 = t1; - s2 = t2; - s3 = t3; - rk += 4; - - } - - /* - * apply last round and - * map cipher state to byte array block: - */ - if (rounds == Nr) { - t0 = - (Te4[(s0 >> 24) ] & 0xff000000) ^ - (Te4[(s1 >> 16) & 0xff] & 0x00ff0000) ^ - (Te4[(s2 >> 8) & 0xff] & 0x0000ff00) ^ - (Te4[(s3 ) & 0xff] & 0x000000ff) ^ - rk[0]; - t1 = - (Te4[(s1 >> 24) ] & 0xff000000) ^ - (Te4[(s2 >> 16) & 0xff] & 0x00ff0000) ^ - (Te4[(s3 >> 8) & 0xff] & 0x0000ff00) ^ - (Te4[(s0 ) & 0xff] & 0x000000ff) ^ - rk[1]; - t2 = - (Te4[(s2 >> 24) ] & 0xff000000) ^ - (Te4[(s3 >> 16) & 0xff] & 0x00ff0000) ^ - (Te4[(s0 >> 8) & 0xff] & 0x0000ff00) ^ - (Te4[(s1 ) & 0xff] & 0x000000ff) ^ - rk[2]; - t3 = - (Te4[(s3 >> 24) ] & 0xff000000) ^ - (Te4[(s0 >> 16) & 0xff] & 0x00ff0000) ^ - (Te4[(s1 >> 8) & 0xff] & 0x0000ff00) ^ - (Te4[(s2 ) & 0xff] & 0x000000ff) ^ - rk[3]; - - s0 = t0; - s1 = t1; - s2 = t2; - s3 = t3; - } - - PUTU32(block , s0); - PUTU32(block + 4, s1); - PUTU32(block + 8, s2); - PUTU32(block + 12, s3); -} - -void rijndaelDecryptRound(const u32 rk[/*4*(Nr + 1)*/], int Nr, u8 block[16], int rounds) { - int r; - u32 s0, s1, s2, s3, t0, t1, t2, t3; - - /* - * map byte array block to cipher state - * and add initial round key: - */ - s0 = GETU32(block ) ^ rk[0]; - s1 = GETU32(block + 4) ^ rk[1]; - s2 = GETU32(block + 8) ^ rk[2]; - s3 = GETU32(block + 12) ^ rk[3]; - rk += 4; - - /* - * Nr - 1 full rounds: - */ - for (r = (rounds < Nr ? rounds : Nr) - 1; r > 0; r--) { - t0 = - Td0[(s0 >> 24) ] ^ - Td1[(s3 >> 16) & 0xff] ^ - Td2[(s2 >> 8) & 0xff] ^ - Td3[(s1 ) & 0xff] ^ - rk[0]; - t1 = - Td0[(s1 >> 24) ] ^ - Td1[(s0 >> 16) & 0xff] ^ - Td2[(s3 >> 8) & 0xff] ^ - Td3[(s2 ) & 0xff] ^ - rk[1]; - t2 = - Td0[(s2 >> 24) ] ^ - Td1[(s1 >> 16) & 0xff] ^ - Td2[(s0 >> 8) & 0xff] ^ - Td3[(s3 ) & 0xff] ^ - rk[2]; - t3 = - Td0[(s3 >> 24) ] ^ - Td1[(s2 >> 16) & 0xff] ^ - Td2[(s1 >> 8) & 0xff] ^ - Td3[(s0 ) & 0xff] ^ - rk[3]; - - s0 = t0; - s1 = t1; - s2 = t2; - s3 = t3; - rk += 4; - - } - - /* - * complete the last round and - * map cipher state to byte array block: - */ - t0 = - (Td4[(s0 >> 24) ] & 0xff000000) ^ - (Td4[(s3 >> 16) & 0xff] & 0x00ff0000) ^ - (Td4[(s2 >> 8) & 0xff] & 0x0000ff00) ^ - (Td4[(s1 ) & 0xff] & 0x000000ff); - t1 = - (Td4[(s1 >> 24) ] & 0xff000000) ^ - (Td4[(s0 >> 16) & 0xff] & 0x00ff0000) ^ - (Td4[(s3 >> 8) & 0xff] & 0x0000ff00) ^ - (Td4[(s2 ) & 0xff] & 0x000000ff); - t2 = - (Td4[(s2 >> 24) ] & 0xff000000) ^ - (Td4[(s1 >> 16) & 0xff] & 0x00ff0000) ^ - (Td4[(s0 >> 8) & 0xff] & 0x0000ff00) ^ - (Td4[(s3 ) & 0xff] & 0x000000ff); - t3 = - (Td4[(s3 >> 24) ] & 0xff000000) ^ - (Td4[(s2 >> 16) & 0xff] & 0x00ff0000) ^ - (Td4[(s1 >> 8) & 0xff] & 0x0000ff00) ^ - (Td4[(s0 ) & 0xff] & 0x000000ff); - - if (rounds == Nr) { - t0 ^= rk[0]; - t1 ^= rk[1]; - t2 ^= rk[2]; - t3 ^= rk[3]; - } - - PUTU32(block , t0); - PUTU32(block + 4, t1); - PUTU32(block + 8, t2); - PUTU32(block + 12, t3); -} - -#endif /* INTERMEDIATE_VALUE_KAT */ Index: ext/libicpf/src/rijndael-alg-fst.h =================================================================== diff -u -N --- ext/libicpf/src/rijndael-alg-fst.h (revision e17c80d36eaa0430313e7d1058aa7a301d1510af) +++ ext/libicpf/src/rijndael-alg-fst.h (revision 0) @@ -1,47 +0,0 @@ -/** - * rijndael-alg-fst.h - * - * @version 3.0 (December 2000) - * - * Optimised ANSI C code for the Rijndael cipher (now AES) - * - * @author Vincent Rijmen - * @author Antoon Bosselaers - * @author Paulo Barreto - * - * This code is hereby placed in the public domain. - * - * THIS SOFTWARE IS PROVIDED BY THE AUTHORS ''AS IS'' AND ANY EXPRESS - * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE - * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE - * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR - * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF - * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR - * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, - * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE - * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, - * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - */ -#ifndef __RIJNDAEL_ALG_FST_H -#define __RIJNDAEL_ALG_FST_H - -#define MAXKC (256/32) -#define MAXKB (256/8) -#define MAXNR 14 - -typedef unsigned char u8; -typedef unsigned short u16; -typedef unsigned int u32; - -int rijndaelKeySetupEnc(u32 rk[/*4*(Nr + 1)*/], const u8 cipherKey[], int keyBits); -int rijndaelKeySetupDec(u32 rk[/*4*(Nr + 1)*/], const u8 cipherKey[], int keyBits); -void rijndaelEncrypt(const u32 rk[/*4*(Nr + 1)*/], int Nr, const u8 pt[16], u8 ct[16]); -void rijndaelDecrypt(const u32 rk[/*4*(Nr + 1)*/], int Nr, const u8 ct[16], u8 pt[16]); - -#ifdef INTERMEDIATE_VALUE_KAT -void rijndaelEncryptRound(const u32 rk[/*4*(Nr + 1)*/], int Nr, u8 block[16], int rounds); -void rijndaelDecryptRound(const u32 rk[/*4*(Nr + 1)*/], int Nr, u8 block[16], int rounds); -#endif /* INTERMEDIATE_VALUE_KAT */ - -#endif /* __RIJNDAEL_ALG_FST_H */ Index: ext/libicpf/src/rijndael-api-fst.c =================================================================== diff -u -N --- ext/libicpf/src/rijndael-api-fst.c (revision e17c80d36eaa0430313e7d1058aa7a301d1510af) +++ ext/libicpf/src/rijndael-api-fst.c (revision 0) @@ -1,444 +0,0 @@ -/** - * rijndael-api-fst.c - * - * @version 2.9 (December 2000) - * - * Optimised ANSI C code for the Rijndael cipher (now AES) - * - * @author Vincent Rijmen - * @author Antoon Bosselaers - * @author Paulo Barreto - * - * This code is hereby placed in the public domain. - * - * THIS SOFTWARE IS PROVIDED BY THE AUTHORS ''AS IS'' AND ANY EXPRESS - * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE - * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE - * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR - * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF - * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR - * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, - * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE - * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, - * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - * - * Acknowledgements: - * - * We are deeply indebted to the following people for their bug reports, - * fixes, and improvement suggestions to this implementation. Though we - * tried to list all contributions, we apologise in advance for any - * missing reference. - * - * Andrew Bales - * Markus Friedl - * John Skodon - */ - -#include -#include -#include - -#include "rijndael-alg-fst.h" -#include "rijndael-api-fst.h" - -int makeKey(keyInstance *key, BYTE direction, int keyLen, const char *keyMaterial) { - int i; - char *keyMat; - u8 cipherKey[MAXKB]; - - if (key == NULL) { - return BAD_KEY_INSTANCE; - } - - if ((direction == DIR_ENCRYPT) || (direction == DIR_DECRYPT)) { - key->direction = direction; - } else { - return BAD_KEY_DIR; - } - - if ((keyLen == 128) || (keyLen == 192) || (keyLen == 256)) { - key->keyLen = keyLen; - } else { - return BAD_KEY_MAT; - } - - if (keyMaterial != NULL) { - strncpy(key->keyMaterial, keyMaterial, keyLen/4); - } - - /* initialize key schedule: */ - keyMat = key->keyMaterial; - for (i = 0; i < key->keyLen/8; i++) { - int t, v; - - t = *keyMat++; - if ((t >= '0') && (t <= '9')) v = (t - '0') << 4; - else if ((t >= 'a') && (t <= 'f')) v = (t - 'a' + 10) << 4; - else if ((t >= 'A') && (t <= 'F')) v = (t - 'A' + 10) << 4; - else return BAD_KEY_MAT; - - t = *keyMat++; - if ((t >= '0') && (t <= '9')) v ^= (t - '0'); - else if ((t >= 'a') && (t <= 'f')) v ^= (t - 'a' + 10); - else if ((t >= 'A') && (t <= 'F')) v ^= (t - 'A' + 10); - else return BAD_KEY_MAT; - - cipherKey[i] = (u8)v; - } - if (direction == DIR_ENCRYPT) { - key->Nr = rijndaelKeySetupEnc(key->rk, cipherKey, keyLen); - } else { - key->Nr = rijndaelKeySetupDec(key->rk, cipherKey, keyLen); - } - rijndaelKeySetupEnc(key->ek, cipherKey, keyLen); - return TRUE; -} - -int cipherInit(cipherInstance *cipher, BYTE mode, char *IV) { - if ((mode == MODE_ECB) || (mode == MODE_CBC) || (mode == MODE_CFB1)) { - cipher->mode = mode; - } else { - return BAD_CIPHER_MODE; - } - if (IV != NULL) { - int i; - for (i = 0; i < MAX_IV_SIZE; i++) { - int t, j; - - t = IV[2*i]; - if ((t >= '0') && (t <= '9')) j = (t - '0') << 4; - else if ((t >= 'a') && (t <= 'f')) j = (t - 'a' + 10) << 4; - else if ((t >= 'A') && (t <= 'F')) j = (t - 'A' + 10) << 4; - else return BAD_CIPHER_INSTANCE; - - t = IV[2*i+1]; - if ((t >= '0') && (t <= '9')) j ^= (t - '0'); - else if ((t >= 'a') && (t <= 'f')) j ^= (t - 'a' + 10); - else if ((t >= 'A') && (t <= 'F')) j ^= (t - 'A' + 10); - else return BAD_CIPHER_INSTANCE; - - cipher->IV[i] = (u8)j; - } - } else { - memset(cipher->IV, 0, MAX_IV_SIZE); - } - return TRUE; -} - -int blockEncrypt(cipherInstance *cipher, keyInstance *key, - BYTE *input, int inputLen, BYTE *outBuffer) { - int i, k, t, numBlocks; - u8 block[16], *iv; - - if (cipher == NULL || - key == NULL || - key->direction == DIR_DECRYPT) { - return BAD_CIPHER_STATE; - } - if (input == NULL || inputLen <= 0) { - return 0; /* nothing to do */ - } - - numBlocks = inputLen/128; - - switch (cipher->mode) { - case MODE_ECB: - for (i = numBlocks; i > 0; i--) { - rijndaelEncrypt(key->rk, key->Nr, input, outBuffer); - input += 16; - outBuffer += 16; - } - break; - - case MODE_CBC: - iv = cipher->IV; - for (i = numBlocks; i > 0; i--) { - ((u32*)block)[0] = ((u32*)input)[0] ^ ((u32*)iv)[0]; - ((u32*)block)[1] = ((u32*)input)[1] ^ ((u32*)iv)[1]; - ((u32*)block)[2] = ((u32*)input)[2] ^ ((u32*)iv)[2]; - ((u32*)block)[3] = ((u32*)input)[3] ^ ((u32*)iv)[3]; - rijndaelEncrypt(key->rk, key->Nr, block, outBuffer); - iv = outBuffer; - input += 16; - outBuffer += 16; - } - break; - - case MODE_CFB1: - iv = cipher->IV; - for (i = numBlocks; i > 0; i--) { - - memcpy(outBuffer, input, 16); - for (k = 0; k < 128; k++) { - rijndaelEncrypt(key->ek, key->Nr, iv, block); - outBuffer[k >> 3] ^= (block[0] & 0x80U) >> (k & 7); - for (t = 0; t < 15; t++) { - iv[t] = (iv[t] << 1) | (iv[t + 1] >> 7); - } - iv[15] = (iv[15] << 1) | ((outBuffer[k >> 3] >> (7 - (k & 7))) & 1); - } - outBuffer += 16; - input += 16; - } - break; - - default: - return BAD_CIPHER_STATE; - } - - return 128*numBlocks; -} - -/** - * Encrypt data partitioned in octets, using RFC 2040-like padding. - * - * @param input data to be encrypted (octet sequence) - * @param inputOctets input length in octets (not bits) - * @param outBuffer encrypted output data - * - * @return length in octets (not bits) of the encrypted output buffer. - */ -int padEncrypt(cipherInstance *cipher, keyInstance *key, - BYTE *input, int inputOctets, BYTE *outBuffer) { - int i, numBlocks, padLen; - u8 block[16], *iv; - - if (cipher == NULL || - key == NULL || - key->direction == DIR_DECRYPT) { - return BAD_CIPHER_STATE; - } - if (input == NULL || inputOctets <= 0) { - return 0; /* nothing to do */ - } - - numBlocks = inputOctets/16; - - switch (cipher->mode) { - case MODE_ECB: - for (i = numBlocks; i > 0; i--) { - rijndaelEncrypt(key->rk, key->Nr, input, outBuffer); - input += 16; - outBuffer += 16; - } - padLen = 16 - (inputOctets - 16*numBlocks); - assert(padLen > 0 && padLen <= 16); - memcpy(block, input, 16 - padLen); - memset(block + 16 - padLen, padLen, padLen); - rijndaelEncrypt(key->rk, key->Nr, block, outBuffer); - break; - - case MODE_CBC: - iv = cipher->IV; - for (i = numBlocks; i > 0; i--) { - ((u32*)block)[0] = ((u32*)input)[0] ^ ((u32*)iv)[0]; - ((u32*)block)[1] = ((u32*)input)[1] ^ ((u32*)iv)[1]; - ((u32*)block)[2] = ((u32*)input)[2] ^ ((u32*)iv)[2]; - ((u32*)block)[3] = ((u32*)input)[3] ^ ((u32*)iv)[3]; - rijndaelEncrypt(key->rk, key->Nr, block, outBuffer); - iv = outBuffer; - input += 16; - outBuffer += 16; - } - padLen = 16 - (inputOctets - 16*numBlocks); - assert(padLen > 0 && padLen <= 16); - for (i = 0; i < 16 - padLen; i++) { - block[i] = input[i] ^ iv[i]; - } - for (i = 16 - padLen; i < 16; i++) { - block[i] = (BYTE)padLen ^ iv[i]; - } - rijndaelEncrypt(key->rk, key->Nr, block, outBuffer); - break; - - default: - return BAD_CIPHER_STATE; - } - - return 16*(numBlocks + 1); -} - -int blockDecrypt(cipherInstance *cipher, keyInstance *key, - BYTE *input, int inputLen, BYTE *outBuffer) { - int i, k, t, numBlocks; - u8 block[16], *iv; - - if (cipher == NULL || - key == NULL || - cipher->mode != MODE_CFB1 && key->direction == DIR_ENCRYPT) { - return BAD_CIPHER_STATE; - } - if (input == NULL || inputLen <= 0) { - return 0; /* nothing to do */ - } - - numBlocks = inputLen/128; - - switch (cipher->mode) { - case MODE_ECB: - for (i = numBlocks; i > 0; i--) { - rijndaelDecrypt(key->rk, key->Nr, input, outBuffer); - input += 16; - outBuffer += 16; - } - break; - - case MODE_CBC: - iv = cipher->IV; - for (i = numBlocks; i > 0; i--) { - rijndaelDecrypt(key->rk, key->Nr, input, block); - ((u32*)block)[0] ^= ((u32*)iv)[0]; - ((u32*)block)[1] ^= ((u32*)iv)[1]; - ((u32*)block)[2] ^= ((u32*)iv)[2]; - ((u32*)block)[3] ^= ((u32*)iv)[3]; - memcpy(cipher->IV, input, 16); - memcpy(outBuffer, block, 16); - input += 16; - outBuffer += 16; - } - break; - - case MODE_CFB1: - iv = cipher->IV; - for (i = numBlocks; i > 0; i--) { - memcpy(outBuffer, input, 16); - - for (k = 0; k < 128; k++) { - rijndaelEncrypt(key->ek, key->Nr, iv, block); - for (t = 0; t < 15; t++) { - iv[t] = (iv[t] << 1) | (iv[t + 1] >> 7); - } - iv[15] = (iv[15] << 1) | ((input[k >> 3] >> (7 - (k & 7))) & 1); - outBuffer[k >> 3] ^= (block[0] & 0x80U) >> (k & 7); - } - outBuffer += 16; - input += 16; - } - break; - - default: - return BAD_CIPHER_STATE; - } - - return 128*numBlocks; -} - -int padDecrypt(cipherInstance *cipher, keyInstance *key, - BYTE *input, int inputOctets, BYTE *outBuffer) { - int i, numBlocks, padLen; - u8 block[16]; - - if (cipher == NULL || - key == NULL || - key->direction == DIR_ENCRYPT) { - return BAD_CIPHER_STATE; - } - if (input == NULL || inputOctets <= 0) { - return 0; /* nothing to do */ - } - if (inputOctets % 16 != 0) { - return BAD_DATA; - } - - numBlocks = inputOctets/16; - - switch (cipher->mode) { - case MODE_ECB: - /* all blocks but last */ - for (i = numBlocks - 1; i > 0; i--) { - rijndaelDecrypt(key->rk, key->Nr, input, outBuffer); - input += 16; - outBuffer += 16; - } - /* last block */ - rijndaelDecrypt(key->rk, key->Nr, input, block); - padLen = block[15]; - if (padLen > 16) { - return BAD_DATA; - } - for (i = 16 - padLen; i < 16; i++) { - if (block[i] != padLen) { - return BAD_DATA; - } - } - memcpy(outBuffer, block, 16 - padLen); - break; - - case MODE_CBC: - /* all blocks but last */ - for (i = numBlocks - 1; i > 0; i--) { - rijndaelDecrypt(key->rk, key->Nr, input, block); - ((u32*)block)[0] ^= ((u32*)cipher->IV)[0]; - ((u32*)block)[1] ^= ((u32*)cipher->IV)[1]; - ((u32*)block)[2] ^= ((u32*)cipher->IV)[2]; - ((u32*)block)[3] ^= ((u32*)cipher->IV)[3]; - memcpy(cipher->IV, input, 16); - memcpy(outBuffer, block, 16); - input += 16; - outBuffer += 16; - } - /* last block */ - rijndaelDecrypt(key->rk, key->Nr, input, block); - ((u32*)block)[0] ^= ((u32*)cipher->IV)[0]; - ((u32*)block)[1] ^= ((u32*)cipher->IV)[1]; - ((u32*)block)[2] ^= ((u32*)cipher->IV)[2]; - ((u32*)block)[3] ^= ((u32*)cipher->IV)[3]; - padLen = block[15]; - if (padLen <= 0 || padLen > 16) { - return BAD_DATA; - } - for (i = 16 - padLen; i < 16; i++) { - if (block[i] != padLen) { - return BAD_DATA; - } - } - memcpy(outBuffer, block, 16 - padLen); - break; - - default: - return BAD_CIPHER_STATE; - } - - return 16*numBlocks - padLen; -} - -#ifdef INTERMEDIATE_VALUE_KAT -/** - * cipherUpdateRounds: - * - * Encrypts/Decrypts exactly one full block a specified number of rounds. - * Only used in the Intermediate Value Known Answer Test. - * - * Returns: - * TRUE - on success - * BAD_CIPHER_STATE - cipher in bad state (e.g., not initialized) - */ -int cipherUpdateRounds(cipherInstance *cipher, keyInstance *key, - BYTE *input, int inputLen, BYTE *outBuffer, int rounds) { - u8 block[16]; - - if (cipher == NULL || key == NULL) { - return BAD_CIPHER_STATE; - } - - memcpy(block, input, 16); - - switch (key->direction) { - case DIR_ENCRYPT: - rijndaelEncryptRound(key->rk, key->Nr, block, rounds); - break; - - case DIR_DECRYPT: - rijndaelDecryptRound(key->rk, key->Nr, block, rounds); - break; - - default: - return BAD_KEY_DIR; - } - - memcpy(outBuffer, block, 16); - - return TRUE; -} -#endif /* INTERMEDIATE_VALUE_KAT */ Index: ext/libicpf/src/rijndael-api-fst.h =================================================================== diff -u -N --- ext/libicpf/src/rijndael-api-fst.h (revision e17c80d36eaa0430313e7d1058aa7a301d1510af) +++ ext/libicpf/src/rijndael-api-fst.h (revision 0) @@ -1,119 +0,0 @@ -/** - * rijndael-api-fst.h - * - * @version 2.9 (December 2000) - * - * Optimised ANSI C code for the Rijndael cipher (now AES) - * - * @author Vincent Rijmen - * @author Antoon Bosselaers - * @author Paulo Barreto - * - * This code is hereby placed in the public domain. - * - * THIS SOFTWARE IS PROVIDED BY THE AUTHORS ''AS IS'' AND ANY EXPRESS - * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED - * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE - * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE - * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR - * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF - * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR - * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, - * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE - * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, - * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. - * - * Acknowledgements: - * - * We are deeply indebted to the following people for their bug reports, - * fixes, and improvement suggestions to this implementation. Though we - * tried to list all contributions, we apologise in advance for any - * missing reference. - * - * Andrew Bales - * Markus Friedl - * John Skodon - */ - -#ifndef __RIJNDAEL_API_FST_H -#define __RIJNDAEL_API_FST_H - -#ifdef __cplusplus -extern "C" { -#endif - -#include -#include "rijndael-alg-fst.h" - -/* Generic Defines */ -#define DIR_ENCRYPT 0 /* Are we encrpyting? */ -#define DIR_DECRYPT 1 /* Are we decrpyting? */ -#define MODE_ECB 1 /* Are we ciphering in ECB mode? */ -#define MODE_CBC 2 /* Are we ciphering in CBC mode? */ -#define MODE_CFB1 3 /* Are we ciphering in 1-bit CFB mode? */ -#define TRUE 1 -#define FALSE 0 -#define BITSPERBLOCK 128 /* Default number of bits in a cipher block */ - -/* Error Codes */ -#define BAD_KEY_DIR -1 /* Key direction is invalid, e.g., unknown value */ -#define BAD_KEY_MAT -2 /* Key material not of correct length */ -#define BAD_KEY_INSTANCE -3 /* Key passed is not valid */ -#define BAD_CIPHER_MODE -4 /* Params struct passed to cipherInit invalid */ -#define BAD_CIPHER_STATE -5 /* Cipher in wrong state (e.g., not initialized) */ -#define BAD_BLOCK_LENGTH -6 -#define BAD_CIPHER_INSTANCE -7 -#define BAD_DATA -8 /* Data contents are invalid, e.g., invalid padding */ -#define BAD_OTHER -9 /* Unknown error */ - -/* Algorithm-specific Defines */ -#define MAX_KEY_SIZE 64 /* # of ASCII char's needed to represent a key */ -#define MAX_IV_SIZE 16 /* # bytes needed to represent an IV */ - -/* Typedefs */ - -typedef unsigned char BYTE; - -/* The structure for key information */ -typedef struct { - BYTE direction; /* Key used for encrypting or decrypting? */ - int keyLen; /* Length of the key */ - char keyMaterial[MAX_KEY_SIZE+1]; /* Raw key data in ASCII, e.g., user input or KAT values */ - int Nr; /* key-length-dependent number of rounds */ - u32 rk[4*(MAXNR + 1)]; /* key schedule */ - u32 ek[4*(MAXNR + 1)]; /* CFB1 key schedule (encryption only) */ -} keyInstance; - -/* The structure for cipher information */ -typedef struct { /* changed order of the components */ - BYTE mode; /* MODE_ECB, MODE_CBC, or MODE_CFB1 */ - BYTE IV[MAX_IV_SIZE]; /* A possible Initialization Vector for ciphering */ -} cipherInstance; - -/* Function prototypes */ - -int makeKey(keyInstance *key, BYTE direction, int keyLen, const char *keyMaterial); - -int cipherInit(cipherInstance *cipher, BYTE mode, char *IV); - -int blockEncrypt(cipherInstance *cipher, keyInstance *key, - BYTE *input, int inputLen, BYTE *outBuffer); - -int padEncrypt(cipherInstance *cipher, keyInstance *key, - BYTE *input, int inputOctets, BYTE *outBuffer); - -int blockDecrypt(cipherInstance *cipher, keyInstance *key, - BYTE *input, int inputLen, BYTE *outBuffer); - -int padDecrypt(cipherInstance *cipher, keyInstance *key, - BYTE *input, int inputOctets, BYTE *outBuffer); - -#ifdef INTERMEDIATE_VALUE_KAT -int cipherUpdateRounds(cipherInstance *cipher, keyInstance *key, - BYTE *input, int inputLen, BYTE *outBuffer, int Rounds); -#endif /* INTERMEDIATE_VALUE_KAT */ - -#ifdef __cplusplus -} -#endif -#endif /* __RIJNDAEL_API_FST_H */ Index: ext/libicpf/src/sha256.c =================================================================== diff -u -N --- ext/libicpf/src/sha256.c (revision e17c80d36eaa0430313e7d1058aa7a301d1510af) +++ ext/libicpf/src/sha256.c (revision 0) @@ -1,369 +0,0 @@ -/* - * FIPS-180-2 compliant SHA-256 implementation - * - * Copyright (C) 2001-2003 Christophe Devine - * - * This program is free software; you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation; either version 2 of the License, or - * (at your option) any later version. - * - * 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, write to the Free Software - * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA - */ - -#include - -#include "sha256.h" - -#define GET_UINT32(n,b,i) \ -{ \ - (n) = ( (uint32) (b)[(i) ] << 24 ) \ - | ( (uint32) (b)[(i) + 1] << 16 ) \ - | ( (uint32) (b)[(i) + 2] << 8 ) \ - | ( (uint32) (b)[(i) + 3] ); \ -} - -#define PUT_UINT32(n,b,i) \ -{ \ - (b)[(i) ] = (uint8) ( (n) >> 24 ); \ - (b)[(i) + 1] = (uint8) ( (n) >> 16 ); \ - (b)[(i) + 2] = (uint8) ( (n) >> 8 ); \ - (b)[(i) + 3] = (uint8) ( (n) ); \ -} - -void sha256_starts( sha256_context *ctx ) -{ - ctx->total[0] = 0; - ctx->total[1] = 0; - - ctx->state[0] = 0x6A09E667; - ctx->state[1] = 0xBB67AE85; - ctx->state[2] = 0x3C6EF372; - ctx->state[3] = 0xA54FF53A; - ctx->state[4] = 0x510E527F; - ctx->state[5] = 0x9B05688C; - ctx->state[6] = 0x1F83D9AB; - ctx->state[7] = 0x5BE0CD19; -} - -void sha256_process( sha256_context *ctx, uint8 data[64] ) -{ - uint32 temp1, temp2, W[64]; - uint32 A, B, C, D, E, F, G, H; - - GET_UINT32( W[0], data, 0 ); - GET_UINT32( W[1], data, 4 ); - GET_UINT32( W[2], data, 8 ); - GET_UINT32( W[3], data, 12 ); - GET_UINT32( W[4], data, 16 ); - GET_UINT32( W[5], data, 20 ); - GET_UINT32( W[6], data, 24 ); - GET_UINT32( W[7], data, 28 ); - GET_UINT32( W[8], data, 32 ); - GET_UINT32( W[9], data, 36 ); - GET_UINT32( W[10], data, 40 ); - GET_UINT32( W[11], data, 44 ); - GET_UINT32( W[12], data, 48 ); - GET_UINT32( W[13], data, 52 ); - GET_UINT32( W[14], data, 56 ); - GET_UINT32( W[15], data, 60 ); - -#define SHR(x,n) ((x & 0xFFFFFFFF) >> n) -#define ROTR(x,n) (SHR(x,n) | (x << (32 - n))) - -#define S0(x) (ROTR(x, 7) ^ ROTR(x,18) ^ SHR(x, 3)) -#define S1(x) (ROTR(x,17) ^ ROTR(x,19) ^ SHR(x,10)) - -#define S2(x) (ROTR(x, 2) ^ ROTR(x,13) ^ ROTR(x,22)) -#define S3(x) (ROTR(x, 6) ^ ROTR(x,11) ^ ROTR(x,25)) - -#define F0(x,y,z) ((x & y) | (z & (x | y))) -#define F1(x,y,z) (z ^ (x & (y ^ z))) - -#define _R(t) \ -( \ - W[t] = S1(W[t - 2]) + W[t - 7] + \ - S0(W[t - 15]) + W[t - 16] \ -) - -#define P(a,b,c,d,e,f,g,h,x,K) \ -{ \ - temp1 = h + S3(e) + F1(e,f,g) + K + x; \ - temp2 = S2(a) + F0(a,b,c); \ - d += temp1; h = temp1 + temp2; \ -} - - A = ctx->state[0]; - B = ctx->state[1]; - C = ctx->state[2]; - D = ctx->state[3]; - E = ctx->state[4]; - F = ctx->state[5]; - G = ctx->state[6]; - H = ctx->state[7]; - - P( A, B, C, D, E, F, G, H, W[ 0], 0x428A2F98 ); - P( H, A, B, C, D, E, F, G, W[ 1], 0x71374491 ); - P( G, H, A, B, C, D, E, F, W[ 2], 0xB5C0FBCF ); - P( F, G, H, A, B, C, D, E, W[ 3], 0xE9B5DBA5 ); - P( E, F, G, H, A, B, C, D, W[ 4], 0x3956C25B ); - P( D, E, F, G, H, A, B, C, W[ 5], 0x59F111F1 ); - P( C, D, E, F, G, H, A, B, W[ 6], 0x923F82A4 ); - P( B, C, D, E, F, G, H, A, W[ 7], 0xAB1C5ED5 ); - P( A, B, C, D, E, F, G, H, W[ 8], 0xD807AA98 ); - P( H, A, B, C, D, E, F, G, W[ 9], 0x12835B01 ); - P( G, H, A, B, C, D, E, F, W[10], 0x243185BE ); - P( F, G, H, A, B, C, D, E, W[11], 0x550C7DC3 ); - P( E, F, G, H, A, B, C, D, W[12], 0x72BE5D74 ); - P( D, E, F, G, H, A, B, C, W[13], 0x80DEB1FE ); - P( C, D, E, F, G, H, A, B, W[14], 0x9BDC06A7 ); - P( B, C, D, E, F, G, H, A, W[15], 0xC19BF174 ); - P( A, B, C, D, E, F, G, H, _R(16), 0xE49B69C1 ); - P( H, A, B, C, D, E, F, G, _R(17), 0xEFBE4786 ); - P( G, H, A, B, C, D, E, F, _R(18), 0x0FC19DC6 ); - P( F, G, H, A, B, C, D, E, _R(19), 0x240CA1CC ); - P( E, F, G, H, A, B, C, D, _R(20), 0x2DE92C6F ); - P( D, E, F, G, H, A, B, C, _R(21), 0x4A7484AA ); - P( C, D, E, F, G, H, A, B, _R(22), 0x5CB0A9DC ); - P( B, C, D, E, F, G, H, A, _R(23), 0x76F988DA ); - P( A, B, C, D, E, F, G, H, _R(24), 0x983E5152 ); - P( H, A, B, C, D, E, F, G, _R(25), 0xA831C66D ); - P( G, H, A, B, C, D, E, F, _R(26), 0xB00327C8 ); - P( F, G, H, A, B, C, D, E, _R(27), 0xBF597FC7 ); - P( E, F, G, H, A, B, C, D, _R(28), 0xC6E00BF3 ); - P( D, E, F, G, H, A, B, C, _R(29), 0xD5A79147 ); - P( C, D, E, F, G, H, A, B, _R(30), 0x06CA6351 ); - P( B, C, D, E, F, G, H, A, _R(31), 0x14292967 ); - P( A, B, C, D, E, F, G, H, _R(32), 0x27B70A85 ); - P( H, A, B, C, D, E, F, G, _R(33), 0x2E1B2138 ); - P( G, H, A, B, C, D, E, F, _R(34), 0x4D2C6DFC ); - P( F, G, H, A, B, C, D, E, _R(35), 0x53380D13 ); - P( E, F, G, H, A, B, C, D, _R(36), 0x650A7354 ); - P( D, E, F, G, H, A, B, C, _R(37), 0x766A0ABB ); - P( C, D, E, F, G, H, A, B, _R(38), 0x81C2C92E ); - P( B, C, D, E, F, G, H, A, _R(39), 0x92722C85 ); - P( A, B, C, D, E, F, G, H, _R(40), 0xA2BFE8A1 ); - P( H, A, B, C, D, E, F, G, _R(41), 0xA81A664B ); - P( G, H, A, B, C, D, E, F, _R(42), 0xC24B8B70 ); - P( F, G, H, A, B, C, D, E, _R(43), 0xC76C51A3 ); - P( E, F, G, H, A, B, C, D, _R(44), 0xD192E819 ); - P( D, E, F, G, H, A, B, C, _R(45), 0xD6990624 ); - P( C, D, E, F, G, H, A, B, _R(46), 0xF40E3585 ); - P( B, C, D, E, F, G, H, A, _R(47), 0x106AA070 ); - P( A, B, C, D, E, F, G, H, _R(48), 0x19A4C116 ); - P( H, A, B, C, D, E, F, G, _R(49), 0x1E376C08 ); - P( G, H, A, B, C, D, E, F, _R(50), 0x2748774C ); - P( F, G, H, A, B, C, D, E, _R(51), 0x34B0BCB5 ); - P( E, F, G, H, A, B, C, D, _R(52), 0x391C0CB3 ); - P( D, E, F, G, H, A, B, C, _R(53), 0x4ED8AA4A ); - P( C, D, E, F, G, H, A, B, _R(54), 0x5B9CCA4F ); - P( B, C, D, E, F, G, H, A, _R(55), 0x682E6FF3 ); - P( A, B, C, D, E, F, G, H, _R(56), 0x748F82EE ); - P( H, A, B, C, D, E, F, G, _R(57), 0x78A5636F ); - P( G, H, A, B, C, D, E, F, _R(58), 0x84C87814 ); - P( F, G, H, A, B, C, D, E, _R(59), 0x8CC70208 ); - P( E, F, G, H, A, B, C, D, _R(60), 0x90BEFFFA ); - P( D, E, F, G, H, A, B, C, _R(61), 0xA4506CEB ); - P( C, D, E, F, G, H, A, B, _R(62), 0xBEF9A3F7 ); - P( B, C, D, E, F, G, H, A, _R(63), 0xC67178F2 ); - - ctx->state[0] += A; - ctx->state[1] += B; - ctx->state[2] += C; - ctx->state[3] += D; - ctx->state[4] += E; - ctx->state[5] += F; - ctx->state[6] += G; - ctx->state[7] += H; -} - -void sha256_update( sha256_context *ctx, uint8 *input, uint32 length ) -{ - uint32 left, fill; - - if( ! length ) return; - - left = ctx->total[0] & 0x3F; - fill = 64 - left; - - ctx->total[0] += length; - ctx->total[0] &= 0xFFFFFFFF; - - if( ctx->total[0] < length ) - ctx->total[1]++; - - if( left && length >= fill ) - { - memcpy( (void *) (ctx->buffer + left), - (void *) input, fill ); - sha256_process( ctx, ctx->buffer ); - length -= fill; - input += fill; - left = 0; - } - - while( length >= 64 ) - { - sha256_process( ctx, input ); - length -= 64; - input += 64; - } - - if( length ) - { - memcpy( (void *) (ctx->buffer + left), - (void *) input, length ); - } -} - -static uint8 sha256_padding[64] = -{ - 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 -}; - -void sha256_finish( sha256_context *ctx, uint8 digest[32] ) -{ - uint32 last, padn; - uint32 high, low; - uint8 msglen[8]; - - high = ( ctx->total[0] >> 29 ) - | ( ctx->total[1] << 3 ); - low = ( ctx->total[0] << 3 ); - - PUT_UINT32( high, msglen, 0 ); - PUT_UINT32( low, msglen, 4 ); - - last = ctx->total[0] & 0x3F; - padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last ); - - sha256_update( ctx, sha256_padding, padn ); - sha256_update( ctx, msglen, 8 ); - - PUT_UINT32( ctx->state[0], digest, 0 ); - PUT_UINT32( ctx->state[1], digest, 4 ); - PUT_UINT32( ctx->state[2], digest, 8 ); - PUT_UINT32( ctx->state[3], digest, 12 ); - PUT_UINT32( ctx->state[4], digest, 16 ); - PUT_UINT32( ctx->state[5], digest, 20 ); - PUT_UINT32( ctx->state[6], digest, 24 ); - PUT_UINT32( ctx->state[7], digest, 28 ); -} - -#ifdef TEST - -#include -#include - -/* - * those are the standard FIPS-180-2 test vectors - */ - -static char *msg[] = -{ - "abc", - "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", - NULL -}; - -static char *val[] = -{ - "ba7816bf8f01cfea414140de5dae2223" \ - "b00361a396177a9cb410ff61f20015ad", - "248d6a61d20638b8e5c026930c3e6039" \ - "a33ce45964ff2167f6ecedd419db06c1", - "cdc76e5c9914fb9281a1c7e284d73e67" \ - "f1809a48a497200e046d39ccc7112cd0" -}; - -int main( int argc, char *argv[] ) -{ - FILE *f; - int i, j; - char output[65]; - sha256_context ctx; - unsigned char buf[1000]; - unsigned char sha256sum[32]; - - if( argc < 2 ) - { - printf( "\n SHA-256 Validation Tests:\n\n" ); - - for( i = 0; i < 3; i++ ) - { - printf( " Test %d ", i + 1 ); - - sha256_starts( &ctx ); - - if( i < 2 ) - { - sha256_update( &ctx, (uint8 *) msg[i], - strlen( msg[i] ) ); - } - else - { - memset( buf, 'a', 1000 ); - - for( j = 0; j < 1000; j++ ) - { - sha256_update( &ctx, (uint8 *) buf, 1000 ); - } - } - - sha256_finish( &ctx, sha256sum ); - - for( j = 0; j < 32; j++ ) - { - sprintf( output + j * 2, "%02x", sha256sum[j] ); - } - - if( memcmp( output, val[i], 64 ) ) - { - printf( "failed!\n" ); - return( 1 ); - } - - printf( "passed.\n" ); - } - - printf( "\n" ); - } - else - { - if( ! ( f = fopen( argv[1], "rb" ) ) ) - { - perror( "fopen" ); - return( 1 ); - } - - sha256_starts( &ctx ); - - while( ( i = fread( buf, 1, sizeof( buf ), f ) ) > 0 ) - { - sha256_update( &ctx, buf, i ); - } - - sha256_finish( &ctx, sha256sum ); - - for( j = 0; j < 32; j++ ) - { - printf( "%02x", sha256sum[j] ); - } - - printf( " %s\n", argv[1] ); - } - - return( 0 ); -} - -#endif \ No newline at end of file Index: ext/libicpf/src/sha256.h =================================================================== diff -u -N --- ext/libicpf/src/sha256.h (revision 338a33bbdb8c82416f0351408eea3243520784e5) +++ ext/libicpf/src/sha256.h (revision 0) @@ -1,32 +0,0 @@ -#ifndef _SHA256_H -#define _SHA256_H - -#ifdef __cplusplus -extern "C" -{ -#endif - -#ifndef uint8 -#define uint8 unsigned char -#endif - -#ifndef uint32 -#define uint32 unsigned long int -#endif - -typedef struct -{ - uint32 total[2]; - uint32 state[8]; - uint8 buffer[64]; -} sha256_context; - -void sha256_starts( sha256_context *ctx ); -void sha256_update( sha256_context *ctx, uint8 *input, uint32 length ); -void sha256_finish( sha256_context *ctx, uint8 digest[32] ); - -#ifdef __cplusplus -} -#endif - -#endif /* sha256.h */ Index: ext/libicpf/src/str.cpp =================================================================== diff -u -N --- ext/libicpf/src/str.cpp (revision 2446443341715955423610c01b43fe7841a10e3e) +++ ext/libicpf/src/str.cpp (revision 0) @@ -1,1814 +0,0 @@ -/*************************************************************************** - * Copyright (C) 2004-2006 by J�zef Starosczyk * - * ixen@copyhandler.com * - * * - * This program is free software; you can redistribute it and/or modify * - * it under the terms of the GNU Library General Public License as * - * published by the Free Software Foundation; either version 2 of the * - * License, or (at your option) any later version. * - * * - * 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 Library General Public * - * License along with this program; if not, write to the * - * Free Software Foundation, Inc., * - * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * - ***************************************************************************/ -/** \file str.cpp - * \brief Contains the string class implementation. - */ - -#include "str.h" -#include -#include -#include "macros.h" -#include "str_help.h" -#include "dumpctx.h" -#include - -#ifdef _WIN32 - #include -#endif - -///< Increment value for internal string buffer -#define CHUNK_INCSIZE 64 - -// if (buffer_size-string_size > CHUNK_DECSIZE) then the buffer will be shrinked -///< Difference value above which the string will be shrinked -#define CHUNK_DECSIZE 256 - -BEGIN_ICPF_NAMESPACE - -/** Standard constructor - * \param[in] wFlags - initialization flags (SDF_*) - */ -str_data::str_data(short_t wFlags) - : m_pszBuffer(NULL), - m_tBufSize(0), - m_wRefCount(1), - m_wFlags(wFlags) -{ -} - -/** Standard destructor; Frees the internal buffer. - */ -str_data::~str_data() -{ - try - { - free_buffer(); - } - catch(...) - { - } -} - -/** Resets the object - frees buffer memory and sets internal members into the initial state. - */ -void str_data::free_buffer() -{ -#ifdef ALLOW_UNICODE - if (m_wFlags & SDF_UNICODE) - delete [] (wchar_t*)m_pszBuffer; - else -#endif - delete [] m_pszBuffer; - m_pszBuffer=NULL; - m_tBufSize=0; - m_wFlags=SDF_NONE; -} - -/** Creates a duplicate of the string data object. Returned pointer is freshly - * allocated and needs to be destroyed. - * \return Pointer to the newly allocated duplicate data object. - */ -str_data* str_data::dup() -{ - assert(m_pszBuffer); - - str_data* psd=new str_data(m_wFlags); - psd->m_tBufSize=m_tBufSize; -#ifdef ALLOW_UNICODE - if (m_wFlags & SDF_UNICODE) - { - psd->m_pszBuffer=(char_t*)new wchar_t[m_tBufSize]; - wcscpy((wchar_t*)psd->m_pszBuffer, (const wchar_t*)m_pszBuffer); - } - else - { -#endif - psd->m_pszBuffer=new char_t[m_tBufSize]; - strcpy(psd->m_pszBuffer, m_pszBuffer); -#ifdef ALLOW_UNICODE - } -#endif - - return psd; -} - -/** Resizes the internal string buffer to the new size (and copies the old buffer - * contents into the new one if needed). Does not provide the rounding capabilities. - * If the new size is 0 then the buffer is sized to the smallest possible value. - * \param[in] tNewSize - specifies the new buffer size; if 0 then the CHUNK_INCSIZE is - * taken as the size - * \param[in] bCopy - if the current buffer contents should be copied to the new buffer - * \note If the parameter bCopy is false then function puts the null character at the beginning - * of the buffer (sets the string length to 0). - */ -void str_data::resize_buffer(size_t tNewSize, bool bCopy) -{ - assert(m_wRefCount == 1); // is this copy writable ? - - // make sure we resize to some reasonable value - if (tNewSize == 0) - tNewSize=CHUNK_INCSIZE; - -#ifdef ALLOW_UNICODE - char_t* psz; - if (m_wFlags & SDF_UNICODE) - psz=(char_t*)new wchar_t[tNewSize]; - else - psz=new char_t[tNewSize]; -#else - char_t* psz=new char_t[tNewSize]; -#endif - - // now copy if requested - if (bCopy && m_pszBuffer) - { - size_t tCurrent=length(); - tCurrent=(tCurrent < tNewSize) ? tCurrent : tNewSize; - -#ifdef ALLOW_UNICODE - if (m_wFlags & SDF_UNICODE) - { - wcsncpy((wchar_t*)psz, (wchar_t*)m_pszBuffer, tCurrent); - ((wchar_t*)psz)[tCurrent]=L'\0'; - } - else - { -#endif - strncpy(psz, m_pszBuffer, tCurrent); - psz[tCurrent]='\0'; -#ifdef ALLOW_UNICODE - } -#endif - - } - else -#ifdef ALLOW_UNICODE - { - if (m_wFlags & SDF_UNICODE) - ((wchar_t*)psz)[0]=L'\0'; - else -#endif - psz[0]='\0'; -#ifdef ALLOW_UNICODE - } -#endif - - // store data -#ifdef ALLOW_UNICODE - if (m_wFlags & SDF_UNICODE) - delete [] (wchar_t*)m_pszBuffer; - else -#endif - delete [] m_pszBuffer; - m_pszBuffer=psz; - m_tBufSize=tNewSize; -} - -/** Resizes the internal string buffer to the new size (and copies the old buffer - * contents into the new one if needed). Function checks if the buffer needs to be - * resized or not (the buffer is enlarged only if the new size is greater than the - * current buffer size; buffer is shrinked if the new size is smaller than - * (current size - CHUNK_DECSIZE). - * \param[in] tNewSize - specifies the new buffer size; if 0 then the CHUNK_INCSIZE is - * taken as the size - * \param[in] bCopy - if the current buffer contents should be copied to the new buffer - */ -void str_data::resize_buffer_check(size_t tNewSize, bool bCopy) -{ - assert(m_wRefCount == 1); // is this copy writable ? - - // make sure we resize to some reasonable value - if (tNewSize == 0) - tNewSize=CHUNK_INCSIZE; - - if (tNewSize > m_tBufSize || tNewSize+CHUNK_DECSIZE < m_tBufSize) - resize_buffer(tNewSize, bCopy); -} - -/** Function calculates the length of a string in characters (doesn't matter if the string - * is unicode or ansi). - * \note All length checks should be done through this function, because of possible future - * update that will store the string length in the internal member. - * \return The string length in characters, not including the terminating '\\0' - */ -size_t str_data::length() const -{ - if (m_pszBuffer) - { -#ifdef ALLOW_UNICODE - if (m_wFlags & SDF_UNICODE) - return wcslen((wchar_t*)m_pszBuffer); - else -#endif - return strlen(m_pszBuffer); - } - else - return 0; -} - -/** Function calculates the string length using length() function, but outputs - * the string length in bytes instead of characters. - * \return The string length in bytes (including the terminating null character). - */ -size_t str_data::bytelen() const -{ - if (m_wFlags & SDF_UNICODE) - return (length()+1)*sizeof(wchar_t); - else - return (length()+1); -} - -#ifdef ALLOW_UNICODE -/** Changes the internal buffer type to unicode (if ansi). It means only that - * unicode flag is being set, and the buffer size (which is measured in chars) - * is modified according to the size of type wchar_t. - */ -void str_data::switch_unicode() -{ - assert(m_wRefCount == 1); - if (!(m_wFlags & SDF_UNICODE)) - { - m_wFlags |= SDF_UNICODE; - m_tBufSize /= sizeof(wchar_t); - } -} - -/** Changes the internal buffer type to ansi (if unicode). It means only that - * unicode flag is being reset(set to 0), and the buffer size (which is measured in chars) - * is modified according to the size of type wchar_t. - */ -void str_data::switch_ansi() -{ - assert(m_wRefCount == 1); - if (m_wFlags & SDF_UNICODE) - { - m_wFlags &= ~SDF_UNICODE; - m_tBufSize *= sizeof(wchar_t); - } -} -#endif - -/** Assigns a new string buffer to this data object. If there was any other - * buffer allocated - it's freed before assign. - * \param[in] pszSrc - buffer with the source string - * \param[in] tLen - size of the buffer to be assigned (may be greater than the string length) - * \note The tLen param should include the termination null character - */ -void str_data::assign(char_t* pszSrc, size_t tLen) -{ - assert(m_wRefCount == 1); - - // make sure the buffer is freed - free_buffer(); - - m_pszBuffer=pszSrc; - m_tBufSize=tLen; - m_wFlags &= ~SDF_UNICODE; -} - -#ifdef ALLOW_UNICODE -/** Assigns a new string buffer to this data object. If there was any other - * buffer allocated - it's freed before assign. - * \param[in] pszSrc - buffer with the source string - * \param[in] tLen - size of the buffer to be assigned (may be greater than the string length) - * \note The tLen param should include the termination null character - */ -void str_data::assign(wchar_t* pszSrc, size_t tLen) -{ - assert(m_wRefCount == 1); - - // make sure the buffer is freed - free_buffer(); - - m_pszBuffer=(char_t*)pszSrc; - m_tBufSize=tLen; - m_wFlags |= SDF_UNICODE; -} -#endif - -/** Standard constructor - allocates the underlying data object - */ -string::string() : - m_psd(new str_data(SDF_NONE)) -{ -} - -/** Constructor allocates the underlying data object and initializes it with - * a given ansi string. - * \param[in] pszStr - source ansi string - */ -string::string(const char_t* pszStr) : - m_psd(new str_data(SDF_NONE)) -{ - set_str(pszStr); -} - -#ifdef ALLOW_UNICODE -/** Constructor allocates the underlying data object and initializes it with - * a given unicode string. - * \param[in] pszStr - source unicode string - */ -string::string(const wchar_t* pszStr) : - m_psd(new str_data(SDF_UNICODE)) -{ - set_str(pszStr); -} -#endif - -/** Constructor increases the reference count in the parameter's data object - * and copies only the data object address. - * \param[in] str - source string object - */ -string::string(const string& str) : - m_psd(str.m_psd) -{ - m_psd->inc_refcount(); -} - -/** Destructor releases the underlying data object. - */ -string::~string() -{ - try - { - release_data(); - } - catch(...) - { - } -} - -/** Operator releases the current data object, stores a pointer to - * the data object from the given string object and increases a reference - * count. - * \param[in] src - source string object - * \return A reference to the current string. - */ -const string& string::operator=(const string& src) -{ - if (this != &src) - { - release_data(); - m_psd=src.m_psd; - m_psd->inc_refcount(); - } - - return *this; -} - -/** Operator makes an own copy of underlying data object (if needed) and copy - * there given ansi string. - * \param[in] pszSrc - source ansi string - * \return A reference to the current string object. - */ -const string& string::operator=(const char_t* pszSrc) -{ - set_str(pszSrc); - - return *this; -} - -#ifdef ALLOW_UNICODE -/** Operator makes an own copy of underlying data object (if needed) and copy - * there the given unicode string. - * \param[in] pszSrc - source unicode string - * \return A reference to the current string object. - */ -const string& string::operator=(const wchar_t* pszSrc) -{ - set_str(pszSrc); - - return *this; -} -#endif - -/** Operator concatenates a given string object with the current content of - * this string and returns a new string object. - * \param[in] src - string object that will be appended - * \return A new string object with concatenated strings. - */ -const string string::operator+(const string& src) const -{ - string str(*this); - str.merge(src); - - return str; -} - -/** Operator concatenates a given ansi string with the current content of - * this string and returns a new string object. - * \param[in] pszSrc - ansi string that will be appended - * \return A new string object with concatenated strings. - */ -const string string::operator+(const char_t* pszSrc) const -{ - string str(*this); - str.merge(pszSrc); - - return str; -} - -#ifdef ALLOW_UNICODE -/** Operator concatenates a given unicode string with the current content of - * this string and returns a new string object. - * \param[in] pszSrc - unicode string that will be appended - * \return A new string object with concatenated strings. - */ -const string string::operator+(const wchar_t* pszSrc) const -{ - string str(*this); - str.merge(pszSrc); - - return str; -} -#endif - -/** Operator appends a given string object to own internal buffer. - * \param[in] src - string object that will be appended - * \return A reference to this. - */ -const string& string::operator+=(const string& src) -{ - merge(src); - return *this; -} - -/** Operator appends a given ansi string to own internal buffer. - * \param[in] pszSrc - ansi string that will be appended - * \return A reference to this. - */ -const string& string::operator+=(const char_t* pszSrc) -{ - merge(pszSrc); - return *this; -} - -#ifdef ALLOW_UNICODE -/** Operator appends a given unicode string to own internal buffer. - * \param[in] pszSrc - unicode string that will be appended - * \return A reference to this. - */ -const string& string::operator+=(const wchar_t* pszSrc) -{ - merge(pszSrc); - return *this; -} -#endif - -/** Function counts the length of a string in characters (doesn't matter if the string - * is unicode or ansi). - * \note All length checks should be done through this function, because of possible future - * update that will store the string length in the internal member. - * \return The string length in characters, not including the terminating '\\0' - */ -size_t string::length() const -{ - return m_psd->length(); -} - -/** Function calculates the string length using length() function, but outputs - * the string length in bytes instead of characters. - * \return The string length in bytes (including the terminating null character). - */ -size_t string::bytelen() const -{ - assert(m_psd); - return m_psd->bytelen(); -} - -/** Function makes own data object writable and clears it. Does not delete the - * internal buffer - only sets the content to '\\0'. - */ -void string::clear() -{ - // make sure we have the modifiable object without allocated string buffer - make_writable(MWF_DELETE); -} - -/** Function checks if the string is empty. - * \return True if this string is empty, false otherwise. - */ -bool string::is_empty() const -{ - assert(m_psd != NULL); - - return (m_psd->m_pszBuffer == NULL) || (m_psd->m_pszBuffer[0] == '\0' -#ifdef ALLOW_UNICODE - && (!(m_psd->m_wFlags & SDF_UNICODE) || m_psd->m_pszBuffer[1] == '\0') -#endif - ); -} - -/** Function merges the given ansi string with the current content of an internal buffer. - * \param[in] pszSrc - ansi string to append - */ -void string::merge(const char_t* pszSrc) -{ - assert(pszSrc); - - make_writable(MWF_COPY); - - // append the second -#ifdef ALLOW_UNICODE - if (m_psd->m_wFlags & SDF_UNICODE) - { - // convert ansi->wide and append it to this - wchar_t *psz=NULL; - if (convert_to_unicode(pszSrc, &psz) > 0) - { - // how much memory do we need ? - size_t tLen=length()+wcslen(psz)+1; - tLen=ROUNDUP(tLen, CHUNK_INCSIZE); - - m_psd->resize_buffer_check(tLen, true); - wcscat((wchar_t*)m_psd->m_pszBuffer, psz); - } - delete [] psz; - } - else - { -#endif - size_t tLen=length()+strlen(pszSrc)+1; - tLen=ROUNDUP(tLen, CHUNK_INCSIZE); - - m_psd->resize_buffer_check(tLen, true); - strcat(m_psd->m_pszBuffer, pszSrc); -#ifdef ALLOW_UNICODE - } -#endif -} - -#ifdef ALLOW_UNICODE -/** Function merges the given unicode string with the current content of an internal buffer. - * \param[in] pszSrc - unicode string to append - */ -void string::merge(const wchar_t* pszSrc) -{ - assert(pszSrc); - - // make string unicode so we don't lose any unicode character when adding new string - make_unicode(); - - // append - size_t tLen=length()+wcslen(pszSrc)+1; - tLen=ROUNDUP(tLen, CHUNK_INCSIZE); - - m_psd->resize_buffer_check(tLen, true); - wcscat((wchar_t*)m_psd->m_pszBuffer, pszSrc); -} -#endif - -/** Function merges the given string object with the current content of an internal buffer. - * \param[in] src - string object to append - */ -void string::merge(const string& src) -{ - make_writable(MWF_COPY); - - size_t tLen=src.length(); - if (tLen > 0) - { - tLen+=length()+1; - tLen=ROUNDUP(tLen, CHUNK_INCSIZE); - - // append the second -#ifdef ALLOW_UNICODE - if (m_psd->m_wFlags & SDF_UNICODE) - { - // resize buffer a bit - m_psd->resize_buffer_check(tLen, true); - - if (src.m_psd->m_wFlags & SDF_UNICODE) - wcscat((wchar_t*)m_psd->m_pszBuffer, (wchar_t*)src.m_psd->m_pszBuffer); - else - { - // convert ansi->wide and append it to this - wchar_t *psz=NULL; - if (convert_to_unicode(src.m_psd->m_pszBuffer, &psz) > 0) - wcscat((wchar_t*)m_psd->m_pszBuffer, psz); - delete [] psz; - } - } - else - { - if (src.m_psd->m_wFlags & SDF_UNICODE) - { - // source is unicode and this is ansi string - make this unicode not to lose any unicode char_t - make_unicode(); - - m_psd->resize_buffer_check(tLen, true); - - wcscat((wchar_t*)m_psd->m_pszBuffer, (wchar_t*)src.m_psd->m_pszBuffer); - } - else - { -#endif - m_psd->resize_buffer_check(tLen, true); - strcat(m_psd->m_pszBuffer, src.m_psd->m_pszBuffer); -#ifdef ALLOW_UNICODE - } - } -#endif - } -} - -/** Returns a new string object with the left part of this string object. - * \param[in] tLen - count of characters to copy to the new string object - * \return The string with the left part of the current string. - */ -string string::left(size_t tLen) const -{ - assert(m_psd); - string str; - size_t tStrLen=length(); - tStrLen=minval(tStrLen, tLen); - -#ifdef ALLOW_UNICODE - if (is_unicode()) - { - str.make_unicode(); - str.m_psd->resize_buffer_check(ROUNDUP((tStrLen+1), CHUNK_INCSIZE), false); - wcsncpy((wchar_t*)str.m_psd->m_pszBuffer, (wchar_t*)m_psd->m_pszBuffer, tStrLen); - ((wchar_t*)str.m_psd->m_pszBuffer)[tStrLen]=L'\0'; - } - else - { -#endif - str.m_psd->resize_buffer_check(ROUNDUP((tStrLen+1), CHUNK_INCSIZE), false); - strncpy(str.m_psd->m_pszBuffer, m_psd->m_pszBuffer, tStrLen); - str.m_psd->m_pszBuffer[tStrLen]='\0'; -#ifdef ALLOW_UNICODE - } -#endif - return str; -} - -/** Returns a new string object with the right part of this string object. - * \param[in] tLen - count of characters to copy to the new string object - * \return The string with the right part of the current string. - */ -string string::right(size_t tLen) const -{ - size_t tFullLen=length(); - size_t tStrLen=minval(tFullLen, tLen); - string str; -#ifdef ALLOW_UNICODE - if (is_unicode()) - { - str.make_unicode(); - str.m_psd->resize_buffer_check(ROUNDUP((tStrLen+1), CHUNK_INCSIZE), false); - wcsncpy((wchar_t*)str.m_psd->m_pszBuffer, ((wchar_t*)m_psd->m_pszBuffer)+tFullLen-tStrLen, tStrLen+1); - } - else - { -#endif - str.m_psd->resize_buffer_check(ROUNDUP((tStrLen+1), CHUNK_INCSIZE), false); - strncpy(str.m_psd->m_pszBuffer, m_psd->m_pszBuffer+tFullLen-tStrLen, tStrLen+1); -#ifdef ALLOW_UNICODE - } -#endif - - return str; -} - -/** Returns a new string object with the middle part of this string object. - * \param[in] tStart - position of the first character to copy - * \param[in] tLen - count of chars to copy - * \return The string with the middle part of the current string. - */ -string string::mid(size_t tStart, size_t tLen) const -{ - string str; - size_t tStrLen=length(); - - assert(tStart < tStrLen); // make sure we start at the right place - - // check the count - if (tLen > tStrLen-tStart) - tLen=tStrLen-tStart; - -#ifdef ALLOW_UNICODE - if (is_unicode()) - { - str.make_unicode(); - str.m_psd->resize_buffer_check(ROUNDUP(tLen, CHUNK_INCSIZE), false); - wcsncpy((wchar_t*)str.m_psd->m_pszBuffer, ((wchar_t*)m_psd->m_pszBuffer)+tStart, tLen); - ((wchar_t*)str.m_psd->m_pszBuffer)[tStrLen]=L'\0'; - } - else - { -#endif - str.m_psd->resize_buffer_check(ROUNDUP(tLen, CHUNK_INCSIZE), false); - strncpy(str.m_psd->m_pszBuffer, m_psd->m_pszBuffer+tStart, tLen); - (str.m_psd->m_pszBuffer)[tStrLen]='\0'; -#ifdef ALLOW_UNICODE - } -#endif - - return str; -} - -/** Makes this string it's left part. Much faster than using standard - * left() function. - * \param[in] tLen - count of characters at the beginning of the string to be left in a string. - * \param[in] bReallocBuffer - if the internal string buffer is to be reallocated if exceeds - * the allowable range size (CHUNK_INCSIZE, CHUNK_DECSIZE). - * \see left() - */ -void string::left_self(size_t tLen, bool bReallocBuffer) -{ - assert(tLen <= length()); - - // insert the '\0' at the requested position -#ifdef ALLOW_UNICODE - if (is_unicode()) - ((wchar_t*)m_psd->m_pszBuffer)[tLen]=L'\0'; - else -#endif - m_psd->m_pszBuffer[tLen]='\0'; - - if (bReallocBuffer) - m_psd->resize_buffer_check(ROUNDUP(tLen, CHUNK_INCSIZE), true); -} - -/** Makes this string it's right part. Much faster than using standard - * right() function. - * \param[in] tLen - count of characters at the end of the string to be left in a string. - * \param[in] bReallocBuffer - if the internal string buffer is to be reallocated if exceeds - * the allowable range size (CHUNK_INCSIZE, CHUNK_DECSIZE). - * \see right() - */ -void string::right_self(size_t tLen, bool bReallocBuffer) -{ - size_t tStrLen=length(); - assert(tLen <= tStrLen); - -#ifdef ALLOW_UNICODE - if (is_unicode()) - wmemmove((wchar_t*)m_psd->m_pszBuffer, ((wchar_t*)m_psd->m_pszBuffer)+tStrLen-tLen, tLen+1); - else -#endif - memmove(m_psd->m_pszBuffer, m_psd->m_pszBuffer+tStrLen-tLen, tLen+1); - - if (bReallocBuffer) - m_psd->resize_buffer_check(ROUNDUP(tLen, CHUNK_INCSIZE), true); -} - -/** Makes this string it's middle part. Much faster than using standard - * mid() function. - * \param[in] tStart - starting position of a text to be left in a string - * \param[in] tLen - count of characters at the middle of the string to be left in a string. - * \param[in] bReallocBuffer - if the internal string buffer is to be reallocated if exceeds - * the allowable range size (CHUNK_INCSIZE, CHUNK_DECSIZE). - * \see mid() - */ -void string::mid_self(size_t tStart, size_t tLen, bool bReallocBuffer) -{ - size_t tStrLen=length(); - assert(tStart < tStrLen); - - // check the count - if (tLen > tStrLen-tStart) - tLen=tStrLen-tStart; - -#ifdef ALLOW_UNICODE - if (is_unicode()) - { - wmemmove((wchar_t*)m_psd->m_pszBuffer, ((wchar_t*)m_psd->m_pszBuffer)+tStart, tLen); - ((wchar_t*)m_psd->m_pszBuffer)[tLen]=L'\0'; - } - else - { -#endif - memmove(m_psd->m_pszBuffer, m_psd->m_pszBuffer+tStart, tLen); - m_psd->m_pszBuffer[tLen]='\0'; -#ifdef ALLOW_UNICODE - } -#endif - if (bReallocBuffer) - m_psd->resize_buffer_check(ROUNDUP(tLen, CHUNK_INCSIZE), true); -} - -/** Compares a string with the given ansi string. Comparison is case sensitive. - * \param[in] psz - ansi string to which the string object will be compared - * \return <0 if this string object is "less" than psz, 0 if they are equal and >0 otherwise. - */ -int_t string::cmp(const char_t* psz) const -{ - assert(psz); - -#ifdef ALLOW_UNICODE - if (m_psd->m_wFlags & SDF_UNICODE) - { - char_t* pszConv=NULL; - int_t iRes=-1; - if (convert_to_ansi((wchar_t*)m_psd->m_pszBuffer, &pszConv) > 0) - iRes=strcmp(psz, pszConv); - - delete [] pszConv; - - return iRes; - } - else - { -#endif - return strcmp(m_psd->m_pszBuffer, psz); -#ifdef ALLOW_UNICODE - } -#endif -} - -#ifdef ALLOW_UNICODE -/** Compares a string with the given unicode string. Comparison is case sensitive. - * \param[in] psz - unicode string to which the string object will be compared - * \return <0 if this string object is "less" than psz, 0 if they are equal and >0 otherwise. - */ -int_t string::cmp(const wchar_t* psz) const -{ - assert(psz); - - if (m_psd->m_wFlags & SDF_UNICODE) - { - return wcscmp((wchar_t*)m_psd->m_pszBuffer, psz); - } - else - { - char_t* pszConv=NULL; - int_t iRes=-1; - if (convert_to_ansi(psz, &pszConv) > 0) - iRes=strcmp(m_psd->m_pszBuffer, pszConv); - - delete [] pszConv; - - return iRes; - } -} -#endif - -/** Compares a string with the given string object. Comparison is case sensitive. - * \param[in] str - string object to which internal string object will be compared - * \return <0 if this string object is "less" than psz, 0 if they are equal and >0 otherwise. - */ -int_t string::cmp(const string& str) const -{ - assert(m_psd); -#ifdef ALLOW_UNICODE - if (str.is_unicode()) - { - if (is_unicode()) - { - // both strings unicode - return wcscmp((wchar_t*)str.m_psd->m_pszBuffer, (wchar_t*)m_psd->m_pszBuffer); - } - else - { - // only the external string is unicode - char_t* pszConv=NULL; - int_t iRes=-1; - if (convert_to_ansi((wchar_t*)str.m_psd->m_pszBuffer, &pszConv) > 0) - iRes=strcmp(pszConv, m_psd->m_pszBuffer); - - delete [] pszConv; - - return iRes; - } - } - else - { - if (is_unicode()) - { - // only internal string unicode - char_t* pszConv=NULL; - int_t iRes=-1; - if (convert_to_ansi((wchar_t*)m_psd->m_pszBuffer, &pszConv) > 0) - iRes=strcmp(pszConv, str.m_psd->m_pszBuffer); - - delete [] pszConv; - - return iRes; - } - else - { -#endif - // both string ansi - return strcmp(str.m_psd->m_pszBuffer, m_psd->m_pszBuffer); -#ifdef ALLOW_UNICODE - } - } -#endif -} - -/** Compares a string with the given ansi string. Comparison is case insensitive. - * \param[in] psz - ansi string to which internal string object will be compared - * \return <0 if this string object is "less" than psz, 0 if they are equal and >0 otherwise. - */ -int_t string::cmpi(const char_t* psz) const -{ - assert(psz); - -#ifdef ALLOW_UNICODE - if (m_psd->m_wFlags & SDF_UNICODE) - { - char_t* pszConv=NULL; - int_t iRes=-1; - if (convert_to_ansi((wchar_t*)m_psd->m_pszBuffer, &pszConv) > 0) - iRes=stricmp(psz, pszConv); - - delete [] pszConv; - - return iRes; - } - else - { -#endif - return stricmp(m_psd->m_pszBuffer, psz); -#ifdef ALLOW_UNICODE - } -#endif -} - -#ifdef ALLOW_UNICODE -/** Compares a string with the given unicode string. Comparison is case insensitive. - * \param[in] psz - unicode string to which internal string object will be compared - * \return <0 if this string object is "less" than psz, 0 if they are equal and >0 otherwise. - */ -int_t string::cmpi(const wchar_t* psz) const -{ - assert(psz); - - if (m_psd->m_wFlags & SDF_UNICODE) - { - return wcsicmp((wchar_t*)m_psd->m_pszBuffer, psz); - } - else - { - char_t* pszConv=NULL; - int_t iRes=-1; - if (convert_to_ansi(psz, &pszConv) > 0) - iRes=stricmp(m_psd->m_pszBuffer, pszConv); - - delete [] pszConv; - - return iRes; - } -} -#endif - -/** Compares a string with the given string object. Comparison is case insensitive. - * \param[in] str - string object to which internal string object will be compared - * \return <0 if this string object is "less" than str, 0 if they are equal and >0 otherwise. - */ -int_t string::cmpi(const string& str) const -{ -#ifdef ALLOW_UNICODE - if (str.is_unicode()) - { - if (is_unicode()) - { - // both strings unicode - return wcsicmp((wchar_t*)str.m_psd->m_pszBuffer, (wchar_t*)m_psd->m_pszBuffer); - } - else - { - // only the external string is unicode - char_t* pszConv=NULL; - int_t iRes=-1; - if (convert_to_ansi((wchar_t*)str.m_psd->m_pszBuffer, &pszConv) > 0) - iRes=stricmp(pszConv, m_psd->m_pszBuffer); - - delete [] pszConv; - - return iRes; - } - } - else - { - if (is_unicode()) - { - // only internal string unicode - char_t* pszConv=NULL; - int_t iRes=-1; - if (convert_to_ansi((wchar_t*)m_psd->m_pszBuffer, &pszConv) > 0) - iRes=stricmp(pszConv, str.m_psd->m_pszBuffer); - - delete [] pszConv; - - return iRes; - } - else - { -#endif - // both string ansi - return stricmp(str.m_psd->m_pszBuffer, m_psd->m_pszBuffer); -#ifdef ALLOW_UNICODE - } - } -#endif -} - -/** Function compares a given count of characters of own internal buffer content - * with a given ansi string. Comparison is case sensitive. - * \param[in] psz - ansi string to compare - * \param[in] tLen - count of characters to compare (-1 to detect shorter string) - * \param[in] bLenCheck - causes the function to check if the len given as a param - * is valid (if not then -2 is returned) - * \return <0 if this string object is "less" than str, 0 if they are equal and >0 otherwise. - * \note Do not use tLen=-1 and bLenCheck=true - it will degrade performance. - */ -int_t string::cmpn(const char_t* psz, size_t tLen, bool bLenCheck) const -{ - assert(psz); - - // if len is -1 then set len to the shorter len - if (tLen == (size_t)-1) - { - tLen=length(); - size_t t=strlen(psz); - if (tLen > t) - tLen=t; - } - - // make a length check to avoid running out of range - if (bLenCheck && (tLen > length() || tLen > strlen(psz))) - return -2; - -#ifdef ALLOW_UNICODE - if (m_psd->m_wFlags & SDF_UNICODE) - { - char_t* pszConv=NULL; - int_t iRes=-2; - if (convert_to_ansi((wchar_t*)m_psd->m_pszBuffer, &pszConv) > 0) - iRes=strncmp(psz, pszConv, tLen); - - delete [] pszConv; - - return iRes; - } - else - { -#endif - return strncmp(m_psd->m_pszBuffer, psz, tLen); -#ifdef ALLOW_UNICODE - } -#endif -} - -#ifdef ALLOW_UNICODE -/** Function compares a given count of characters of own internal buffer content - * with a given unicode string. Comparison is case sensitive. - * \param[in] psz - unicode string to compare - * \param[in] tLen - count of characters to compare (-1 to detect shorter string) - * \param[in] bLenCheck - causes the function to check if the len given as a param - * is valid (if not then -2 is returned) - * \return <0 if this string object is "less" than psz, 0 if they are equal and >0 otherwise. - */ -int_t string::cmpn(const wchar_t* psz, size_t tLen, bool bLenCheck) const -{ - assert(psz); - - // if len is -1 then set len to the shorter len - if (tLen == (size_t)-1) - { - tLen=length(); - size_t t=wcslen(psz); - if (tLen > t) - tLen=t; - } - - // make a length check to avoid running out of range - if (bLenCheck && (tLen > length() || tLen > wcslen(psz))) - return -2; - - if (m_psd->m_wFlags & SDF_UNICODE) - { - return wcsncmp((wchar_t*)m_psd->m_pszBuffer, psz, tLen); - } - else - { - char_t* pszConv=NULL; - int_t iRes=-2; - if (convert_to_ansi(psz, &pszConv) > 0) - iRes=strncmp(m_psd->m_pszBuffer, pszConv, tLen); - - delete [] pszConv; - - return iRes; - } -} -#endif - -/** Function compares a given count of characters of own internal buffer content - * with a given string object. Comparison is case sensitive. - * \param[in] str - string object to compare - * \param[in] tLen - count of characters to compare (-1 to detect shorter string) - * \param[in] bLenCheck - causes the function to check if the len given as a param - * is valid (if not then -2 is returned) - * \return <0 if this string object is "less" than str, 0 if they are equal and >0 otherwise. - */ -int_t string::cmpn(const string& str, size_t tLen, bool bLenCheck) const -{ - // if len is -1 then set len to the shorter len - if (tLen == (size_t)-1) - { - tLen=length(); - size_t t=str.length(); - if (tLen > t) - tLen=t; - } - - // make a length check to avoid running out of range - if (bLenCheck && (tLen > length() || tLen > str.length())) - return -2; - -#ifdef ALLOW_UNICODE - if (str.is_unicode()) - { - if (is_unicode()) - { - // both strings unicode - return wcsncmp((wchar_t*)str.m_psd->m_pszBuffer, (wchar_t*)m_psd->m_pszBuffer, tLen); - } - else - { - // only the external string is unicode - char_t* pszConv=NULL; - int_t iRes=-2; - if (convert_to_ansi((wchar_t*)str.m_psd->m_pszBuffer, &pszConv) > 0) - iRes=strncmp(pszConv, m_psd->m_pszBuffer, tLen); - - delete [] pszConv; - - return iRes; - } - } - else - { - if (is_unicode()) - { - // only internal string unicode - char_t* pszConv=NULL; - int_t iRes=-2; - if (convert_to_ansi((wchar_t*)m_psd->m_pszBuffer, &pszConv) > 0) - iRes=strncmp(pszConv, str.m_psd->m_pszBuffer, tLen); - - delete [] pszConv; - - return iRes; - } - else - { -#endif - // both string ansi - return strncmp(str.m_psd->m_pszBuffer, m_psd->m_pszBuffer, tLen); -#ifdef ALLOW_UNICODE - } - } -#endif -} - -/** Function compares a given count of characters of own internal buffer content - * with a given ansi string. Comparison is case insensitive. - * \param[in] psz - ansi string to compare - * \param[in] tLen - count of characters to compare (-1 to detect shorter string) - * \param[in] bLenCheck - causes the function to check if the len given as a param - * is valid (if not then -2 is returned) - * \return <0 if this string object is "less" than psz, 0 if they are equal and >0 otherwise. - */ -int_t string::cmpin(const char_t* psz, size_t tLen, bool bLenCheck) const -{ - assert(psz); - - // if len is -1 then set len to the shorter len - if (tLen == (size_t)-1) - { - tLen=length(); - size_t t=strlen(psz); - if (tLen > t) - tLen=t; - } - - // make a length check to avoid running out of range - if (bLenCheck && (tLen > length() || tLen > strlen(psz))) - return -2; - -#ifdef ALLOW_UNICODE - if (m_psd->m_wFlags & SDF_UNICODE) - { - char_t* pszConv=NULL; - int_t iRes=-1; - if (convert_to_ansi((wchar_t*)m_psd->m_pszBuffer, &pszConv) > 0) - iRes=strnicmp(psz, pszConv, tLen); - - delete [] pszConv; - - return iRes; - } - else - { -#endif - return strnicmp(m_psd->m_pszBuffer, psz, tLen); -#ifdef ALLOW_UNICODE - } -#endif -} - -#ifdef ALLOW_UNICODE -/** Function compares a given count of characters of own internal buffer content - * with a given unicode string. Comparison is case insensitive. - * \param[in] psz - unicode string to compare - * \param[in] tLen - count of characters to compare (-1 to detect shorter string) - * \param[in] bLenCheck - causes the function to check if the len given as a param - * is valid (if not then -2 is returned) - * \return <0 if this string object is "less" than psz, 0 if they are equal and >0 otherwise. - */ -int_t string::cmpin(const wchar_t* psz, size_t tLen, bool bLenCheck) const -{ - assert(psz); - - // if len is -1 then set len to the shorter len - if (tLen == (size_t)-1) - { - tLen=length(); - size_t t=wcslen(psz); - if (tLen > t) - tLen=t; - } - - // make a length check to avoid running out of range - if (bLenCheck && (tLen > length() || tLen > wcslen(psz))) - return -2; - - if (m_psd->m_wFlags & SDF_UNICODE) - { - return wcsnicmp((wchar_t*)m_psd->m_pszBuffer, psz, tLen); - } - else - { - char_t* pszConv=NULL; - int_t iRes=-1; - if (convert_to_ansi(psz, &pszConv) > 0) - iRes=strnicmp(m_psd->m_pszBuffer, pszConv, tLen); - - delete [] pszConv; - - return iRes; - } -} -#endif - -/** Function compares a given count of characters of own internal buffer content - * with a given string object. Comparison is case insensitive. - * \param[in] str - string object to compare - * \param[in] tLen - count of characters to compare (-1 to detect shorter string) - * \param[in] bLenCheck - causes the function to check if the len given as a param - * is valid (if not then -2 is returned) - * \return <0 if this string object is "less" than str, 0 if they are equal and >0 otherwise. - */ -int_t string::cmpin(const string& str, size_t tLen, bool bLenCheck) const -{ - // if len is -1 then set len to the shorter len - if (tLen == (size_t)-1) - { - tLen=length(); - size_t t=str.length(); - if (tLen > t) - tLen=t; - } - - // make a length check to avoid running out of range - if (bLenCheck && (tLen > length() || tLen > str.length())) - return -2; - -#ifdef ALLOW_UNICODE - if (str.is_unicode()) - { - if (is_unicode()) - { - // both strings unicode - return wcsnicmp((wchar_t*)str.m_psd->m_pszBuffer, (wchar_t*)m_psd->m_pszBuffer, tLen); - } - else - { - // only the external string is unicode - char_t* pszConv=NULL; - int_t iRes=-1; - if (convert_to_ansi((wchar_t*)str.m_psd->m_pszBuffer, &pszConv) > 0) - iRes=strnicmp(pszConv, m_psd->m_pszBuffer, tLen); - - delete [] pszConv; - - return iRes; - } - } - else - { - if (is_unicode()) - { - // only internal string unicode - char_t* pszConv=NULL; - int_t iRes=-1; - if (convert_to_ansi((wchar_t*)m_psd->m_pszBuffer, &pszConv) > 0) - iRes=strnicmp(pszConv, str.m_psd->m_pszBuffer, tLen); - - delete [] pszConv; - - return iRes; - } - else - { -#endif - // both string ansi - return strnicmp(str.m_psd->m_pszBuffer, m_psd->m_pszBuffer, tLen); -#ifdef ALLOW_UNICODE - } - } -#endif -} - -/** Returns a character at a given position. Function is very slow (needs to recalc the size of the string - * and make a few comparisons), but quite safe - if the index is out of range then -1 is returned. - * Make sure to interpret the returned character according to unicode flag. If the string is unicode, then the - * character returned is also unicode (and vice versa). - * \param[in] tPos - index of the character to return. - * \return Character code of character on a specified position, or -1 if out of range. - */ -int_t string::at(size_t tPos) const -{ - size_t tSize=length(); // very slow -#ifdef ALLOW_UNICODE - if (is_unicode()) - { - if (tPos < tSize) - return (int_t)(((wchar_t*)m_psd->m_pszBuffer)[tPos]); - else - return -1; - } - else - { -#endif - if (tPos < tSize) - return (int_t)(((char_t*)m_psd->m_pszBuffer)[tPos]); - else - return -1; -#ifdef ALLOW_UNICODE - } -#endif -} - -/** Returns a pointer to the ansi internal buffer. If the buffer is in unicode format - * then NULL value is returned. Internal buffer is resized to the specified value - * if currently smaller than requested (if -1 is specified as tMinSize then the buffer - * is not resized, and the return value could be NULL). - * \param[in] tMinSize - requested minimal size of the internal buffer (-1 if the size is not to be changed). - * \return Pointer to the internal ansi buffer. - */ -char_t* string::get_buffera(size_t tMinSize) -{ -#ifdef ALLOW_UNICODE - assert(!(m_psd->m_wFlags & SDF_UNICODE)); - - if (m_psd->m_wFlags & SDF_UNICODE) - return NULL; -#endif - - // resize buffer if needed - if (tMinSize != (size_t)-1 && tMinSize > m_psd->m_tBufSize) - m_psd->resize_buffer_check(ROUNDUP(tMinSize, CHUNK_INCSIZE), true); - - return m_psd->m_pszBuffer; -} - -#ifdef ALLOW_UNICODE -/** Returns a pointer to the unicode internal buffer. If the buffer is in ansi format - * then NULL value is returned. Internal buffer is resized to the specified value - * if currently smaller than requested (if -1 is specified as tMinSize then the buffer - * is not resized, and the return value could be NULL). - * \param[in] tMinSize - requested minimal size of the internal buffer (-1 if the size of the string should not be changed) - * \return Pointer to the internal unicode buffer. - */ -wchar_t* string::get_bufferu(size_t tMinSize) -{ - assert(m_psd->m_wFlags & SDF_UNICODE); - - if (!(m_psd->m_wFlags & SDF_UNICODE)) - return NULL; - - if (tMinSize != (size_t)-1 && tMinSize > m_psd->m_tBufSize) - m_psd->resize_buffer_check(ROUNDUP(tMinSize, CHUNK_INCSIZE), true); - - return (wchar_t*)m_psd->m_pszBuffer; -} -#endif - -/** Releases buffer got by user by calling get_bufferx functions. The current - * job of this function is to make sure the string will terminate with null - * character at the end of the buffer. - */ -void string::release_buffer() const -{ - // just to make sure user does not crash everything -#ifdef ALLOW_UNICODE - if (is_unicode()) - ((wchar_t*)m_psd->m_pszBuffer)[m_psd->m_tBufSize-1]=L'\0'; - else -#endif - m_psd->m_pszBuffer[m_psd->m_tBufSize-1]='\0'; -} - -#ifdef ALLOW_UNICODE -/** Converts the internal buffer contents to the unicode format (if not already - * unicode). - */ -void string::make_unicode() -{ - assert(m_psd); - if (!is_unicode()) - { - // make a string conversion - if (m_psd->m_pszBuffer) - { - wchar_t* pszOut; - size_t tSize=convert_to_unicode(m_psd->m_pszBuffer, &pszOut); - - // delete the current buffer - make_writable(MWF_DELETE); - - // assign a new buffer - m_psd->assign(pszOut, tSize); - } - else - m_psd->switch_unicode(); - } -} - -/** Converts the internal buffer contents to the ansi format (if not already - * ansi). - */ -void string::make_ansi() -{ - if (is_unicode()) - { - if (m_psd->m_pszBuffer) - { - // make a string conversion - char_t* pszOut; - size_t tSize=convert_to_ansi((wchar_t*)m_psd->m_pszBuffer, &pszOut); - - // delete the current buffer - make_writable(MWF_DELETE); - - // assign a new buffer - m_psd->assign(pszOut, tSize); - } - else - m_psd->switch_ansi(); - } -} -#endif - -/** Dumps internal contents of this class. - * \param[in] pctx - dump context to receive object info - */ -void string::dump(dumpctx* pctx) -{ - pctx->open("string"); - pctx->dump("m_psd", (ptr_t)m_psd); -#ifdef ALLOW_UNICODE - if (is_unicode()) - pctx->dump("m_psd->m_pszBuffer [unicode]", (wchar_t*)m_psd->m_pszBuffer); - else -#endif - pctx->dump("m_psd->m_pszBuffer [ansi]", m_psd->m_pszBuffer); - - pctx->dump("m_psd->m_tBufSize", (longlong_t)m_psd->m_tBufSize); - pctx->dump("m_psd->m_wRefCount", m_psd->m_wRefCount); - pctx->dump("m_psd->m_wFlags", m_psd->m_wFlags); - pctx->close(); -} - -/** Displays the string contents on screen using standard printf function. The format of displayed - * string is either ansi("string_content") or unicode("string_content"). - */ -void string::print() const -{ -#ifdef ALLOW_UNICODE - if (is_unicode()) - printf("unicode(\"" WSTRFMT "\")", (wchar_t*)m_psd->m_pszBuffer); - else -#endif - printf("ansi(\"" STRFMT "\")", (char_t*)m_psd->m_pszBuffer); -} - -/** Cast operator - tries to return a pointer to char_t* using the current internal - * buffer. If the internal buffer is in unicode format, then the debug version asserts - * and release return NULL. - * \return Pointer to an ansi string (could be null). - */ -string::operator const char_t*() const -{ - if (m_psd->m_pszBuffer) - { -#ifdef ALLOW_UNICODE - if (m_psd->m_wFlags & SDF_UNICODE) - { - // what to do here - convert using external buffer or assert ? - assert(false); // cannot cast unicode string to the ansi one using operator - return NULL; - } - else -#endif - return m_psd->m_pszBuffer; - } - else - return ""; -} - -#ifdef ALLOW_UNICODE -/** Cast operator - tries to return a pointer to wchar_t* using the current internal - * buffer. If the internal buffer is in ansi format, then the debug version asserts - * and release return NULL. - * \return Pointer to an unicode string (could be null). - */ -string::operator const wchar_t*() const -{ - assert(m_psd); - if (m_psd->m_pszBuffer) - { - if (m_psd->m_wFlags & SDF_UNICODE) - return (wchar_t*)m_psd->m_pszBuffer; - else - { - assert(false); // cannot cast ansi string to unicode using operator - return NULL; - } - } - else - return L""; -} -#endif - -#ifdef ALLOW_UNICODE -/** Function converts unicode string into the ansi one. The output buffer is - * allocated by this function and needs to be deleted by user. - * \param[in] pszIn - unicode string to be converted - * \param[out] pszOut - ptr to the char_t* that will receive new buffer's address - * \return Size of the output string (including the terminating '\\0' character). - * \todo Add detecting default system charset (linux) instead of hard-coding iso8859-2. - */ -size_t string::convert_to_ansi(const wchar_t* pszIn, char_t** pszOut) -{ - assert(pszIn && pszOut); - -#ifdef _WIN32 - size_t tLen; - if ( (tLen=(size_t)WideCharToMultiByte(CP_ACP, 0, pszIn, -1, NULL, 0, NULL, NULL)) != 0 ) - { - *pszOut=new char_t[tLen]; - return (size_t)WideCharToMultiByte(CP_ACP, 0, pszIn, -1, *pszOut, (int_t)tLen, NULL, NULL); - } - else - { - *pszOut=NULL; - return 0; - } -#else - // FIXME: the destination charset should be the default system one and not hard-coded iso8859-2 - // NOTE: do not use this func to convert strings from/to a file (especially on gnu linux - // where unicode (wchar_t) characters has 4 bytes instead of 2 - iconv_t it=iconv_open("ISO8859-2", "WCHAR_T"); - - // alloc some memory - size_t tOutLen=wcslen(pszIn)+1, tInLen=tOutLen*sizeof(wchar_t); - size_t tTotal=tOutLen; - char_t* psz=new char_t[tInLen], *pszStart=psz; - - if (iconv(it, (char_t**)&pszIn, &tInLen, (char_t**)&psz, &tOutLen) != (size_t)-1) - { - // close conversion object - iconv_close(it); - - // store ptr - *pszOut=pszStart; - return tTotal-tOutLen; - } - else - { - // close conversion object - iconv_close(it); - - // return nothing - delete [] psz; - *pszOut=NULL; - return 0; - } -#endif -} - -/** Function converts ansi string into the unicode one. The output buffer is - * allocated by this function and needs to be deleted by user. - * \param[in] pszIn - ansi string to be converted - * \param[out] pszOut - ptr to the wchar_t* that will receive new buffer's address - * \return Size of the output string (including the terminating '\\0' character). - * \todo Add detecting default system charset (linux) instead of hard-coding iso8859-2. - */ -size_t string::convert_to_unicode(const char_t* pszIn, wchar_t** pszOut) -{ - assert(pszIn && pszOut); - -#ifdef _WIN32 - size_t tLen; - if ( (tLen=(size_t)MultiByteToWideChar(CP_ACP, 0, pszIn, -1, NULL, 0)) != 0 ) - { - *pszOut=new wchar_t[tLen]; - return (size_t)MultiByteToWideChar(CP_ACP, 0, pszIn, -1, *pszOut, (int_t)tLen); - } - else - { - *pszOut=NULL; - return 0; - } -#else - // FIXME: correct the character set from hard-coded iso8859-2 to the native system's one - // NOTE: do not use to convert charsets when reading/writing to file - iconv_t it=iconv_open("WCHAR_T", "ISO8859-2"); - if (it == (iconv_t)-1) - { - *pszOut=NULL; - return 0; - } - - // alloc some memory - // NOTE: outlen is only inlen*sizeof(wchar_t) because of 4-byte wchar_t chars in gnu/linux - size_t tInLen=strlen(pszIn)+1, tOutLen=tInLen*sizeof(wchar_t); - size_t tTotal=tInLen; - wchar_t* psz=new wchar_t[tInLen], *pszStart=psz; - - if (iconv(it, (char_t**)&pszIn, &tInLen, (char_t**)&psz, &tOutLen) != (size_t)-1) - { - // close conversion object - iconv_close(it); - - // store the pointer - *pszOut=pszStart; - - return tTotal-tOutLen; - } - else - { - // close conversion handle - iconv_close(it); - - // return nothing - delete [] pszStart; - *pszOut=NULL; - return 0; - } -#endif -} -#endif - -/** Function makes the internal data object writable, copies the given ansi string into - * the internal string buffer and removes the unicode flag if needed. - * \param[in] pszStr - source ansi string - */ -void string::set_str(const char_t* pszStr) -{ - assert(pszStr); - - // make writable without allocating any buffer - make_writable(MWF_PARTIALDEL); - - // make sure the buffer is in ansi mode - m_psd->switch_ansi(); - - size_t tLen=strlen(pszStr)+1; // new str length - m_psd->resize_buffer_check(ROUNDUP(tLen, CHUNK_INCSIZE), false); - strcpy(m_psd->m_pszBuffer, pszStr); -} - -#ifdef ALLOW_UNICODE -/** Function makes the internal data object writable, copies the given unicode string into - * the internal string buffer and sets the unicode flag if needed. - * \param[in] pszStr - source unicode string - */ -void string::set_str(const wchar_t* pszStr) -{ - assert(pszStr); - - make_writable(MWF_PARTIALDEL); - m_psd->switch_unicode(); - - size_t tLen=wcslen(pszStr)+1; // new str length - m_psd->resize_buffer_check(ROUNDUP(tLen, CHUNK_INCSIZE), false); - wcscpy((wchar_t*)m_psd->m_pszBuffer, pszStr); -} -#endif - -/** Function prepares the internal data object to make any modifications to it. - * If the reference count of the underlying data object is greater than 1 (it means - * more than 1 string is using that object) the function makes an own copy of it, else - * nothing is done. - * \param[in] iType - type of making writable (MWF_*) - * \param[in] pParam - type dependent parameter - */ -void string::make_writable(int_t iType, ptr_t pParam) -{ - assert(m_psd->m_wRefCount > 0); - - // check if we need to make our own copy of data - if (m_psd->m_wRefCount > 1) - { - switch(iType) - { - case MWF_COPY: - { - // make a copy of the internal data object and set it as internal after releasing the old one - str_data* psd=m_psd->dup(); - release_data(); - m_psd=psd; - break; - } - case MWF_PARTIALDEL: - case MWF_DELETE: - { - // alloc only the internal data object and do not allocate the string buffer - str_data* psd=new str_data(m_psd->m_wFlags); - release_data(); - m_psd=psd; - break; - } - case MWF_NEW: - { - // alloc the new internal string data object and make there an empty string - str_data* psd=new str_data(m_psd->m_wFlags); - psd->resize_buffer_check(ROUNDUP((size_t)pParam, CHUNK_INCSIZE), false); - release_data(); - m_psd=psd; - break; - } - default: - assert(false); // some strange flag - break; - } - } - else - { - switch(iType) - { - case MWF_COPY: - { - // do nothing - the object is in requested state - break; - } - case MWF_DELETE: - { - // the thing to do is to delete the internal string without deleting the internal data object - m_psd->free_buffer(); - break; - } - case MWF_NEW: - { - // only resize the internal buffer - m_psd->resize_buffer_check(ROUNDUP((size_t)pParam, CHUNK_INCSIZE), false); - break; - } - case MWF_PARTIALDEL: - { - // left the string buffer as is - break; - } - default: - assert(false); // some strange flag - } - } -} - -/** Function releases the underlying data object. It means that reference count for - * that object is decreased and if the ref count is 0 - the object is freed. - */ -void string::release_data() -{ - assert(m_psd); - if (m_psd->dec_refcount()) - delete m_psd; - m_psd=NULL; -} - -END_ICPF_NAMESPACE Index: ext/libicpf/src/str.h =================================================================== diff -u -N --- ext/libicpf/src/str.h (revision 2446443341715955423610c01b43fe7841a10e3e) +++ ext/libicpf/src/str.h (revision 0) @@ -1,304 +0,0 @@ -/*************************************************************************** - * Copyright (C) 2004-2006 by J�zef Starosczyk * - * ixen@copyhandler.com * - * * - * This program is free software; you can redistribute it and/or modify * - * it under the terms of the GNU Library General Public License as * - * published by the Free Software Foundation; either version 2 of the * - * License, or (at your option) any later version. * - * * - * 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 Library General Public * - * License along with this program; if not, write to the * - * Free Software Foundation, Inc., * - * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. * - ***************************************************************************/ -#ifndef __STR_H__ -#define __STR_H__ - -/** \file str.h - * \brief Contain string management classes - */ - -#include "libicpf.h" -#include "gen_types.h" -#include -#include "macros.h" - -#ifdef ALLOW_UNICODE - #include -#endif - -#ifndef _WIN32 - #include -#endif - -BEGIN_ICPF_NAMESPACE - -/// External class - to avoid inclusion of dumpctx.h -class dumpctx; -class string; - -/////////////////////////////////////////////////////////////// -// str_data flags -/// Standard string data flags -#define SDF_NONE 0x0000 - -/// The string is unicode -#define SDF_UNICODE 0x0001 - -////////////////////////////////////////////////////////////// -// make_writable flags -/// Standard - makes a copy of an underlying object if reference count >1 -#define MWF_COPY 0x00000000 -/// Causes the internal string buffer to be deleted -#define MWF_DELETE 0x00000001 -/// Causes new buffer to be allocated with a specified size (empty one) -#define MWF_NEW 0x00000002 -/** \brief Partial delete. - * - * If the object has to be allocated then it's done *without* allocating the internal buffer. - * Else the buffer is left as is. - */ -#define MWF_PARTIALDEL 0x00000003 - -/** \brief String storage class (helper) - * - * The class is used by the ch::string class as a helper that contains - * all of the string data. Allows to use the reference counting strings. - */ -class LIBICPF_API str_data -{ -public: -/** \name Construction/destruction */ -/*@{*/ - explicit str_data(short_t wFlags); - ~str_data(); -/*@}*/ - -/** \name Operations */ -/*@{*/ - /// Increases reference count - void inc_refcount() { ++m_wRefCount; }; - - /** \brief Decreases refcount - * - * \return True when it's safe to delete this object or false if not. - */ - bool dec_refcount() { if (--m_wRefCount > 0) return false; else return true; }; - - // sizes the buffer with and wo size checking - void resize_buffer(size_t tNewSize, bool bCopy); ///< Changes the size of the internal buffer with size checking - void resize_buffer_check(size_t tNewSize, bool bCopy); ///< Changes the size of the internal string buffer without size checking - - // length checks - size_t length() const; ///< Returns the length of this string in chars (without terminating null character) - size_t bytelen() const; ///< Returns the length of a string in bytes (with terminating null character) - -#ifdef ALLOW_UNICODE - void switch_unicode(); ///< Changes the internal buffer type to unicode (nullifies the string) - void switch_ansi(); ///< Changes the internal buffer type to ansi (nullifies the string) -#endif - - - void assign(char_t* pszSrc, size_t tLen); ///< Assigns an ansi buffer as the internal string data -#ifdef ALLOW_UNICODE - void assign(wchar_t* pszSrc, size_t tLen); ///< Assigns an unicode buffer as the internal string data -#endif - - /// Frees the internal buffer - void free_buffer(); - - /// Duplicates this object - str_data* dup(); - -/*@}*/ - -protected: - char_t* m_pszBuffer; ///< Contents of the string (could be the wchar_t*) - size_t m_tBufSize; ///< Size of the buffer (in chars, *NOT* bytes) - short_t m_wRefCount; ///< Reference count - short_t m_wFlags; ///< Flags - - friend class string; -}; - -/////////////////////////////////////////////////////////////// -// string manipulation class -/** \brief String manipulation class - * - * Class allows user to manipulate string objects (either standard ANSI char_t* - * based strings or UNICODE ones - wchar_t related) with simple functions and - * operators. - */ -class LIBICPF_API string -{ -public: -/** \name Construction/destruction */ -/*@{*/ - string(); ///< Standard constructor - explicit string(const char_t* pszStr); ///< Constructor that takes const char_t* as an initial string -#ifdef ALLOW_UNICODE - explicit string(const wchar_t* pszStr); ///< Constructor that takes const wchar_t* as an initial string -#endif - string(const string& str); ///< Standard copy constructor - - ~string(); ///< Standard destructor -/*@}*/ - -/** \name Operators */ -/**@{*/ - // assignment - const string& operator=(const string& src); ///< Assign operator for string objects - const string operator+(const string& src) const; ///< Concatenate operator for string objects - const string& operator+=(const string& src); ///< Merge operator for string objects - - const string& operator=(const char_t* pszSrc); ///< Assign operator for ansi strings - const string operator+(const char_t* pszSrc) const; ///< Concatenate operator for ansi strings - const string& operator+=(const char_t* pszSrc); ///< Merge operator for ansi strings - -#ifdef ALLOW_UNICODE - const string& operator=(const wchar_t* pszSrc); ///< Assign operator from unicode strings - const string operator+(const wchar_t* pszSrc) const; ///< Concatenate operator for unicode strings - const string& operator+=(const wchar_t* pszSrc); ///< Merge operator for unicode strings -#endif - - // comparison - /// Makes case sensitive comparison to the ansi string ( see cmp(const char_t* psz) ) - bool operator<(const char_t* psz) const { return cmp(psz) < 0; }; - /// Makes case sensitive comparison to the ansi string ( see cmp(const char_t* psz) ) - bool operator<=(const char_t* psz) const { return cmp(psz) <= 0; }; - /// Makes case sensitive comparison to the ansi string ( see cmp(const char_t* psz) ) - bool operator==(const char_t* psz) const { return cmp(psz) == 0; }; - /// Makes case sensitive comparison to the ansi string ( see cmp(const char_t* psz) ) - bool operator>=(const char_t* psz) const { return cmp(psz) >= 0; }; - /// Makes case sensitive comparison to the ansi string ( see cmp(const char_t* psz) ) - bool operator>(const char_t* psz) const { return cmp(psz) > 0; }; - /// Makes case sensitive comparison to the ansi string ( see cmp(const char_t* psz) ) - bool operator!=(const char_t* psz) const { return cmp(psz) != 0; }; - - /// Makes case sensitive comparison to the unicode string ( see cmp(const wchar_t* psz) ) - bool operator<(const wchar_t* psz) const { return cmp(psz) < 0; }; - /// Makes case sensitive comparison to the unicode string ( see cmp(const wchar_t* psz) ) - bool operator<=(const wchar_t* psz) const { return cmp(psz) <= 0; }; - /// Makes case sensitive comparison to the unicode string ( see cmp(const wchar_t* psz) ) - bool operator==(const wchar_t* psz) const { return cmp(psz) == 0; }; - /// Makes case sensitive comparison to the unicode string ( see cmp(const wchar_t* psz) ) - bool operator>=(const wchar_t* psz) const { return cmp(psz) >= 0; }; - /// Makes case sensitive comparison to the unicode string ( see cmp(const wchar_t* psz) ) - bool operator>(const wchar_t* psz) const { return cmp(psz) > 0; }; - /// Makes case sensitive comparison to the unicode string ( see cmp(const wchar_t* psz) ) - bool operator!=(const wchar_t* psz) const { return cmp(psz) != 0; }; - -#ifdef ALLOW_UNICODE - /// Makes case sensitive comparison to the string object ( see cmp(const string& str) ) - bool operator<(const string& str) const { return cmp(str) < 0; }; - /// Makes case sensitive comparison to the string object ( see cmp(const string& str) ) - bool operator<=(const string& str) const { return cmp(str) <= 0; }; - /// Makes case sensitive comparison to the string object ( see cmp(const string& str) ) - bool operator==(const string& str) const { return cmp(str) == 0; }; - /// Makes case sensitive comparison to the string object ( see cmp(const string& str) ) - bool operator>=(const string& str) const { return cmp(str) >= 0; }; - /// Makes case sensitive comparison to the string object ( see cmp(const string& str) ) - bool operator>(const string& str) const { return cmp(str) >= 0; }; - /// Makes case sensitive comparison to the string object ( see cmp(const string& str) ) - bool operator!=(const string& str) const { return cmp(str) != 0; }; -#endif - - // cast operators - operator const char_t*() const; ///< Cast operator to char_t* -#ifdef ALLOW_UNICODE - operator const wchar_t*() const; ///< Cast operator to wchar_t* -#endif -/**@}*/ - -/** \name Standard operations */ -/**@{*/ - // appends the given string to this - void merge(const char_t* pszSrc); ///< Appends an ansi string to the string object - void merge(const wchar_t* pszSrc); ///< Appends an unicode string to the string object - void merge(const string& src); ///< Appends a string object to another string object - - string left(size_t tLen) const; ///< Returns string with the left part of a source string - string right(size_t tLen) const; ///< Returns string with the right part of a source string - string mid(size_t tStart, size_t tLen=(size_t)-1) const; ///< Returns string with the middle part of a source string - - void left_self(size_t tLen, bool bReallocBuffer=true); ///< Makes this string it's left part - void right_self(size_t tLen, bool bReallocBuffer=true); ///< Makes this string it's right part - void mid_self(size_t tStart, size_t tLen=(size_t)-1, bool bReallocBuffer=true); ///< Makes this string it's middle part - - // comparation - int_t cmp(const char_t* psz) const; ///< Comparison of this string object with a given ansi string - int_t cmp(const wchar_t* psz) const; ///< Comparison of this string object with a given unicode string - int_t cmp(const string& str) const; ///< Comparison of this string object with another string object - - int_t cmpi(const char_t* psz) const; ///< Comparison (case insensitive) of this string object with a given ansi string - int_t cmpi(const wchar_t* psz) const; ///< Comparison (case insensitive) of this string object with a given unicode string - int_t cmpi(const string& str) const; ///< Comparison (case insensitive) of this string object with another string object - - int_t cmpn(const char_t* psz, size_t tLen, bool bLenCheck=true) const; ///< Compares some chars of the string object with a given ansi string - int_t cmpn(const wchar_t* psz, size_t tLen, bool bLenCheck=true) const; ///< Compares some chars of the string object with a given unicode string - int_t cmpn(const string& str, size_t tLen, bool bLenCheck=true) const; ///< Compares some chars of the string object with another string object - - int_t cmpin(const char_t* psz, size_t tLen, bool bLenCheck=true) const; ///< Compares (case insensitive) some chars of the string object with a given ansi string - int_t cmpin(const wchar_t* psz, size_t tLen, bool bLenCheck=true) const; ///< Compares (case insensitive) some chars of the string object with a given unicode string - int_t cmpin(const string& str, size_t tLen, bool bLenCheck=true) const; ///< Compares (case insensitive) some chars of the string object with another string object - - int_t at(size_t tPos) const; ///< Gets a character at a specified position - char_t* get_buffera(size_t tMinSize); ///< Gives user access to the ansi internal buffer - wchar_t* get_bufferu(size_t tMinSize); ///< Gives user access to the unicode internal buffer - void release_buffer() const; ///< Releases the buffer get from get_bufferx functions - - size_t length() const; ///< Returns the length of this string in chars - size_t bytelen() const; ///< Returns the length of a string in bytes (with terminating null character) - - void clear(); ///< Clear the contents of the string object - - bool is_empty() const; ///< Returns true if the string is empty -/**@}*/ - -/** \name Conversion routines */ -/**@{*/ -#ifdef ALLOW_UNICODE - /// Checks if string is in unicode storage mode - bool is_unicode() const { return m_psd->m_wFlags & SDF_UNICODE; }; - - void make_unicode(); ///< Makes the string internal buffer unicode - void make_ansi(); ///< Makes the string internal buffer ansi -#endif -/**@}*/ - -/** \name Debug stuff */ -/**@{*/ - void dump(dumpctx* pctx); ///< Dumps the contents of this class to the dump context - void print() const; ///< Prints the contents of this class -/**@}*/ - -protected: - void set_str(const char_t* pszStr); ///< Makes a copy of a given ansi string and store it in internal string buffer -#ifdef ALLOW_UNICODE - void set_str(const wchar_t* pszStr); ///< Makes a copy of a given unicode string and store it in internal string buffer -#endif - - // converts the internal buffer to the other format -#ifdef ALLOW_UNICODE - static size_t convert_to_ansi(const wchar_t* pszIn, char_t** pszOut); ///< Converts an unicode string into the ansi one - static size_t convert_to_unicode(const char_t* pszIn, wchar_t** pszOut); ///< Converts an ansi string into the unicode one -#endif - - void make_writable(int_t iType, ptr_t pParam=NULL); ///< Makes an underlying data object writable - - // checks the refcount and frees the data (refcount <=0) or leaves untouched (refcount >0) - void release_data(); ///< Releases an underlying data object from this string (if refcount <= 0 then data object is deleted) - -protected: - str_data *m_psd; ///< Pointer to an underlying data object (str_data) -}; - -END_ICPF_NAMESPACE - -#endif