scummvm/util.cpp
2002-08-18 22:24:39 +00:00

313 lines
5.8 KiB
C++

/* ScummVM - Scumm Interpreter
* Copyright (C) 2002 The ScummVM project
*
* 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.
*
* $Header$
*/
#include "stdafx.h"
#include "util.h"
// 8-bit alpha blending routines
int BlendCache[256][256];
int RGBMatch(byte *palette, int r, int g, int b)
{
int i, bestidx = 0, besterr = 0xFFFFFF;
int error = 0;
for (i = 0;i < 256;i++) {
byte *pal = palette + (i * 3);
int r_diff = r - (int)*pal++;
int g_diff = g - (int)*pal++;
int b_diff = b - (int)*pal++;
r_diff *= r_diff; g_diff *= g_diff; b_diff *= b_diff;
error = r_diff + g_diff + b_diff;
if (error < besterr) {
besterr = error;
bestidx = i;
}
}
return bestidx;
}
int Blend(int src, int dst, byte *palette)
{
int r, g, b;
int alpha = 128; // Level of transparency [0-256]
byte *srcpal = palette + (dst * 3);
byte *dstpal = palette + (src * 3);
if (BlendCache[dst][src] > -1)
return BlendCache[dst][src];
r = (*srcpal++ * alpha);
r += (*dstpal++ * (256-alpha));
r /= 256;
g = (*srcpal++ * alpha);
g += (*dstpal++ * (256-alpha));
g /= 256;
b = (*srcpal++ * alpha);
b += (*dstpal++ * (256-alpha));
b /= 256;
return (BlendCache[dst][src] = RGBMatch(palette, r , g , b ));
}
void ClearBlendCache(byte *palette, int weight)
{
for (int i = 0; i < 256; i++)
for (int j = 0 ; j < 256 ; j++)
// BlendCache[i][j] = i; // No alphablending
// BlendCache[i][j] = j; // 100% translucent
BlendCache[i][j] = -1; // Enable alphablending
}
#pragma mark -
/*
* Print hexdump of the data passed in, 8 bytes a row
*/
void hexdump(const byte * data, int len)
{
int i;
byte c;
while (len >= 8) {
for (i = 0; i < 8; i++)
printf("%02x ", data[i]);
printf(" |");
for (i = 0; i < 8; i++) {
c = data[i];
if (c < 32 || c > 127)
c = '.';
printf("%c", c);
}
printf("|\n");
data += 8;
len -= 8;
}
if (len <= 0)
return;
for (i = 0; i < len; i++)
printf("%02x ", data[i]);
for (; i < 8; i++)
printf(" ");
printf(" |");
for (i = 0; i < len; i++) {
c = data[i];
if (c < 32 || c > 127)
c = '.';
printf("%c", c);
}
for (; i < 8; i++)
printf(" ");
printf("|\n");
}
#pragma mark -
namespace ScummVM {
String::String(const char *str)
{
_refCount = new int(1);
_capacity = _len = strlen(str);
_str = (char *)calloc(1, _capacity+1);
memcpy(_str, str, _len+1);
}
String::String(const String &str)
{
++(*str._refCount);
_refCount = str._refCount;
_capacity = str._capacity;
_len = str._capacity;
_str = str._str;
}
String::~String()
{
decRefCount();
}
void String::decRefCount()
{
--(*_refCount);
if (*_refCount <= 0) {
delete _refCount;
if (_str)
free(_str);
}
}
String& String::operator =(const char* str)
{
int len = strlen(str);
if (len > 0) {
ensureCapacity(len, false);
_len = len;
memcpy(_str, str, _len + 1);
} else if (_len > 0) {
decRefCount();
_refCount = new int(1);
_capacity = 0;
_len = 0;
_str = 0;
}
return *this;
}
String& String::operator =(const String& str)
{
++(*str._refCount);
decRefCount();
_refCount = str._refCount;
_capacity = str._capacity;
_len = str._len;
_str = str._str;
return *this;
}
String& String::operator +=(const char* str)
{
int len = strlen(str);
if (len > 0) {
ensureCapacity(_len + len, true);
memcpy(_str + _len, str, len + 1);
_len += len;
}
return *this;
}
String& String::operator +=(const String& str)
{
int len = str._len;
if (len > 0) {
ensureCapacity(_len + len, true);
memcpy(_str + _len, str._str, len + 1);
_len += len;
}
return *this;
}
String& String::operator +=(char c)
{
ensureCapacity(_len + 1, true);
_str[_len++] = c;
_str[_len] = 0;
return *this;
}
bool String::operator ==(const String& x)
{
return (_len == x._len) && ((_len == 0) || (0 == strcmp(_str, x._str)));
}
bool String::operator ==(const char* x)
{
if (_str == 0)
return (x == 0) || (*x == 0);
if (x == 0)
return (_len == 0);
return (0 != strcmp(_str, x));
}
bool String::operator !=(const String& x)
{
return (_len != x._len) || ((_len != 0) && (0 != strcmp(_str, x._str)));
}
bool String::operator !=(const char* x)
{
if (_str == 0)
return (x != 0) && (*x != 0);
if (x == 0)
return (_len != 0);
return (0 == strcmp(_str, x));
}
void String::deleteLastChar() {
if (_len > 0) {
ensureCapacity(_len - 1, true);
_str[--_len] = 0;
}
}
void String::clear()
{
if (_capacity) {
decRefCount();
_refCount = new int(1);
_capacity = 0;
_len = 0;
_str = 0;
}
}
void String::ensureCapacity(int new_len, bool keep_old)
{
// If there is not enough space, or if we are not the only owner
// of the current data, then we have to reallocate it.
if (new_len <= _capacity && *_refCount == 1)
return;
int newCapacity = (new_len <= _capacity) ? _capacity : new_len + 32;
char *newStr = (char *)calloc(1, newCapacity+1);
if (keep_old && _str)
memcpy(newStr, _str, _len + 1);
else
_len = 0;
decRefCount();
_refCount = new int(1);
_capacity = newCapacity;
_str = newStr;
}
bool operator == (const char* y, const String& x)
{
return x == y;
}
bool operator != (const char* y, const String& x)
{
return x != y;
}
}; // End of namespace ScummVM