1

/* $Id$ */

     2

     3

#include "stdafx.h"

     4

#include "openttd.h"

     5

#include "debug.h"

     6

#include "functions.h"

     7

#include "spritecache.h"

     8

#include "table/sprites.h"

     9

#include "fileio.h"

    10

    11

#define SPRITE_CACHE_SIZE 1024*1024

    12

    13

#define WANT_NEW_LRU

    14

    15

    16

static void* _sprite_ptr[MAX_SPRITES];

    17

static uint32 _sprite_file_pos[MAX_SPRITES];

    18

    19

#if defined(WANT_NEW_LRU)

    20

static int16 _sprite_lru_new[MAX_SPRITES];

    21

#else

    22

static uint16 _sprite_lru[MAX_SPRITES];

    23

static uint16 _sprite_lru_cur[MAX_SPRITES];

    24

#endif

    25

    26

typedef struct MemBlock {

    27

	uint32 size;

    28

	byte data[VARARRAY_SIZE];

    29

} MemBlock;

    30

    31

static uint _sprite_lru_counter;

    32

static MemBlock *_spritecache_ptr;

    33

static int _compact_cache_counter;

    34

    35

static void CompactSpriteCache(void);

    36

    37

static bool ReadSpriteHeaderSkipData(void)

    38

{

    39

	uint16 num = FioReadWord();

    40

	byte type;

    41

    42

	if (num == 0) return false;

    43

    44

	type = FioReadByte();

    45

	if (type == 0xFF) {

    46

		FioSkipBytes(num);

    47

		return true;

    48

	}

    49

    50

	FioSkipBytes(7);

    51

	num -= 8;

    52

	if (num == 0) return true;

    53

    54

	if (type & 2) {

    55

		FioSkipBytes(num);

    56

	} else {

    57

		while (num > 0) {

    58

			int8 i = FioReadByte();

    59

			if (i >= 0) {

    60

				num -= i;

    61

				FioSkipBytes(i);

    62

			} else {

    63

				i = -(i >> 3);

    64

				num -= i;

    65

				FioReadByte();

    66

			}

    67

		}

    68

	}

    69

    70

	return true;

    71

}

    72

    73

static void* AllocSprite(size_t);

    74

    75

static void* ReadSprite(SpriteID id)

    76

{

    77

	uint num;

    78

	byte type;

    79

    80

	DEBUG(spritecache, 9) ("load sprite %d", id);

    81

    82

	if (_sprite_file_pos[id] == 0 && id != 0) {

    83

		error(

    84

			"Tried to load non-existing sprite #%d.\n"

    85

			"Probable cause: Wrong/missing NewGRFs",

    86

			id

    87

		);

    88

	}

    89

    90

	FioSeekToFile(_sprite_file_pos[id]);

    91

    92

	num  = FioReadWord();

    93

	type = FioReadByte();

    94

	if (type == 0xFF) {

    95

		byte* dest = AllocSprite(num);

    96

    97

		_sprite_ptr[id] = dest;

    98

		FioReadBlock(dest, num);

    99

   100

		return dest;

   101

	} else {

   102

		uint height = FioReadByte();

   103

		uint width  = FioReadWord();

   104

		Sprite* sprite;

   105

		byte* dest;

   106

   107

		num = (type & 0x02) ? width * height : num - 8;

   108

		sprite = AllocSprite(sizeof(*sprite) + num);

   109

		_sprite_ptr[id] = sprite;

   110

		sprite->info   = type;

   111

		sprite->height = (id != 142) ? height : 10; // Compensate for a TTD bug

   112

		sprite->width  = width;

   113

		sprite->x_offs = FioReadWord();

   114

		sprite->y_offs = FioReadWord();

   115

   116

		dest = sprite->data;

   117

		while (num > 0) {

   118

			int8 i = FioReadByte();

   119

   120

			if (i >= 0) {

   121

				num -= i;

   122

				for (; i > 0; --i) *dest++ = FioReadByte();

   123

			} else {

   124

				const byte* rel = dest - (((i & 7) << 8) | FioReadByte());

   125

   126

				i = -(i >> 3);

   127

				num -= i;

   128

   129

				for (; i > 0; --i) *dest++ = *rel++;

   130

			}

   131

		}

   132

   133

		return sprite;

   134

	}

   135

}

   136

   137

   138

