int SharedDataManager::setData(TreeDescriptor treeId, int nid, char dataType, int numSamples, char *data, int size) //Write data indexed by nid
{
lock.lock();
SharedMemNode *node = sharedTree.find(treeId, nid);
if(!node)
//No data has been written in the cache yet
{
SharedMemNodeData nodeData;
nodeData.setNid(treeId, nid);
sharedTree.insert(&nodeData);
node = sharedTree.find(treeId, nid);
}
if(node)
{
SharedMemNodeData *nodeData = node->getData() ;
nodeData->free(&allocationManager);
char *currData = allocationManager.allocateShared(size);
memcpy(currData, data, size);
nodeData->setData((char *)currData, size);
nodeData->setDataInfo(dataType, numSamples);
CallbackManager *callback = node->getData()->getCallbackManager();
if(callback)
callback->callCallback();
lock.unlock();
return 1;
}
else
{
lock.unlock();
return 0;
}
}
static THREAD_RETURN
work_callback(THREAD_ARGUMENT data)
{
void **cbData = (void **)data;
CallbackManager *obj = (CallbackManager *)cbData[0];
delete [] cbData;
obj->Work();
return NULL;
}
int SharedDataManager::clearCallback(TreeDescriptor treeId, int nid, char *callbackDescr)
{
int status = 0;
CallbackManager *callbackManager = (CallbackManager *)callbackDescr;
callbackManager->dispose();
lock.lock();
SharedMemNode *retNode = sharedTree.find(treeId, nid);
//Remove the CallbackManager instance from the queue associated with the nid node
if(retNode)
{
CallbackManager *callbackManagerHead = retNode->getData()->getCallbackManager();
if(callbackManagerHead == callbackManager)
retNode->getData()->setCallbackManager(callbackManager->getNext());
else
{
CallbackManager *next = callbackManager->getNext();
CallbackManager *prev = callbackManager->getPrev();
if(prev)
prev->setNext((char *)next);
if(next)
next->setPrev((char *)prev);
}
allocationManager.deallocateShared((char *)callbackManager, sizeof(CallbackManager));
status = 1;
}
lock.unlock();
return status;
}
void SharedDataManager::setSerializedData(TreeDescriptor treeId, int nid, char *serializedData, int dataLen)
{
lock.lock();
SharedMemNode *node = sharedTree.find(treeId, nid);
if(!node)
//No data has been written in the cache yet
{
SharedMemNodeData nodeData;
nodeData.setNid(treeId, nid);
sharedTree.insert(&nodeData);
node = sharedTree.find(treeId, nid);
}
if(node)
{
SharedMemNodeData *nodeData = node->getData();
nodeData->free(&allocationManager);
nodeData->initialize(serializedData, &allocationManager);
CallbackManager *callback = node->getData()->getCallbackManager();
if(callback)
callback->callCallback();
}
lock.unlock();
}
void *SharedDataManager::setCallback(TreeDescriptor treeId, int nid, void *argument, void (*callback)(int, void *))
{
char *retPtr = NULL;
int status = 0;
lock.lock();
SharedMemNode *retNode = sharedTree.find(treeId, nid);
if(!retNode)
//No data has been written in the cache yet, or the not is not cacheable,
//then create a nid node without data
{
SharedMemNodeData nodeData;
nodeData.setNid(treeId, nid);
sharedTree.insert(&nodeData, &lock);
retNode = sharedTree.find(treeId, nid);
}
if(retNode)
{
//Create a new Callback manager and concatenate it to the linked list of Callback managers
//associated with this nid node
CallbackManager *callbackManager = (CallbackManager *)freeSpaceManager.allocateShared(sizeof(CallbackManager), &lock);
CallbackManager *prevCallbackManager = retNode->getData()->getCallbackManager();
if(prevCallbackManager)
prevCallbackManager->setPrev((char *)callbackManager);
callbackManager->setNext((char *)retNode->getData()->getCallbackManager());
callbackManager->setPrev(NULL);
retNode->getData()->setCallbackManager(callbackManager);
callbackManager->initialize(nid, argument, callback);
SharedMemNodeData *nodeData = retNode->getData();
nodeData->setWarm(true);
lock.unlock();
return callbackManager;
}
else
{
lock.unlock();
return NULL;
}
}
S_API void STEAM_CALL Steam_RegisterInterfaceFuncs(void *hModule)
{
g_Logging.AddToLogFileA( "steam_emu.log", "SteamAPI_RegisterInterfaceFuncs" );
callbackmanager.SetCallbackProvider((HMODULE)hModule);
}
S_API void STEAM_CALL SteamAPI_RunCallbacks()
{
g_Logging.AddToLogFileA( "steam_emu.log", "SteamAPI_RunCallbacks" );
callbackmanager.RunCallbacks();
}
S_API void STEAM_CALL SteamAPI_UnregisterCallResult( class CCallbackBase *pCallback, SteamAPICall_t hAPICall )
{
g_Logging.AddToLogFileA( "steam_emu.log", "SteamAPI_UnregisterCallResult" );
callbackmanager.UnRegisterAPICallResult(hAPICall, pCallback);
}
S_API void STEAM_CALL SteamAPI_UnregisterCallback( class CCallbackBase *pCallback )
{
g_Logging.AddToLogFileA( "steam_emu.log", "SteamAPI_UnregisterCallback" );
callbackmanager.UnRegisterCallback(pCallback);
}
int SharedDataManager::updateSegment(TreeDescriptor treeId, int nid, int idx, char *start, int startSize, char *end, int endSize,
char *dim, int dimSize)
{
Segment *segment;
lock.lock();
SharedMemNode *node = sharedTree.find(treeId, nid);
if(node)
{
SharedMemNodeData *nodeData = node->getData();
if(!nodeData->isSegmented())
{
lock.unlock();
return 0;
}
int numSegments = nodeData->getNumSegments();
if(idx > numSegments || idx < 0)
{
lock.unlock();
return 0;
}
segment = nodeData->getSegmentAt(idx);
char *currPtr;
int currSize;
segment->getStart(&currPtr, &currSize);
if(startSize > 0)
{
if(currSize > 0)
allocationManager.deallocateShared((char *)currPtr, currSize);
currPtr = allocationManager.allocateShared(startSize);
memcpy(currPtr, start, startSize);
segment->setStart(currPtr, startSize);
}
if(endSize > 0)
{
segment->getEnd(&currPtr, &currSize);
if(currSize > 0)
allocationManager.deallocateShared((char *)currPtr, currSize);
currPtr = allocationManager.allocateShared(endSize);
memcpy(currPtr, end, endSize);
segment->setEnd(currPtr, endSize);
}
if(dimSize > 0)
{
segment->getDim(&currPtr, &currSize);
if(currSize > 0)
allocationManager.deallocateShared((char *)currPtr, currSize);
currPtr = allocationManager.allocateShared(dimSize);
memcpy(currPtr, dim, dimSize);
segment->setDim(currPtr, dimSize);
}
CallbackManager *callback = node->getData()->getCallbackManager();
if(callback)
callback->callCallback();
lock.unlock();
return 1;
}
lock.unlock();
return 0;
}
/*
//Return Shape and type information. The coding is the following:
//1) data type
//2) item size in bytes
//3) number of dimensions
//4) total dimension in bytes
//The remaining elements are the dimension limits
*/
int SharedDataManager::appendSegmentData(TreeDescriptor treeId, int nid, int *bounds, int boundsSize, char *data,
int dataSize, int idx, int startIdx,
bool isTimestamped, _int64 *timestamps, int numTimestamps, int *segmentFilled,
int *retIdx)
{
int numSegments;
int *shape;
int shapeSize;
char *segmentData;
int segmentSize;
lock.lock();
SharedMemNode *node = sharedTree.find(treeId, nid);
if(!node)
{
SharedMemNodeData nodeData;
nodeData.setNid(treeId, nid);
nodeData.setSegmented(true);
sharedTree.insert(&nodeData);
node = sharedTree.find(treeId, nid);
}
if(node)
{
SharedMemNodeData *nodeData = node->getData();
numSegments = nodeData->getNumSegments();
if(numSegments == 0) //May happen the first time putRow is called
{
lock.unlock();
// printf("APPENDSEGMENT DATA: NO SEGMENTS");
return TRUNCATED;
}
if(idx >= numSegments || numSegments == 0)
{
lock.unlock();
// printf("APPENDSEGMENT DATA: BAD INDEX");
return BAD_INDEX;
}
Segment *segment = nodeData->getSegmentAt(idx);
/* if(!segment->isTimestamped())
{
lock.unlock();
return 0;
}
*/
segment->getShape((char **)&shape, &shapeSize);
//Check Shape. Meaning of bound array:
// 1) data type
// 2) item size in bytes
// 3) number of dimensions
// 4) total dimension in bytes
// The remaining elements are the dimension limits
if(bounds[0] != shape[0])
{
lock.unlock();
// printf("APPENDSEGMENT DATA: BAD TYPE %d %d\n", bounds[0], shape[0]);
return BAD_TYPE;
}
if(bounds[2] < shape[2] - 1 || bounds[2] > shape[2])
{
lock.unlock();
// printf("APPENDSEGMENT DATA: BAD TYPE 1");
return BAD_SHAPE;
}
for(int i = 0; i < shape[2] - 1; i++)
{
if(bounds[4 + i] != shape[4 + i])
{
lock.unlock();
// printf("APPENDSEGMENT DATA: BAD SHAPE");
return BAD_SHAPE;
}
}
int currSegmentSize = segment->getCurrDataSize();
segment->getData((char **)&segmentData, &segmentSize);
if(startIdx < 0)
{
int leftSize = segmentSize - currSegmentSize;
if(dataSize > leftSize)
{
lock.unlock();
// printf("APPENDSEGMENT DATA: DATASIZE > LEFT SIZE");
return TRUNCATED;
}
if(leftSize == dataSize)
*segmentFilled = 1;
else
*segmentFilled = 0;
memcpy(&segmentData[currSegmentSize], data, dataSize);
segment->setCurrDataSize(currSegmentSize + dataSize);
if(isTimestamped)
segment->appendTimestamps(timestamps, numTimestamps);
*retIdx = numSegments - 1;
CallbackManager *callback = node->getData()->getCallbackManager();
if(callback)
callback->callCallback();
lock.unlock();
return 1;
}
else
{
int itemSize = bounds[3]; //Total size of a data item (array)
int startOfs = startIdx * itemSize;
int leftSize = segmentSize - startOfs;
if(dataSize > leftSize)
{
lock.unlock();
// printf("APPENDSEGMENT DATA: DATASIZE > LEFT SIZE");
return TRUNCATED;
}
if(leftSize == dataSize)
*segmentFilled = 1;
else
*segmentFilled = 0;
memcpy(&segmentData[startOfs], data, dataSize);
*retIdx = numSegments - 1;
//Segment size does not change
CallbackManager *callback = node->getData()->getCallbackManager();
if(callback)
callback->callCallback();
lock.unlock();
return 1;
}
}
lock.unlock();
return 0;
}
