123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263 |
- #ifndef BOOST_COMPUTE_ALGORITHM_DETAIL_SERIAL_REDUCE_HPP
- #define BOOST_COMPUTE_ALGORITHM_DETAIL_SERIAL_REDUCE_HPP
- #include <boost/compute/command_queue.hpp>
- #include <boost/compute/detail/meta_kernel.hpp>
- #include <boost/compute/detail/iterator_range_size.hpp>
- #include <boost/compute/type_traits/result_of.hpp>
- namespace boost {
- namespace compute {
- namespace detail {
- template<class InputIterator, class OutputIterator, class BinaryFunction>
- inline void serial_reduce(InputIterator first,
- InputIterator last,
- OutputIterator result,
- BinaryFunction function,
- command_queue &queue)
- {
- typedef typename
- std::iterator_traits<InputIterator>::value_type T;
- typedef typename
- ::boost::compute::result_of<BinaryFunction(T, T)>::type result_type;
- const context &context = queue.get_context();
- size_t count = detail::iterator_range_size(first, last);
- if(count == 0){
- return;
- }
- meta_kernel k("serial_reduce");
- size_t count_arg = k.add_arg<cl_uint>("count");
- k <<
- k.decl<result_type>("result") << " = " << first[0] << ";\n" <<
- "for(uint i = 1; i < count; i++)\n" <<
- " result = " << function(k.var<T>("result"),
- first[k.var<uint_>("i")]) << ";\n" <<
- result[0] << " = result;\n";
- kernel kernel = k.compile(context);
- kernel.set_arg(count_arg, static_cast<uint_>(count));
- queue.enqueue_task(kernel);
- }
- }
- }
- }
- #endif
|