bool LoadNextSprite(int load_index, byte file_index)

   139

{

   140

	uint32 file_pos = FioGetPos() | (file_index << 24);

   141

   142

	if (!ReadSpriteHeaderSkipData()) return false;

   143

   144

	_sprite_file_pos[load_index] = file_pos;

   145

   146

	_sprite_ptr[load_index] = NULL;

   147

   148

#if defined(WANT_NEW_LRU)

   149

	_sprite_lru_new[load_index] = 0;

   150

#else

   151

	_sprite_lru[load_index] = 0xFFFF;

   152

	_sprite_lru_cur[load_index] = 0;

   153

#endif

   154

   155

	return true;

   156

}

   157

   158

   159

void DupSprite(SpriteID old, SpriteID new)

   160

{

   161

	_sprite_file_pos[new] = _sprite_file_pos[old];

   162

	_sprite_ptr[new] = NULL;

   163

}

   164

   165

   166

void SkipSprites(uint count)

   167

{

   168

	for (; count > 0; --count) {

   169

		if (!ReadSpriteHeaderSkipData()) return;

   170

	}

   171

}

   172

   173

   174

#define S_FREE_MASK 1

   175

   176

static inline MemBlock* NextBlock(MemBlock* block)

   177

{

   178

	return (MemBlock*)((byte*)block + (block->size & ~S_FREE_MASK));

   179

}

   180

   181

static uint32 GetSpriteCacheUsage(void)

   182

{

   183

	size_t tot_size = 0;

   184

	MemBlock* s;

   185

   186

	for (s = _spritecache_ptr; s->size != 0; s = NextBlock(s))

   187

		if (!(s->size & S_FREE_MASK)) tot_size += s->size;

   188

   189

	return tot_size;

   190

}

   191

   192

   193

void IncreaseSpriteLRU(void)

   194

{

   195

	int i;

   196

   197

	// Increase all LRU values

   198

#if defined(WANT_NEW_LRU)

   199

	if (_sprite_lru_counter > 16384) {

   200

		DEBUG(spritecache, 2) ("fixing lru %d, inuse=%d", _sprite_lru_counter, GetSpriteCacheUsage());

   201

   202

		for (i = 0; i != MAX_SPRITES; i++)

   203

			if (_sprite_ptr[i] != NULL) {

   204

				if (_sprite_lru_new[i] >= 0) {

   205

					_sprite_lru_new[i] = -1;

   206

				} else if (_sprite_lru_new[i] != -32768) {

   207

					_sprite_lru_new[i]--;

   208

				}

   209

			}

   210

		_sprite_lru_counter = 0;

   211

	}

   212

#else

   213

	for (i = 0; i != MAX_SPRITES; i++)

   214

		if (_sprite_ptr[i] != NULL && _sprite_lru[i] != 65535)

   215

			_sprite_lru[i]++;

   216

	// Reset the lru counter.

   217

	_sprite_lru_counter = 0;

   218

#endif

   219

   220

	// Compact sprite cache every now and then.

   221

	if (++_compact_cache_counter >= 740) {

   222

		CompactSpriteCache();

   223

		_compact_cache_counter = 0;

   224

	}

   225

}

   226

   227

// Called when holes in the sprite cache should be removed.

   228

// That is accomplished by moving the cached data.

   229

static void CompactSpriteCache(void)

   230

