stabilize build system: depends, installer, boost/bdb fixes, cross targets groundwork
This commit is contained in:
@@ -0,0 +1,49 @@
|
||||
//---------------------------------------------------------------------------//
|
||||
// Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
|
||||
//
|
||||
// Distributed under the Boost Software License, Version 1.0
|
||||
// See accompanying file LICENSE_1_0.txt or copy at
|
||||
// http://www.boost.org/LICENSE_1_0.txt
|
||||
//
|
||||
// See http://boostorg.github.com/compute for more information.
|
||||
//---------------------------------------------------------------------------//
|
||||
|
||||
#ifndef BOOST_COMPUTE_EXPERIMENTAL_CLAMP_RANGE_HPP
|
||||
#define BOOST_COMPUTE_EXPERIMENTAL_CLAMP_RANGE_HPP
|
||||
|
||||
#include <iterator>
|
||||
|
||||
#include <boost/compute/lambda.hpp>
|
||||
#include <boost/compute/algorithm/transform.hpp>
|
||||
|
||||
namespace boost {
|
||||
namespace compute {
|
||||
namespace experimental {
|
||||
|
||||
template<class InputIterator, class OutputIterator>
|
||||
inline OutputIterator
|
||||
clamp_range(InputIterator first,
|
||||
InputIterator last,
|
||||
OutputIterator result,
|
||||
typename std::iterator_traits<InputIterator>::value_type lo,
|
||||
typename std::iterator_traits<InputIterator>::value_type hi,
|
||||
command_queue &queue)
|
||||
{
|
||||
using ::boost::compute::lambda::_1;
|
||||
using ::boost::compute::lambda::_2;
|
||||
using ::boost::compute::lambda::clamp;
|
||||
|
||||
return ::boost::compute::transform(
|
||||
first,
|
||||
last,
|
||||
result,
|
||||
clamp(_1, lo, hi),
|
||||
queue
|
||||
);
|
||||
}
|
||||
|
||||
} // end experimental namespace
|
||||
} // end compute namespace
|
||||
} // end boost namespace
|
||||
|
||||
#endif // BOOST_COMPUTE_EXPERIMENTAL_CLAMP_RANGE_HPP
|
||||
@@ -0,0 +1,51 @@
|
||||
//---------------------------------------------------------------------------//
|
||||
// Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
|
||||
//
|
||||
// Distributed under the Boost Software License, Version 1.0
|
||||
// See accompanying file LICENSE_1_0.txt or copy at
|
||||
// http://www.boost.org/LICENSE_1_0.txt
|
||||
//
|
||||
// See http://boostorg.github.com/compute for more information.
|
||||
//---------------------------------------------------------------------------//
|
||||
|
||||
#ifndef BOOST_COMPUTE_EXPERIMENTAL_MALLOC_HPP
|
||||
#define BOOST_COMPUTE_EXPERIMENTAL_MALLOC_HPP
|
||||
|
||||
#include <boost/compute/buffer.hpp>
|
||||
#include <boost/compute/system.hpp>
|
||||
#include <boost/compute/context.hpp>
|
||||
#include <boost/compute/detail/device_ptr.hpp>
|
||||
|
||||
namespace boost {
|
||||
namespace compute {
|
||||
namespace experimental {
|
||||
|
||||
// bring device_ptr into the experimental namespace
|
||||
using detail::device_ptr;
|
||||
|
||||
template<class T>
|
||||
inline device_ptr<T>
|
||||
malloc(std::size_t size, const context &context = system::default_context())
|
||||
{
|
||||
buffer buf(context, size * sizeof(T));
|
||||
clRetainMemObject(buf.get());
|
||||
return device_ptr<T>(buf);
|
||||
}
|
||||
|
||||
inline device_ptr<char>
|
||||
malloc(std::size_t size, const context &context = system::default_context())
|
||||
{
|
||||
return malloc<char>(size, context);
|
||||
}
|
||||
|
||||
template<class T>
|
||||
inline void free(device_ptr<T> &ptr)
|
||||
{
|
||||
clReleaseMemObject(ptr.get_buffer().get());
|
||||
}
|
||||
|
||||
} // end experimental namespace
|
||||
} // end compute namespace
|
||||
} // end boost namespace
|
||||
|
||||
#endif // BOOST_COMPUTE_EXPERIMENTAL_MALLOC_HPP
|
||||
@@ -0,0 +1,66 @@
|
||||
//---------------------------------------------------------------------------//
|
||||
// Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
|
||||
//
|
||||
// Distributed under the Boost Software License, Version 1.0
|
||||
// See accompanying file LICENSE_1_0.txt or copy at
|
||||
// http://www.boost.org/LICENSE_1_0.txt
|
||||
//
|
||||
// See http://boostorg.github.com/compute for more information.
|
||||
//---------------------------------------------------------------------------//
|
||||
|
||||
#ifndef BOOST_COMPUTE_EXPERIMENTAL_SORT_BY_TRANSFORM_HPP
|
||||
#define BOOST_COMPUTE_EXPERIMENTAL_SORT_BY_TRANSFORM_HPP
|
||||
|
||||
#include <iterator>
|
||||
|
||||
#include <boost/compute/algorithm/sort_by_key.hpp>
|
||||
#include <boost/compute/algorithm/transform.hpp>
|
||||
#include <boost/compute/container/vector.hpp>
|
||||
#include <boost/compute/detail/iterator_range_size.hpp>
|
||||
#include <boost/compute/type_traits/result_of.hpp>
|
||||
|
||||
namespace boost {
|
||||
namespace compute {
|
||||
namespace experimental {
|
||||
|
||||
template<class Iterator, class Transform, class Compare>
|
||||
inline void sort_by_transform(Iterator first,
|
||||
Iterator last,
|
||||
Transform transform,
|
||||
Compare compare,
|
||||
command_queue &queue = system::default_queue())
|
||||
{
|
||||
typedef typename std::iterator_traits<Iterator>::value_type value_type;
|
||||
typedef typename boost::compute::result_of<Transform(value_type)>::type key_type;
|
||||
|
||||
size_t n = detail::iterator_range_size(first, last);
|
||||
if(n < 2){
|
||||
return;
|
||||
}
|
||||
|
||||
const context &context = queue.get_context();
|
||||
|
||||
::boost::compute::vector<key_type> keys(n, context);
|
||||
|
||||
::boost::compute::transform(
|
||||
first,
|
||||
last,
|
||||
keys.begin(),
|
||||
transform,
|
||||
queue
|
||||
);
|
||||
|
||||
::boost::compute::sort_by_key(
|
||||
keys.begin(),
|
||||
keys.end(),
|
||||
first,
|
||||
compare,
|
||||
queue
|
||||
);
|
||||
}
|
||||
|
||||
} // end experimental namespace
|
||||
} // end compute namespace
|
||||
} // end boost namespace
|
||||
|
||||
#endif // BOOST_COMPUTE_EXPERIMENTAL_SORT_BY_TRANSFORM_HPP
|
||||
@@ -0,0 +1,44 @@
|
||||
//---------------------------------------------------------------------------//
|
||||
// Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
|
||||
//
|
||||
// Distributed under the Boost Software License, Version 1.0
|
||||
// See accompanying file LICENSE_1_0.txt or copy at
|
||||
// http://www.boost.org/LICENSE_1_0.txt
|
||||
//
|
||||
// See http://boostorg.github.com/compute for more information.
|
||||
//---------------------------------------------------------------------------//
|
||||
|
||||
#ifndef BOOST_COMPUTE_EXPERIMENTAL_TABULATE_HPP
|
||||
#define BOOST_COMPUTE_EXPERIMENTAL_TABULATE_HPP
|
||||
|
||||
#include <iterator>
|
||||
|
||||
#include <boost/compute/algorithm/transform.hpp>
|
||||
#include <boost/compute/iterator/counting_iterator.hpp>
|
||||
|
||||
namespace boost {
|
||||
namespace compute {
|
||||
namespace experimental {
|
||||
|
||||
template<class Iterator, class UnaryFunction>
|
||||
inline void tabulate(Iterator first,
|
||||
Iterator last,
|
||||
UnaryFunction function,
|
||||
command_queue &queue)
|
||||
{
|
||||
size_t n = detail::iterator_range_size(first, last);
|
||||
|
||||
::boost::compute::transform(
|
||||
::boost::compute::make_counting_iterator<int>(0),
|
||||
::boost::compute::make_counting_iterator<int>(n),
|
||||
first,
|
||||
function,
|
||||
queue
|
||||
);
|
||||
}
|
||||
|
||||
} // end experimental namespace
|
||||
} // end compute namespace
|
||||
} // end boost namespace
|
||||
|
||||
#endif // BOOST_COMPUTE_EXPERIMENTAL_TABULATE_HPP
|
||||
Reference in New Issue
Block a user