mirror of
https://github.com/EQEmu/Server.git
synced 2026-06-10 19:10:25 +00:00
Revert "Build System Updated"
This commit is contained in:
Alex
GitHub
+194
-167
@@ -8,224 +8,251 @@
|
||||
#include <map>
|
||||
#include <vector>
|
||||
#include <queue>
|
||||
#include <vector>
|
||||
#include <boost/dynamic_bitset.hpp>
|
||||
#include <boost/foreach.hpp>
|
||||
#include <boost/tuple/tuple.hpp>
|
||||
#include <boost/tuple/tuple_comparison.hpp>
|
||||
#include <luabind/typeid.hpp>
|
||||
#include <luabind/detail/inheritance.hpp>
|
||||
|
||||
namespace luabind {
|
||||
namespace detail {
|
||||
namespace luabind { namespace detail {
|
||||
|
||||
class_id const class_id_map::local_id_base = std::numeric_limits<class_id>::max() / 2;
|
||||
class_id const class_id_map::local_id_base =
|
||||
std::numeric_limits<class_id>::max() / 2;
|
||||
|
||||
namespace
|
||||
{
|
||||
namespace
|
||||
{
|
||||
|
||||
struct edge
|
||||
{
|
||||
edge(class_id target, cast_function cast)
|
||||
: target(target), cast(cast)
|
||||
{}
|
||||
struct edge
|
||||
{
|
||||
edge(class_id target, cast_function cast)
|
||||
: target(target)
|
||||
, cast(cast)
|
||||
{}
|
||||
|
||||
class_id target;
|
||||
cast_function cast;
|
||||
};
|
||||
class_id target;
|
||||
cast_function cast;
|
||||
};
|
||||
|
||||
bool operator<(edge const& x, edge const& y)
|
||||
{
|
||||
return x.target < y.target;
|
||||
}
|
||||
bool operator<(edge const& x, edge const& y)
|
||||
{
|
||||
return x.target < y.target;
|
||||
}
|
||||
|
||||
struct vertex
|
||||
{
|
||||
vertex(class_id id)
|
||||
: id(id)
|
||||
{}
|
||||
struct vertex
|
||||
{
|
||||
vertex(class_id id)
|
||||
: id(id)
|
||||
{}
|
||||
|
||||
class_id id;
|
||||
std::vector<edge> edges;
|
||||
};
|
||||
class_id id;
|
||||
std::vector<edge> edges;
|
||||
};
|
||||
|
||||
using cache_entry = std::pair<std::ptrdiff_t, int>;
|
||||
typedef std::pair<std::ptrdiff_t, int> cache_entry;
|
||||
|
||||
class cache
|
||||
{
|
||||
public:
|
||||
static constexpr std::ptrdiff_t unknown = std::numeric_limits<std::ptrdiff_t>::max();
|
||||
static constexpr std::ptrdiff_t invalid = unknown - 1;
|
||||
class cache
|
||||
{
|
||||
public:
|
||||
static std::ptrdiff_t const unknown;
|
||||
static std::ptrdiff_t const invalid;
|
||||
|
||||
cache_entry get(class_id src, class_id target, class_id dynamic_id, std::ptrdiff_t object_offset) const;
|
||||
cache_entry get(
|
||||
class_id src, class_id target, class_id dynamic_id
|
||||
, std::ptrdiff_t object_offset) const;
|
||||
|
||||
void put(class_id src, class_id target, class_id dynamic_id, std::ptrdiff_t object_offset, std::ptrdiff_t offset, int distance);
|
||||
void invalidate();
|
||||
void put(
|
||||
class_id src, class_id target, class_id dynamic_id
|
||||
, std::ptrdiff_t object_offset
|
||||
, std::size_t distance, std::ptrdiff_t offset);
|
||||
|
||||
private:
|
||||
using key_type = std::tuple<class_id, class_id, class_id, std::ptrdiff_t>;
|
||||
using map_type = std::map<key_type, cache_entry>;
|
||||
map_type m_cache;
|
||||
};
|
||||
void invalidate();
|
||||
|
||||
constexpr std::ptrdiff_t cache::unknown;
|
||||
constexpr std::ptrdiff_t cache::invalid;
|
||||
private:
|
||||
typedef boost::tuple<
|
||||
class_id, class_id, class_id, std::ptrdiff_t> key_type;
|
||||
typedef std::map<key_type, cache_entry> map_type;
|
||||
map_type m_cache;
|
||||
};
|
||||
|
||||
cache_entry cache::get(class_id src, class_id target, class_id dynamic_id, std::ptrdiff_t object_offset) const
|
||||
{
|
||||
map_type::const_iterator i = m_cache.find(
|
||||
key_type(src, target, dynamic_id, object_offset));
|
||||
return i != m_cache.end() ? i->second : cache_entry(unknown, -1);
|
||||
}
|
||||
std::ptrdiff_t const cache::unknown =
|
||||
std::numeric_limits<std::ptrdiff_t>::max();
|
||||
std::ptrdiff_t const cache::invalid = cache::unknown - 1;
|
||||
|
||||
void cache::put(class_id src, class_id target, class_id dynamic_id, std::ptrdiff_t object_offset, std::ptrdiff_t offset, int distance)
|
||||
{
|
||||
m_cache.insert(std::make_pair(key_type(src, target, dynamic_id, object_offset), cache_entry(offset, distance)));
|
||||
}
|
||||
cache_entry cache::get(
|
||||
class_id src, class_id target, class_id dynamic_id
|
||||
, std::ptrdiff_t object_offset) const
|
||||
{
|
||||
map_type::const_iterator i = m_cache.find(
|
||||
key_type(src, target, dynamic_id, object_offset));
|
||||
return i != m_cache.end() ? i->second : cache_entry(unknown, -1);
|
||||
}
|
||||
|
||||
void cache::invalidate()
|
||||
{
|
||||
m_cache.clear();
|
||||
}
|
||||
void cache::put(
|
||||
class_id src, class_id target, class_id dynamic_id
|
||||
, std::ptrdiff_t object_offset, std::size_t distance, std::ptrdiff_t offset)
|
||||
{
|
||||
m_cache.insert(std::make_pair(
|
||||
key_type(src, target, dynamic_id, object_offset)
|
||||
, cache_entry(offset, distance)
|
||||
));
|
||||
}
|
||||
|
||||
} // namespace anonymous
|
||||
void cache::invalidate()
|
||||
{
|
||||
m_cache.clear();
|
||||
}
|
||||
|
||||
class cast_graph::impl
|
||||
{
|
||||
public:
|
||||
std::pair<void*, int> cast(
|
||||
void* p, class_id src, class_id target
|
||||
, class_id dynamic_id, void const* dynamic_ptr) const;
|
||||
void insert(class_id src, class_id target, cast_function cast);
|
||||
} // namespace unnamed
|
||||
|
||||
private:
|
||||
std::vector<vertex> m_vertices;
|
||||
mutable cache m_cache;
|
||||
};
|
||||
class cast_graph::impl
|
||||
{
|
||||
public:
|
||||
std::pair<void*, int> cast(
|
||||
void* p, class_id src, class_id target
|
||||
, class_id dynamic_id, void const* dynamic_ptr) const;
|
||||
void insert(class_id src, class_id target, cast_function cast);
|
||||
|
||||
namespace
|
||||
{
|
||||
private:
|
||||
std::vector<vertex> m_vertices;
|
||||
mutable cache m_cache;
|
||||
};
|
||||
|
||||
struct queue_entry
|
||||
{
|
||||
queue_entry(void* p, class_id vertex_id, int distance)
|
||||
: p(p)
|
||||
, vertex_id(vertex_id)
|
||||
, distance(distance)
|
||||
{}
|
||||
namespace
|
||||
{
|
||||
|
||||
void* p;
|
||||
class_id vertex_id;
|
||||
int distance;
|
||||
};
|
||||
struct queue_entry
|
||||
{
|
||||
queue_entry(void* p, class_id vertex_id, int distance)
|
||||
: p(p)
|
||||
, vertex_id(vertex_id)
|
||||
, distance(distance)
|
||||
{}
|
||||
|
||||
} // namespace anonymous
|
||||
void* p;
|
||||
class_id vertex_id;
|
||||
int distance;
|
||||
};
|
||||
|
||||
std::pair<void*, int> cast_graph::impl::cast(void* const p, class_id src, class_id target, class_id dynamic_id, void const* dynamic_ptr) const
|
||||
{
|
||||
if(src == target) return std::make_pair(p, 0);
|
||||
if(src >= m_vertices.size() || target >= m_vertices.size()) return std::pair<void*, int>((void*)0, -1);
|
||||
} // namespace unnamed
|
||||
|
||||
std::ptrdiff_t const object_offset = (char const*)dynamic_ptr - (char const*)p;
|
||||
cache_entry cached = m_cache.get(src, target, dynamic_id, object_offset);
|
||||
std::pair<void*, int> cast_graph::impl::cast(
|
||||
void* const p, class_id src, class_id target
|
||||
, class_id dynamic_id, void const* dynamic_ptr) const
|
||||
{
|
||||
if (src == target)
|
||||
return std::make_pair(p, 0);
|
||||
|
||||
if(cached.first != cache::unknown)
|
||||
{
|
||||
if(cached.first == cache::invalid)
|
||||
return std::pair<void*, int>((void*)0, -1);
|
||||
return std::make_pair((char*)p + cached.first, cached.second);
|
||||
}
|
||||
if (src >= m_vertices.size() || target >= m_vertices.size())
|
||||
return std::pair<void*, int>((void*)0, -1);
|
||||
|
||||
std::queue<queue_entry> q;
|
||||
q.push(queue_entry(p, src, 0));
|
||||
std::ptrdiff_t const object_offset =
|
||||
(char const*)dynamic_ptr - (char const*)p;
|
||||
|
||||
// Original source used boost::dynamic_bitset but didn't make use
|
||||
// of its advanced capability of set operations, that's why I think
|
||||
// it's safe to use a std::vector<bool> here.
|
||||
cache_entry cached = m_cache.get(src, target, dynamic_id, object_offset);
|
||||
|
||||
std::vector<bool> visited(m_vertices.size(), false);
|
||||
if (cached.first != cache::unknown)
|
||||
{
|
||||
if (cached.first == cache::invalid)
|
||||
return std::pair<void*, int>((void*)0, -1);
|
||||
return std::make_pair((char*)p + cached.first, cached.second);
|
||||
}
|
||||
|
||||
while(!q.empty())
|
||||
{
|
||||
queue_entry const qe = q.front();
|
||||
q.pop();
|
||||
std::queue<queue_entry> q;
|
||||
q.push(queue_entry(p, src, 0));
|
||||
|
||||
visited[qe.vertex_id] = true;
|
||||
vertex const& v = m_vertices[qe.vertex_id];
|
||||
boost::dynamic_bitset<> visited(m_vertices.size());
|
||||
|
||||
if(v.id == target)
|
||||
{
|
||||
m_cache.put(
|
||||
src, target, dynamic_id, object_offset
|
||||
, (char*)qe.p - (char*)p, qe.distance
|
||||
);
|
||||
while (!q.empty())
|
||||
{
|
||||
queue_entry const qe = q.front();
|
||||
q.pop();
|
||||
|
||||
return std::make_pair(qe.p, qe.distance);
|
||||
}
|
||||
visited[qe.vertex_id] = true;
|
||||
vertex const& v = m_vertices[qe.vertex_id];
|
||||
|
||||
for(auto const& e : v.edges) {
|
||||
if(visited[e.target])
|
||||
continue;
|
||||
if(void* casted = e.cast(qe.p))
|
||||
q.push(queue_entry(casted, e.target, qe.distance + 1));
|
||||
}
|
||||
}
|
||||
if (v.id == target)
|
||||
{
|
||||
m_cache.put(
|
||||
src, target, dynamic_id, object_offset
|
||||
, qe.distance, (char*)qe.p - (char*)p
|
||||
);
|
||||
|
||||
m_cache.put(src, target, dynamic_id, object_offset, cache::invalid, -1);
|
||||
return std::make_pair(qe.p, qe.distance);
|
||||
}
|
||||
|
||||
return std::pair<void*, int>((void*)0, -1);
|
||||
}
|
||||
BOOST_FOREACH(edge const& e, v.edges)
|
||||
{
|
||||
if (visited[e.target])
|
||||
continue;
|
||||
if (void* casted = e.cast(qe.p))
|
||||
q.push(queue_entry(casted, e.target, qe.distance + 1));
|
||||
}
|
||||
}
|
||||
|
||||
void cast_graph::impl::insert(class_id src, class_id target, cast_function cast)
|
||||
{
|
||||
class_id const max_id = std::max(src, target);
|
||||
m_cache.put(src, target, dynamic_id, object_offset, cache::invalid, -1);
|
||||
|
||||
if(max_id >= m_vertices.size())
|
||||
{
|
||||
m_vertices.reserve(max_id + 1);
|
||||
for(class_id i = m_vertices.size(); i < max_id + 1; ++i)
|
||||
m_vertices.push_back(vertex(i));
|
||||
}
|
||||
return std::pair<void*, int>((void*)0, -1);
|
||||
}
|
||||
|
||||
std::vector<edge>& edges = m_vertices[src].edges;
|
||||
void cast_graph::impl::insert(
|
||||
class_id src, class_id target, cast_function cast)
|
||||
{
|
||||
class_id const max_id = std::max(src, target);
|
||||
|
||||
std::vector<edge>::iterator i = std::lower_bound(
|
||||
edges.begin(), edges.end(), edge(target, 0)
|
||||
);
|
||||
if (max_id >= m_vertices.size())
|
||||
{
|
||||
m_vertices.reserve(max_id + 1);
|
||||
for (class_id i = m_vertices.size(); i < max_id + 1; ++i)
|
||||
m_vertices.push_back(vertex(i));
|
||||
}
|
||||
|
||||
if(i == edges.end() || i->target != target)
|
||||
{
|
||||
edges.insert(i, edge(target, cast));
|
||||
m_cache.invalidate();
|
||||
}
|
||||
}
|
||||
std::vector<edge>& edges = m_vertices[src].edges;
|
||||
|
||||
std::pair<void*, int> cast_graph::cast(void* p, class_id src, class_id target, class_id dynamic_id, void const* dynamic_ptr) const
|
||||
{
|
||||
return m_impl->cast(p, src, target, dynamic_id, dynamic_ptr);
|
||||
}
|
||||
std::vector<edge>::iterator i = std::lower_bound(
|
||||
edges.begin(), edges.end(), edge(target, 0)
|
||||
);
|
||||
|
||||
void cast_graph::insert(class_id src, class_id target, cast_function cast)
|
||||
{
|
||||
m_impl->insert(src, target, cast);
|
||||
}
|
||||
if (i == edges.end() || i->target != target)
|
||||
{
|
||||
edges.insert(i, edge(target, cast));
|
||||
m_cache.invalidate();
|
||||
}
|
||||
}
|
||||
|
||||
cast_graph::cast_graph()
|
||||
: m_impl(new impl)
|
||||
{}
|
||||
std::pair<void*, int> cast_graph::cast(
|
||||
void* p, class_id src, class_id target
|
||||
, class_id dynamic_id, void const* dynamic_ptr) const
|
||||
{
|
||||
return m_impl->cast(p, src, target, dynamic_id, dynamic_ptr);
|
||||
}
|
||||
|
||||
cast_graph::~cast_graph()
|
||||
{}
|
||||
void cast_graph::insert(class_id src, class_id target, cast_function cast)
|
||||
{
|
||||
m_impl->insert(src, target, cast);
|
||||
}
|
||||
|
||||
LUABIND_API class_id allocate_class_id(type_id const& cls)
|
||||
{
|
||||
using map_type = std::map<type_id, class_id>;
|
||||
cast_graph::cast_graph()
|
||||
: m_impl(new impl)
|
||||
{}
|
||||
|
||||
static map_type registered;
|
||||
static class_id id = 0;
|
||||
cast_graph::~cast_graph()
|
||||
{}
|
||||
|
||||
std::pair<map_type::iterator, bool> inserted = registered.insert(std::make_pair(cls, id));
|
||||
if(inserted.second) ++id;
|
||||
LUABIND_API class_id allocate_class_id(type_id const& cls)
|
||||
{
|
||||
typedef std::map<type_id, class_id> map_type;
|
||||
|
||||
return inserted.first->second;
|
||||
}
|
||||
static map_type registered;
|
||||
static class_id id = 0;
|
||||
|
||||
} // namespace detail
|
||||
} // namespace luabind
|
||||
std::pair<map_type::iterator, bool> inserted = registered.insert(
|
||||
std::make_pair(cls, id));
|
||||
|
||||
if (inserted.second)
|
||||
++id;
|
||||
|
||||
return inserted.first->second;
|
||||
}
|
||||
|
||||
}} // namespace luabind::detail
|
||||
|
||||
Reference in New Issue
Block a user