123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178 |
- /**
- * @file bitpack.cpp
- * @brief Convert data to packed bit stream
- *
- * $LicenseInfo:firstyear=2000&license=viewergpl$
- *
- * Copyright (c) 2000-2009, Linden Research, Inc.
- *
- * Second Life Viewer Source Code
- * The source code in this file ("Source Code") is provided by Linden Lab
- * to you under the terms of the GNU General Public License, version 2.0
- * ("GPL"), unless you have obtained a separate licensing agreement
- * ("Other License"), formally executed by you and Linden Lab. Terms of
- * the GPL can be found in doc/GPL-license.txt in this distribution, or
- * online at http://secondlifegrid.net/programs/open_source/licensing/gplv2
- *
- * There are special exceptions to the terms and conditions of the GPL as
- * it is applied to this Source Code. View the full text of the exception
- * in the file doc/FLOSS-exception.txt in this software distribution, or
- * online at
- * http://secondlifegrid.net/programs/open_source/licensing/flossexception
- *
- * By copying, modifying or distributing this software, you acknowledge
- * that you have read and understood your obligations described above,
- * and agree to abide by those obligations.
- *
- * ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO
- * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,
- * COMPLETENESS OR PERFORMANCE.
- * $/LicenseInfo$
- */
- #include "linden_common.h"
- #include "llbitpack.h"
- U32 LLBitPack::bitPack(U8* total_data, U32 total_dsize)
- {
- while (total_dsize > 0)
- {
- U32 dsize;
- if (total_dsize > MAX_DATA_BITS)
- {
- dsize = MAX_DATA_BITS;
- total_dsize -= MAX_DATA_BITS;
- }
- else
- {
- dsize = total_dsize;
- total_dsize = 0;
- }
- U8 data = *total_data++;
- data <<= (MAX_DATA_BITS - dsize);
- while (dsize > 0)
- {
- if (mLoadSize == MAX_DATA_BITS)
- {
- *(mBuffer + mBufferSize++) = mLoad;
- if (mBufferSize > mMaxSize)
- {
- llerrs << "mBufferSize exceeding mMaxSize !" << llendl;
- }
- mLoadSize = 0;
- mLoad = 0x00;
- }
- mLoad <<= 1;
- mLoad |= data >> (MAX_DATA_BITS - 1);
- data <<= 1;
- ++mLoadSize;
- ++mTotalBits;
- --dsize;
- }
- }
- return mBufferSize;
- }
- U32 LLBitPack::bitCopy(U8* total_data, U32 total_dsize)
- {
- while (total_dsize > 0)
- {
- U32 dsize;
- if (total_dsize > MAX_DATA_BITS)
- {
- dsize = MAX_DATA_BITS;
- total_dsize -= MAX_DATA_BITS;
- }
- else
- {
- dsize = total_dsize;
- total_dsize = 0;
- }
- U8 data = *total_data++;
- while (dsize > 0)
- {
- if (mLoadSize == MAX_DATA_BITS)
- {
- *(mBuffer + mBufferSize++) = mLoad;
- if (mBufferSize > mMaxSize)
- {
- llerrs << "mBufferSize exceeding mMaxSize !" << llendl;
- }
- mLoadSize = 0;
- mLoad = 0x00;
- }
- mLoad <<= 1;
- mLoad |= (data >> (MAX_DATA_BITS - 1));
- data <<= 1;
- ++mLoadSize;
- ++mTotalBits;
- --dsize;
- }
- }
- return mBufferSize;
- }
- U32 LLBitPack::bitUnpack(U8* total_retval, U32 total_dsize)
- {
- while (total_dsize > 0)
- {
- U32 dsize;
- if (total_dsize > MAX_DATA_BITS)
- {
- dsize = MAX_DATA_BITS;
- total_dsize -= MAX_DATA_BITS;
- }
- else
- {
- dsize = total_dsize;
- total_dsize = 0;
- }
- U8* retval = total_retval++;
- *retval = 0x00;
- while (dsize > 0)
- {
- if (mLoadSize == 0)
- {
- #if LL_DEBUG
- if (mBufferSize > mMaxSize)
- {
- llerrs << "mBufferSize exceeding mMaxSize" << llendl;
- llerrs << mBufferSize << " > " << mMaxSize << llendl;
- }
- #endif
- mLoad = *(mBuffer + mBufferSize++);
- mLoadSize = MAX_DATA_BITS;
- }
- *retval <<= 1;
- *retval |= (mLoad >> (MAX_DATA_BITS - 1));
- --mLoadSize;
- mLoad <<= 1;
- --dsize;
- }
- }
- return mBufferSize;
- }
- U32 LLBitPack::flushBitPack()
- {
- if (mLoadSize)
- {
- mLoad <<= (MAX_DATA_BITS - mLoadSize);
- *(mBuffer + mBufferSize++) = mLoad;
- if (mBufferSize > mMaxSize)
- {
- llerrs << "mBufferSize exceeding mMaxSize !" << llendl;
- }
- mLoadSize = 0;
- }
- return mBufferSize;
- }
|