boost/build
2
0
Fork 0
mirror of https://github.com/boostorg/build.git synced 2026-02-21 02:52:12 +00:00
Code Issues Projects Releases Wiki Activity

Workarounds for old msvc compile errors.

Browse Source
This commit is contained in:
René Ferdinand Rivera Morell
2022-04-09 10:08:55 -05:00
parent 9c74a5a845
commit cb23d0955c
1 changed files with 29 additions and 21 deletions
Download Patch File Download Diff File Expand all files Collapse all files

50
src/engine/function.cpp
View File

@@ -326,29 +326,12 @@ struct _stack
// Move "v" to a new slot in ther stack. Returns a reference to the new item.
template <class T>
remove_cref_t<T> & push( T&& v )
{
using U = remove_cref_t<T>;
check_alignment();
data = (char *)data - sizeof(U);
check_alignment();
cleanups.push_back(cleanup_info{&_stack::cleanup_item<U>, this, 1});
return top<U>() = v;
}
remove_cref_t<T> & push( T&& v );
// Copy "v" into "n" new items at the top of the stack. Returns a pointer
// to the first, i.e. top most, new item.
template <class T>
remove_cref_t<T> * push( T v, int32_t n )
{
using U = remove_cref_t<T>;
check_alignment();
data = (char *)data - ( n * sizeof(U) );
check_alignment();
std::uninitialized_fill_n( reinterpret_cast<U*>( data ), n, v );
cleanups.push_back(cleanup_info{&_stack::cleanup_item<U>, this, n});
return reinterpret_cast<U*>( data );
}
remove_cref_t<T> * push( T v, int32_t n );
// Removes the top most "T" item from the stack and returns a copy of it.
template <class T>
@@ -436,7 +419,7 @@ struct _stack
}
template <typename T>
static void cleanup_item(_stack * s, int32_t n)
static void cleanup_item(_stack * s, int32_t n, T*_=nullptr)
{
s->data = (char *)s->data + ( n * sizeof(remove_cref_t<T>) );
s->check_alignment();
@@ -444,7 +427,7 @@ struct _stack
};
template <>
void _stack::cleanup_item<LIST*>(_stack * s, int32_t n)
void _stack::cleanup_item<LIST*>(_stack * s, int32_t n, LIST**)
{
for (int32_t i = 0; i < n; ++i)
{
@@ -454,6 +437,31 @@ void _stack::cleanup_item<LIST*>(_stack * s, int32_t n)
s->check_alignment();
}
template <class T>
remove_cref_t<T> & _stack::push( T&& v )
{
using U = remove_cref_t<T>;
check_alignment();
data = (char *)data - sizeof(U);
check_alignment();
cleanup_info ci = { (cleanup_f)&_stack::cleanup_item<U>, this, 1};
cleanups.push_back(ci);
return top<U>() = v;
}
template <class T>
remove_cref_t<T> * _stack::push( T v, int32_t n )
{
using U = remove_cref_t<T>;
check_alignment();
data = (char *)data - ( n * sizeof(U) );
check_alignment();
std::uninitialized_fill_n( reinterpret_cast<U*>( data ), n, v );
cleanup_info ci = { (cleanup_f)&_stack::cleanup_item<U>, this, n};
cleanups.push_back(ci);
return reinterpret_cast<U*>( data );
}
STACK * stack_global()
{
static STACK result;