{

   231

	MemBlock *s;

   232

   233

	DEBUG(spritecache, 2) (

   234

		"compacting sprite cache, inuse=%d", GetSpriteCacheUsage()

   235

	);

   236

   237

	for (s = _spritecache_ptr; s->size != 0;) {

   238

		if (s->size & S_FREE_MASK) {

   239

			MemBlock* next = NextBlock(s);

   240

			MemBlock temp;

   241

			void** i;

   242

   243

			// Since free blocks are automatically coalesced, this should hold true.

   244

			assert(!(next->size & S_FREE_MASK));

   245

   246

			// If the next block is the sentinel block, we can safely return

   247

			if (next->size == 0)

   248

				break;

   249

   250

			// Locate the sprite belonging to the next pointer.

   251

			for (i = _sprite_ptr; *i != next->data; ++i) {

   252

				assert(i != endof(_sprite_ptr));

   253

			}

   254

   255

			*i = s->data; // Adjust sprite array entry

   256

			// Swap this and the next block

   257

			temp = *s;

   258

			memmove(s, next, next->size);

   259

			s = NextBlock(s);

   260

			*s = temp;

   261

   262

			// Coalesce free blocks

   263

			while (NextBlock(s)->size & S_FREE_MASK) {

   264

				s->size += NextBlock(s)->size & ~S_FREE_MASK;

   265

			}

   266

		} else {

   267

			s = NextBlock(s);

   268

		}

   269

	}

   270

}

   271

   272

static void DeleteEntryFromSpriteCache(void)

   273

{

   274

	int i;

   275

	int best = -1;

   276

	MemBlock* s;

   277

	int cur_lru;

   278

   279

	DEBUG(spritecache, 2) ("DeleteEntryFromSpriteCache, inuse=%d", GetSpriteCacheUsage());

   280

   281

#if defined(WANT_NEW_LRU)

   282

	cur_lru = 0xffff;

   283

	for (i = 0; i != MAX_SPRITES; i++) {

   284

		if (_sprite_ptr[i] != NULL && _sprite_lru_new[i] < cur_lru) {

   285

			cur_lru = _sprite_lru_new[i];

   286

			best = i;

   287

		}

   288

	}

   289

#else

   290

	{

   291

	uint16 cur_lru = 0, cur_lru_cur = 0xffff;

   292

	for (i = 0; i != MAX_SPRITES; i++) {

   293

		if (_sprite_ptr[i] == NULL || _sprite_lru[i] < cur_lru) continue;

   294

   295

		// Found a sprite with a higher LRU value, then remember it.

   296

		if (_sprite_lru[i] != cur_lru) {

   297

			cur_lru = _sprite_lru[i];

   298

			best = i;

   299

   300

		// Else if both sprites were very recently referenced, compare by the cur value instead.

   301

		} else if (cur_lru == 0 && _sprite_lru_cur[i] <= cur_lru_cur) {

   302

			cur_lru_cur = _sprite_lru_cur[i];

   303

			cur_lru = _sprite_lru[i];

   304

			best = i;

   305

		}

   306

	}

   307

	}

   308

#endif

   309

   310

	// Display an error message and die, in case we found no sprite at all.

   311

	// This shouldn't really happen, unless all sprites are locked.

   312

	if (best == -1)

   313

		error("Out of sprite memory");

   314

   315

	// Mark the block as free (the block must be in use)

   316

	s = (MemBlock*)_sprite_ptr[best] - 1;

   317

	assert(!(s->size & S_FREE_MASK));

   318

	s->size |= S_FREE_MASK;

   319

	_sprite_ptr[best] = NULL;

   320

   321

	// And coalesce adjacent free blocks

   322

	for (s = _spritecache_ptr; s->size != 0; s = NextBlock(s)) {

   323

		if (s->size & S_FREE_MASK) {

   324

			while (NextBlock(s)->size & S_FREE_MASK) {

   325

				s->size += NextBlock(s)->size & ~S_FREE_MASK;

   326

			}

   327

		}

   328

	}

   329

}

   330

   331

static void* AllocSprite(size_t mem_req)

   332

