mirror of
https://foundry.openuru.org/gitblit/r/CWE-ou-minkata.git
synced 2025-07-14 14:37:41 +00:00
Compare commits
75 Commits
OPENURU_BU
...
OPENURU_BU
Author | SHA1 | Date | |
---|---|---|---|
4b0ab75a79 | |||
dcb0309a08 | |||
7dde0855dc | |||
44c9b0694d | |||
dedf04ac43 | |||
eeb458817f | |||
68c7187155 | |||
6fa695a2c3 | |||
2a3c1b32ef | |||
d3cbaa94ef | |||
e7758ccc10 | |||
07b92234ad | |||
7dfa2ba56a | |||
1a091b7019 | |||
104a5ef4ee | |||
19cfaaaea9 | |||
dafd190083 | |||
fdee5a921b | |||
b322ee094c | |||
54c768d966 | |||
82159bcb4a | |||
b81eb21145 | |||
e7b4f5c6ba | |||
202e846a56 | |||
deb4858f3e | |||
bff879abfd | |||
fededb574b | |||
126e7a76dd | |||
26807a8d87 | |||
f54f14328e | |||
311671e7a2 | |||
8aaa98b8b7 | |||
3489e04463 | |||
33bbc490be | |||
fd0c2a205e | |||
1f7de46bc2 | |||
b16de9d86f | |||
bbeb25d29a | |||
f0d2bd3eaa | |||
41627d1c7c | |||
c0e83259f3 | |||
6e4996e1be | |||
df848b48c4 | |||
75c570877a | |||
3b17e20fb9 | |||
25ea208084 | |||
a392a37fcd | |||
7c64654e1f | |||
a82188cbf4 | |||
f90ab01d44 | |||
afed53f920 | |||
b0511ea068 | |||
dfc89b363c | |||
9ab07771df | |||
fd260827aa | |||
da5ba1062b | |||
8291326614 | |||
90e67f6206 | |||
a974c9f1b2 | |||
f05d71a214 | |||
a317ae4b08 | |||
916bf4f87f | |||
2160831221 | |||
e8e9cd29ee | |||
c9fddca6d5 | |||
3f8eaf6a9a | |||
0ce35e84b2 | |||
31156794ad | |||
fc79b5f45a | |||
542711c7c0 | |||
b9f8e3d1bd | |||
224ad908cc | |||
ed516b6508 | |||
4329212d98 | |||
8ff71fb384 |
@ -165,6 +165,8 @@ class pfKIMsg : public plMessage
|
||||
kUNUSED1 = 0x00000008,
|
||||
kStatusMsg = 0x00000010,
|
||||
kNeighborMsg = 0x00000020, // sending to all the neighbors
|
||||
kSubtitleMsg = 0x00000040,
|
||||
kLocKeyMsg = 0x00000080,
|
||||
kChannelMask = 0x0000ff00
|
||||
};
|
||||
|
||||
|
@ -777,4 +777,4 @@ void cyMisc::AddPlasmaMethods3(std::vector<PyMethodDef> &methods)
|
||||
|
||||
PYTHON_GLOBAL_METHOD_NOARGS(methods, PtGetUserPath);
|
||||
PYTHON_GLOBAL_METHOD_NOARGS(methods, PtGetInitPath);
|
||||
}
|
||||
}
|
||||
|
@ -853,4 +853,4 @@ void cyMisc::AddPlasmaMethods4(std::vector<PyMethodDef> &methods)
|
||||
PYTHON_GLOBAL_METHOD(methods, PtGetAIAvatarsByModelName);
|
||||
PYTHON_GLOBAL_METHOD(methods, PtForceVaultNodeUpdate);
|
||||
PYTHON_GLOBAL_METHOD(methods, PtVaultDownload);
|
||||
}
|
||||
}
|
||||
|
@ -474,6 +474,12 @@ void plPythonSDLModifier::IPythonVarToSDL(plStateDataRecord* state, const char*
|
||||
int count = PyTuple_Size(pyVar);
|
||||
plSimpleVarDescriptor::Type type = var->GetSimpleVarDescriptor()->GetType();
|
||||
|
||||
// Ensure that variable length arrays match.
|
||||
if (var->GetSimpleVarDescriptor()->IsVariableLength()) {
|
||||
if (var->GetCount() != count)
|
||||
var->Alloc(count);
|
||||
}
|
||||
|
||||
for (int i = 0; i < count; i++)
|
||||
{
|
||||
PyObject* pyVarItem = PyTuple_GetItem(pyVar, i);
|
||||
|
@ -326,7 +326,7 @@ bool plAvBrainClimb::IProcessExitStage(double time, float elapsed)
|
||||
|
||||
float curBlend = ai->GetBlend();
|
||||
|
||||
if(curBlend > .99) // reached peak strength
|
||||
if(fCurStage && curBlend > .99) // reached peak strength
|
||||
{
|
||||
fCurStage->Detach(fAvMod); // remove the (now completely masked) underlying anim
|
||||
fCurStage = nil;
|
||||
|
@ -481,8 +481,8 @@ void plMouseDevice::SetCursorY(hsScalar y)
|
||||
|
||||
void plMouseDevice::HideCursor(hsBool override)
|
||||
{
|
||||
if( fInstance->fCursor != nil )
|
||||
fInstance->fCursor->SetVisible( false );
|
||||
if (fInstance && fInstance->fCursor)
|
||||
fInstance->fCursor->SetVisible(false);
|
||||
|
||||
plMouseDevice::bCursorOverride = (override != 0);
|
||||
plMouseDevice::bCursorHidden = true;
|
||||
@ -499,9 +499,11 @@ void plMouseDevice::ShowCursor(hsBool override)
|
||||
plMouseDevice::bCursorHidden = false;
|
||||
plMouseDevice::bCursorOverride = false;
|
||||
|
||||
if( fInstance->fCursor == nil )
|
||||
fInstance->CreateCursor( fInstance->fCursorID );
|
||||
fInstance->fCursor->SetVisible( true );
|
||||
if (fInstance) {
|
||||
if (!fInstance->fCursor)
|
||||
fInstance->CreateCursor(fInstance->fCursorID);
|
||||
fInstance->fCursor->SetVisible(true);
|
||||
}
|
||||
}
|
||||
|
||||
void plMouseDevice::NewCursor(char* cursor)
|
||||
|
@ -1328,9 +1328,9 @@ void plPXPhysical::GetSyncState(hsPoint3& pos, hsQuat& rot, hsVector3& linV, hsV
|
||||
|
||||
void plPXPhysical::SetSyncState(hsPoint3* pos, hsQuat* rot, hsVector3* linV, hsVector3* angV)
|
||||
{
|
||||
bool initialSync = plNetClientApp::GetInstance()->IsLoadingInitialAgeState() &&
|
||||
plNetClientApp::GetInstance()->GetJoinOrder() == 0;
|
||||
|
||||
bool isLoading = plNetClientApp::GetInstance()->IsLoadingInitialAgeState();
|
||||
bool isFirstIn = plNetClientApp::GetInstance()->GetJoinOrder() == 0;
|
||||
bool initialSync = isLoading && isFirstIn;
|
||||
// If the physical has fallen out of the sim, and this is initial age state, and we're
|
||||
// the first person in, reset it to the original position. (ie, prop the default state
|
||||
// we've got right now)
|
||||
@ -1350,6 +1350,13 @@ void plPXPhysical::SetSyncState(hsPoint3* pos, hsQuat* rot, hsVector3* linV, hsV
|
||||
SetLinearVelocitySim(*linV);
|
||||
if (angV)
|
||||
SetAngularVelocitySim(*angV);
|
||||
// If we're loading the age, then we should ensure the objects stay asleep if they're supposed to be asleep.
|
||||
// NOTE: We should only do this if the objects are not at their initial locations. Otherwise, they might
|
||||
// sleep inside each other and explode or float randomly in midair
|
||||
if (isLoading && GetProperty(plSimulationInterface::kStartInactive) && !fActor->readBodyFlag(NX_BF_KINEMATIC)) {
|
||||
if (!pos && !rot)
|
||||
fActor->putToSleep();
|
||||
}
|
||||
|
||||
SendNewLocation(false, true);
|
||||
}
|
||||
|
@ -1299,7 +1299,7 @@ void plResManager::PageInAge(const char *age)
|
||||
|
||||
hsBool plResManager::VerifyPages()
|
||||
{
|
||||
hsTArray<plRegistryPageNode*> invalidPages, newerPages;
|
||||
PageSet invalidPages, newerPages;
|
||||
|
||||
// Step 1: verify major/minor version changes
|
||||
if (plResMgrSettings::Get().GetFilterNewerPageVersions() ||
|
||||
@ -1313,7 +1313,7 @@ hsBool plResManager::VerifyPages()
|
||||
|
||||
if (page->GetPageCondition() == kPageTooNew && plResMgrSettings::Get().GetFilterNewerPageVersions())
|
||||
{
|
||||
newerPages.Append(page);
|
||||
newerPages.insert(page);
|
||||
fAllPages.erase(page);
|
||||
}
|
||||
else if (
|
||||
@ -1321,21 +1321,21 @@ hsBool plResManager::VerifyPages()
|
||||
page->GetPageCondition() == kPageOutOfDate)
|
||||
&& plResMgrSettings::Get().GetFilterOlderPageVersions())
|
||||
{
|
||||
invalidPages.Append(page);
|
||||
invalidPages.insert(page);
|
||||
fAllPages.erase(page);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Handle all our invalid pages now
|
||||
if (invalidPages.GetCount() > 0)
|
||||
if (!invalidPages.empty())
|
||||
{
|
||||
if (!IDeleteBadPages(invalidPages, false))
|
||||
return false;
|
||||
}
|
||||
|
||||
// Warn about newer pages
|
||||
if (newerPages.GetCount() > 0)
|
||||
if (!newerPages.empty())
|
||||
{
|
||||
if (!IWarnNewerPages(newerPages))
|
||||
return false;
|
||||
@ -1343,22 +1343,35 @@ hsBool plResManager::VerifyPages()
|
||||
|
||||
// Step 2 of verification: make sure no sequence numbers conflict
|
||||
PageSet::iterator it = fAllPages.begin();
|
||||
for (; it != fAllPages.end(); it++)
|
||||
for (; it != fAllPages.end();)
|
||||
{
|
||||
plRegistryPageNode* page = *it;
|
||||
|
||||
PageSet::iterator itUp = it;
|
||||
itUp++;
|
||||
for (; itUp != fAllPages.end(); itUp++)
|
||||
bool amValid = true;
|
||||
for (; itUp != fAllPages.end();)
|
||||
{
|
||||
plRegistryPageNode* upPage = *itUp;
|
||||
if (page->GetPageInfo().GetLocation() == upPage->GetPageInfo().GetLocation())
|
||||
{
|
||||
invalidPages.Append(upPage);
|
||||
fAllPages.erase(itUp);
|
||||
break;
|
||||
if (page->GetPageInfo().GetLocation() == upPage->GetPageInfo().GetLocation()) {
|
||||
invalidPages.insert(upPage);
|
||||
itUp = fAllPages.erase(itUp);
|
||||
amValid = false;
|
||||
} else {
|
||||
itUp++;
|
||||
}
|
||||
}
|
||||
|
||||
// Delete *all* conflicting pages, not just conflicting - 1.
|
||||
// If we leave in a single conflicting page, a new conflict can trivially
|
||||
// be introduced if the page we leave behind is defunct and a new version
|
||||
// is later downloaded from the FileSrv.
|
||||
if (!amValid) {
|
||||
invalidPages.insert(page);
|
||||
it = fAllPages.erase(it);
|
||||
} else {
|
||||
it++;
|
||||
}
|
||||
}
|
||||
|
||||
// Redo our loaded pages list, since Verify() might force the page's keys to load or unload
|
||||
@ -1374,7 +1387,7 @@ hsBool plResManager::VerifyPages()
|
||||
}
|
||||
|
||||
// Handle all our conflicting pages now
|
||||
if (invalidPages.GetCount() > 0)
|
||||
if (!invalidPages.empty())
|
||||
return IDeleteBadPages(invalidPages, true);
|
||||
|
||||
return true;
|
||||
@ -1384,9 +1397,10 @@ hsBool plResManager::VerifyPages()
|
||||
// Given an array of pages that are invalid (major version out-of-date or
|
||||
// whatnot), asks the user what we should do about them.
|
||||
|
||||
static void ICatPageNames(hsTArray<plRegistryPageNode*>& pages, char* buf, int bufSize)
|
||||
static void ICatPageNames(const std::set<plRegistryPageNode*>& pages, char* buf, int bufSize)
|
||||
{
|
||||
for (int i = 0; i < pages.GetCount(); i++)
|
||||
int i = 0;
|
||||
for (auto it = pages.cbegin(); it != pages.cend(); ++it, ++i)
|
||||
{
|
||||
if (i >= 25)
|
||||
{
|
||||
@ -1394,7 +1408,7 @@ static void ICatPageNames(hsTArray<plRegistryPageNode*>& pages, char* buf, int b
|
||||
break;
|
||||
}
|
||||
|
||||
const char* pagePath = pages[i]->GetPagePath();
|
||||
const char* pagePath = (*it)->GetPagePath();
|
||||
const char* pageFile = plFileUtils::GetFileName(pagePath);
|
||||
|
||||
if (strlen(buf) + strlen(pageFile) > bufSize - 5)
|
||||
@ -1408,7 +1422,7 @@ static void ICatPageNames(hsTArray<plRegistryPageNode*>& pages, char* buf, int b
|
||||
}
|
||||
}
|
||||
|
||||
hsBool plResManager::IDeleteBadPages(hsTArray<plRegistryPageNode*>& invalidPages, hsBool conflictingSeqNums)
|
||||
hsBool plResManager::IDeleteBadPages(PageSet& invalidPages, hsBool conflictingSeqNums)
|
||||
{
|
||||
#ifndef PLASMA_EXTERNAL_RELEASE
|
||||
if (!hsMessageBox_SuppressPrompts)
|
||||
@ -1430,12 +1444,12 @@ hsBool plResManager::IDeleteBadPages(hsTArray<plRegistryPageNode*>& invalidPages
|
||||
#endif // PLASMA_EXTERNAL_RELEASE
|
||||
|
||||
// Delete 'em
|
||||
for (int i = 0; i < invalidPages.GetCount(); i++)
|
||||
for (PageSet::iterator it = invalidPages.begin(); it != invalidPages.end(); ++it)
|
||||
{
|
||||
invalidPages[i]->DeleteSource();
|
||||
delete invalidPages[i];
|
||||
(*it)->DeleteSource();
|
||||
delete *it;
|
||||
}
|
||||
invalidPages.Reset();
|
||||
invalidPages.clear();
|
||||
|
||||
fLastFoundPage = nil;
|
||||
|
||||
@ -1447,7 +1461,7 @@ hsBool plResManager::IDeleteBadPages(hsTArray<plRegistryPageNode*>& invalidPages
|
||||
// than the "current" one), warns the user about them but does nothing to
|
||||
// them.
|
||||
|
||||
hsBool plResManager::IWarnNewerPages(hsTArray<plRegistryPageNode*> &newerPages)
|
||||
hsBool plResManager::IWarnNewerPages(PageSet &newerPages)
|
||||
{
|
||||
#ifndef PLASMA_EXTERNAL_RELEASE
|
||||
if (!hsMessageBox_SuppressPrompts)
|
||||
@ -1465,9 +1479,9 @@ hsBool plResManager::IWarnNewerPages(hsTArray<plRegistryPageNode*> &newerPages)
|
||||
|
||||
|
||||
// Not deleting the files, just delete them from memory
|
||||
for (int i = 0; i < newerPages.GetCount(); i++)
|
||||
delete newerPages[i];
|
||||
newerPages.Reset();
|
||||
for (PageSet::iterator it = newerPages.begin(); it != newerPages.end(); ++it)
|
||||
delete *it;
|
||||
newerPages.clear();
|
||||
|
||||
fLastFoundPage = nil;
|
||||
|
||||
|
@ -61,6 +61,9 @@ typedef void(*plProgressProc)(plKey key);
|
||||
|
||||
class plResManager : public hsResMgr
|
||||
{
|
||||
protected:
|
||||
typedef std::set<plRegistryPageNode*> PageSet;
|
||||
|
||||
public:
|
||||
plResManager();
|
||||
virtual ~plResManager();
|
||||
@ -194,8 +197,8 @@ protected:
|
||||
|
||||
void IUnloadPageKeys(plRegistryPageNode* pageNode, hsBool dontClear = false);
|
||||
|
||||
hsBool IDeleteBadPages(hsTArray<plRegistryPageNode*>& invalidPages, hsBool conflictingSeqNums);
|
||||
hsBool IWarnNewerPages(hsTArray<plRegistryPageNode*>& newerPages);
|
||||
hsBool IDeleteBadPages(PageSet& invalidPages, hsBool conflictingSeqNums);
|
||||
hsBool IWarnNewerPages(PageSet& newerPages);
|
||||
|
||||
void ILockPages();
|
||||
void IUnlockPages();
|
||||
@ -233,7 +236,6 @@ protected:
|
||||
UInt8 fPageListLock; // Number of locks on the page lists. If it's greater than zero, they can't be modified
|
||||
hsBool fPagesNeedCleanup; // True if something modified the page lists while they were locked.
|
||||
|
||||
typedef std::set<plRegistryPageNode*> PageSet;
|
||||
PageSet fAllPages; // All the pages, loaded or not
|
||||
PageSet fLoadedPages; // Just the loaded pages
|
||||
|
||||
|
Reference in New Issue
Block a user