1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
#pragma once
#include "xmcore.h"
// 4J added - Storage for data (ie the extra per tile storage). Data is normally stored as 4-bits per tile, in a DataLayer class of 16384 bytes ( 128 x 16 x 16 x 0.5 )
// This class provides more economical storage for such data by taking into consideration that it is quite common for large parts of the data to be very compressible (ie zero).
// We are aiming here to balance performance (this data is accessed very frequently) against size.
// Details of storage method:
// 1. Data is split into horizontal planes, of which there are 128, and each taking up 128 bytes (16 x 16 x 0.5)
// 2. Each of these layers has a permanently allocated index in this class (planeIndices).
// 3. Data for allocatedPlaneCount planes worth of data is allocated in the data array ( allocatedPlaneCount * 128 bytes )
// 4. If a plane index for a layer is < 128, then the data for that layer is at data[ index * 128 ]
// 5. If a plane index for a layer is 128, then all values for that plane are 0
// This class needs to be thread safe as there are times where chunk data is shared between server & main threads. Data values are queried
// very regularly so this needs to be as light-weight as possible.
// To meet these requirements, this class is now implemented using a lock-free system, implemented using a read-copy-update (RCU) type algorithm. Some details...
// (1) The storage details for the class are now packed into a single int64_t, which contains both a pointer to the data that is required and a count of how many planes worth
// of storage are allocated. This allows the full storage to be updated atomically using compare and exchange operations (implemented with InterlockedCompareExchangeRelease64).
// (2) The data pointer referenced in this int64_t points to an area of memory which is 128 + 128 * plane_count bytes long, where the first 128 bytes stoere the plane indices, and
// the rest of the data is variable in size to accomodate however many planes are required to be stored
// (3) The RCU bit of the algorithm means that any read operations don't need to do any checks or locks at all. When the data needs to be updated, a copy of it is made and updated,
// then an attempt is made to swap the new data in - if this succeeds then the old data pointer is deleted later at some point where we know nothing will be reading from it anymore.
// This is achieved by putting the delete request in a queue which means it won't actually get deleted until 2 game ticks after the last time its reference existed, which should give
// us a large margin of safety. If the attempt to swap the new data in fails, then the whole write operation has to be attempted again - this is the only time there is really a
// high cost for this algorithm and such write collisions should be rare.
//#define DATA_COMPRESSION_STATS
class TileCompressData_SPU;
class SparseDataStorage
{
friend class TileCompressData_SPU;
private:
// unsigned char planeIndices[128];
int64_t dataAndCount; // Contains packed-together data pointer (lower 48-bits), and count of lines used (upper 16-bits)
// unsigned char *data;
// unsigned int allocatedPlaneCount;
static const int ALL_0_INDEX = 128;
#ifdef _XBOX
static const unsigned int MM_PHYSICAL_4KB_BASE = 0xE0000000; // Start of where 4KB page sized physical allocations are made
#endif
public:
SparseDataStorage();
SparseDataStorage(bool isUpper);
SparseDataStorage(SparseDataStorage *copyFrom); // ctor with deep copy
~SparseDataStorage();
void setData(byteArray dataIn, unsigned int inOffset); // Set all data values from a data array of length 16384 (128 x 16 x 16 x 0.5).
void getData(byteArray retArray, unsigned int retOffset); // Gets all data values into an array of length 16384.
int get(int x, int y, int z); // Get an individual data value
void set(int x, int y, int z, int val); // Set an individual data value
typedef void (*tileUpdatedCallback)(int x, int y , int z, void *param, int yparam);
int setDataRegion(byteArray dataIn, int x0, int y0, int z0, int x1, int y1, int z1, int offset, tileUpdatedCallback callback, void *param, int yparam); // Sets a region of data values with the data at offset position in the array dataIn - external ordering compatible with java DataLayer
int getDataRegion(byteArray dataInOut, int x0, int y0, int z0, int x1, int y1, int z1, int offset); // Updates the data at offset position dataInOut with a region of data information - external ordering compatible with java DataLayer
static void staticCtor();
void addNewPlane(int y);
void getPlaneIndicesAndData(unsigned char **planeIndices, unsigned char **data);
void updateDataAndCount(int64_t newDataAndCount);
int compress();
bool isCompressed();
void queueForDelete(unsigned char *data);
static void tick();
static int deleteQueueIndex;
static XLockFreeStack <unsigned char> deleteQueue[3];
#ifdef DATA_COMPRESSION_STATS
int count;
#endif
void write(DataOutputStream *dos);
void read(DataInputStream *dis);
};
|