{

   333

	mem_req += sizeof(MemBlock);

   334

   335

	/* Align this to an uint32 boundary. This also makes sure that the 2 least

   336

	 * bits are not used, so we could use those for other things. */

   337

	mem_req = (mem_req + sizeof(uint32) - 1) & ~(sizeof(uint32) - 1);

   338

   339

	for (;;) {

   340

		MemBlock* s;

   341

   342

		for (s = _spritecache_ptr; s->size != 0; s = NextBlock(s)) {

   343

			if (s->size & S_FREE_MASK) {

   344

				size_t cur_size = s->size & ~S_FREE_MASK;

   345

   346

				/* Is the block exactly the size we need or

   347

				 * big enough for an additional free block? */

   348

				if (cur_size == mem_req ||

   349

						cur_size >= mem_req + sizeof(MemBlock)) {

   350

					// Set size and in use

   351

					s->size = mem_req;

   352

   353

					// Do we need to inject a free block too?

   354

					if (cur_size != mem_req) {

   355

						NextBlock(s)->size = (cur_size - mem_req) | S_FREE_MASK;

   356

					}

   357

   358

					return s->data;

   359

				}

   360

			}

   361

		}

   362

   363

		// Reached sentinel, but no block found yet. Delete some old entry.

   364

		DeleteEntryFromSpriteCache();

   365

	}

   366

}

   367

   368

#if defined(NEW_ROTATION)

   369

#define X15(x) else if (s >= x && s < (x+15)) { s = _rotate_tile_sprite[s - x] + x; }

   370

#define X19(x) else if (s >= x && s < (x+19)) { s = _rotate_tile_sprite[s - x] + x; }

   371

#define MAP(from,to,map) else if (s >= from && s <= to) { s = map[s - from] + from; }

   372

   373

   374

static uint RotateSprite(uint s)

   375

{

   376

	static const byte _rotate_tile_sprite[19] = { 0,2,4,6,8,10,12,14,1,3,5,7,9,11,13,17,18,16,15 };

   377

	static const byte _coast_map[9] = {0, 4, 3, 1, 2, 6, 8, 5, 7};

   378

	static const byte _fence_map[6] = {1, 0, 5, 4, 3, 2};

   379

   380

	if (0);

   381

	X19(752)

   382

	X15(990-1)

   383

	X19(3924)

   384

	X19(3943)

   385

	X19(3962)

   386

	X19(3981)

   387

	X19(4000)

   388

	X19(4023)

   389

	X19(4042)

   390

	MAP(4061,4069,_coast_map)

   391

	X19(4126)

   392

	X19(4145)

   393

	X19(4164)

   394

	X19(4183)

   395

	X19(4202)

   396

	X19(4221)

   397

	X19(4240)

   398

	X19(4259)

   399

	X19(4259)

   400

	X19(4278)

   401

	MAP(4090, 4095, _fence_map)

   402

	MAP(4096, 4101, _fence_map)

   403

	MAP(4102, 4107, _fence_map)

   404

	MAP(4108, 4113, _fence_map)

   405

	MAP(4114, 4119, _fence_map)

   406

	MAP(4120, 4125, _fence_map)

   407

	return s;

   408

}

   409

#endif

   410

   411

const void *GetRawSprite(SpriteID sprite)

   412

{

   413

	void* p;

   414

   415

	assert(sprite < MAX_SPRITES);

   416

   417

#if defined(NEW_ROTATION)

   418

	sprite = RotateSprite(sprite);

   419

#endif

   420

   421

	// Update LRU

   422

#if defined(WANT_NEW_LRU)

   423

	_sprite_lru_new[sprite] = ++_sprite_lru_counter;

   424

#else

   425

	_sprite_lru_cur[sprite] = ++_sprite_lru_counter;

   426

	_sprite_lru[sprite] = 0;

   427

#endif

   428

   429

	p = _sprite_ptr[sprite];

   430

	// Load the sprite, if it is not loaded, yet

   431

	if (p == NULL) p = ReadSprite(sprite);

   432

	return p;

   433

}

   434

   435

   436

void GfxInitSpriteMem(void)

   437

{

   438

	// initialize sprite cache heap

   439

	if (_spritecache_ptr == NULL) _spritecache_ptr = malloc(SPRITE_CACHE_SIZE);

   440

   441

	// A big free block

   442

	_spritecache_ptr->size = (SPRITE_CACHE_SIZE - sizeof(MemBlock)) | S_FREE_MASK;

   443

	// Sentinel block (identified by size == 0)

   444

	NextBlock(_spritecache_ptr)->size = 0;

   445

   446

	memset(_sprite_ptr, 0, sizeof(_sprite_ptr));

   447

   448

	_compact_cache_counter = 0;

   449

}