stephenseo/EntityComponentMetaSystem
1
0
Fork 0
Code Issues Pull requests Actions Projects Releases Wiki Activity

Merge branch 'master' into cxx17

Browse source
This commit is contained in:
Stephen Seo 2021-05-16 20:08:25 +09:00
parent 5f1e6f1b5a f9c40984c7
commit f6dbe5414e
2 changed files with 54 additions and 41 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
LICENSE
View file

@ -1,6 +1,6 @@
The MIT License (MIT)
Copyright (c) 2016-2019 Stephen Seo
Copyright (c) 2016-2019,2021 Stephen Seo
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal

93
src/EC/Manager.hpp
View file

@ -890,7 +890,7 @@ namespace EC
std::vector<std::size_t> matching,
void* context)
{
if(threadCount <= 1)
if(threadCount <= 1 || matching.size() < threadCount)
{
for(auto eid : matching)
{
@ -909,24 +909,21 @@ namespace EC
{
std::size_t begin = s * i;
std::size_t end;
if(i == threadCount - 1)
{
if(i == threadCount - 1) {
end = matching.size();
}
else
{
} else {
end = s * (i + 1);
}
threads[i] = std::thread(
[this, &function, &helper, &context]
[this, &function, &helper, &context, &matching]
(std::size_t begin,
std::size_t end) {
for(std::size_t i = begin; i < end; ++i)
for(std::size_t j = begin; j < end; ++j)
{
if(isAlive(i))
if(isAlive(matching[j]))
{
helper.callInstancePtr(
i, *this, &function, context);
matching[j], *this, &function, context);
}
}
},
@ -948,7 +945,7 @@ namespace EC
{
std::vector<std::vector<std::size_t> > matchingV(bitsets.size());
if(threadCount <= 1)
if(threadCount <= 1 || currentSize <= threadCount)
{
for(std::size_t i = 0; i < currentSize; ++i)
{
@ -971,44 +968,60 @@ namespace EC
std::vector<std::thread> threads(threadCount);
std::size_t s = currentSize / threadCount;
std::mutex mutex;
for(std::size_t i = 0; i < threadCount; ++i)
{
std::size_t begin = s * i;
std::size_t end;
if(i == threadCount - 1)
{
end = currentSize;
}
else
{
end = s * (i + 1);
}
threads[i] = std::thread(
[this, &matchingV, &bitsets, &mutex]
(std::size_t begin, std::size_t end)
{
for(std::size_t j = begin; j < end; ++j)
{
if(!isAlive(j))
{
continue;
if(s == 0) {
for(std::size_t i = 0; i < currentSize; ++i) {
threads[i] = std::thread(
[this, &matchingV, &bitsets, &mutex] (std::size_t idx) {
if(!isAlive(idx)) {
return;
}
for(std::size_t k = 0; k < bitsets.size(); ++k)
{
if(((*bitsets[k]) &
std::get<BitsetType>(entities[j]))
== (*bitsets[k]))
std::get<BitsetType>(entities[idx]))
== (*bitsets[k]))
{
std::lock_guard<std::mutex> guard(mutex);
matchingV[k].push_back(j);
matchingV[k].push_back(idx);
}
}
}, i);
}
for(std::size_t i = 0; i < currentSize; ++i) {
threads[i].join();
}
} else {
for (std::size_t i = 0; i < threadCount; ++i) {
std::size_t begin = s * i;
std::size_t end;
if (i == threadCount - 1) {
end = currentSize;
} else {
end = s * (i + 1);
}
}, begin, end);
}
for(std::size_t i = 0; i < threadCount; ++i)
{
threads[i].join();
threads[i] = std::thread(
[this, &matchingV, &bitsets, &mutex]
(std::size_t begin, std::size_t end) {
for (std::size_t j = begin; j < end; ++j) {
if (!isAlive(j)) {
continue;
}
for (std::size_t k = 0; k < bitsets.size(); ++k) {
if (((*bitsets[k]) &
std::get<BitsetType>(entities[j]))
== (*bitsets[k])) {
std::lock_guard<std::mutex> guard(mutex);
matchingV[k].push_back(j);
}
}
}
}, begin, end);
}
for (std::size_t i = 0; i < threadCount; ++i) {
threads[i].join();
}
}
}