boost/compute
2
0
Fork 0
mirror of https://github.com/boostorg/compute.git synced 2026-02-17 13:42:17 +00:00
Code Issues Projects Releases Wiki Activity
1,142 Commits 10 Branches 59 Tags
585eb747a054a830d2f18e2432f3dca8d7445afb
Commit Graph

1142 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Jakub Szuppe
585eb747a0 More tests for adjacent difference 2016-07-09 14:11:01 +02:00
Jakub Szuppe
9e2fc74826 Use serial_reduce for small inputs 
For inputs smaller than <serial_reduce_threshold>
serial_reduce algorithm is used.
 2016-07-09 14:06:06 +02:00
Jakub Szuppe
a085e6b3e1 Reduce for multicore CPUs 2016-07-09 14:06:06 +02:00
Kyle Lutz
a3f72e6191 Merge pull request #622 from haahh/pr_adjacent_diff_fix 
Fix adjacent_difference when first == result
 2016-07-05 16:52:40 -07:00
Jakub Szuppe
92a16e459c Fix adjacent_difference when first == result 
Situation where first == result was only covered
when binary function was not specified.
 2016-07-01 21:25:46 +02:00
Kyle Lutz
e5a9017d69 Merge pull request #620 from haahh/pr_pocl_fix_llvm_apt 
Temp. fix for llvm apt being down
 2016-06-25 09:15:49 -07:00
Kyle Lutz
b3633eb54b Merge pull request #619 from haahh/pr_comp_sort 
Comparison sort (for GPUs)
 2016-06-23 20:24:38 -07:00
Jakub Szuppe
a721db2f72 Temp. fix for llvm apt being down 
See https://github.com/travis-ci/travis-ci/issues/6120
 2016-06-23 15:56:36 +02:00
Jakub Szuppe
5d31bd0f07 Add tests for stable comp. sort and sort-by-key 2016-06-22 17:06:12 +02:00
Jakub Szuppe
c47753c4fa Stable comparison sort, sort-by-key 2016-06-22 17:06:12 +02:00
Jakub Szuppe
7996382178 Use index instead of copying vals in bitonic sort-by-key 
Instead of copying values in local memory in bitonic block
sort (when sorting by key), we save and copy local index
and copy value once at the end. This saves local memory.
 2016-06-22 15:59:55 +02:00
Jakub Szuppe
1311de15a3 Add benchmark for comparison sort 2016-06-22 15:59:55 +02:00
Jakub Szuppe
cc1cc0e345 Add tests for comparison sort 2016-06-21 17:41:36 +02:00
Jakub Szuppe
8f033e72ee Add comparison sort and sort by key 2016-06-21 17:41:36 +02:00
Kyle Lutz
04e7dde220 Merge pull request #617 from haahh/pr_travis_ci_boost161 
Add Travis CI build with latest Boost libs
 2016-06-03 20:09:32 -07:00
Jakub Szuppe
c046a5f976 Remove unnecessary source from Travis CI build 2016-06-02 20:00:23 +02:00
Jakub Szuppe
e213006ba2 Cache built Boost libraries 2016-06-02 20:00:23 +02:00
Jakub Szuppe
18146f2fb7 Add Travis CI build with the latest Boost (1.61) 2016-06-02 20:00:05 +02:00
Jakub Szuppe
f669581f02 Travis CI: move downloading cmake to the install step 2016-06-01 15:49:46 +02:00
Kyle Lutz
4c31d07130 Merge pull request #616 from haahh/pr_typesafe_copy 
Type-safe copying
 2016-05-31 21:26:41 -07:00
Jakub Szuppe
8f4db3d7b7 Reuse dispatch_copy_async() in dispatch_copy() 2016-05-28 22:54:51 +02:00
Jakub Szuppe
bffc9f74fb Fix async copying when first == last (input is empty) 2016-05-28 22:46:35 +02:00
Jakub Szuppe
c9a0aba172 Remove debug macro, fix names of event variables 2016-05-28 22:05:50 +02:00
Jakub Szuppe
69e09f27d8 Minor fixes in test_copy.cpp 2016-05-28 13:15:36 +02:00
Jakub Szuppe
ba0da3f3f4 Tests for copying SVM memory when types mismatch 
Tests for copying SVM memory to/from/on device when
value_types of InputIterator and OutputIterator mismatch.
 2016-05-28 13:15:36 +02:00
Jakub Szuppe
5c29b50823 Coping SVM to/from host by mapping SVM memory 2016-05-28 13:15:36 +02:00
Jakub Szuppe
753f883321 Support for svm_ptr<T> in meta_kernel 2016-05-28 13:15:36 +02:00
Jakub Szuppe
4280024f26 Now svm_ptr<T> keeps its context 
This commit modifies svm_ptr<T> to keep its context. It is
convenient for the users and enables creating
svm_ptr_index_expr<T, IndexExpr> class.
 2016-05-28 13:15:36 +02:00
Jakub Szuppe
933ff15ce5 Better names for tests 2016-05-28 13:15:36 +02:00
Jakub Szuppe
aaaaca4ed2 Type-safe async coping from device to host 2016-05-28 13:15:36 +02:00
Jakub Szuppe
3dcbd4c001 Fix async coping svm_ptr<> from/to/on device 2016-05-28 13:15:36 +02:00
Jakub Szuppe
7461c92fdc Add test for async coping with svm_ptr<> 2016-05-24 21:37:29 +02:00
Jakub Szuppe
55ac7da9d8 Fix test in test_functional_as.cpp 
At the end of test we should read from input vector
(not output) in order to check if transform() with
as<int>() was performed correctly.
 2016-05-24 21:37:29 +02:00
Jakub Szuppe
2187821975 Make sure there's no macro redefinition 2016-05-24 21:37:29 +02:00
Jakub Szuppe
1419b7d36f Type-safe copying from device to host 
Type-safe copying from device to host. Seperate copying
algorithm device -> host for non-contiguous OutputIterator (host).
 2016-05-24 21:37:29 +02:00
Jakub Szuppe
ce8230b6f5 Coping from host for non-contiguous iterators (host) 
When InputIterator (host) is a non-contiguous iterator we don't
need a separate algorithm for cases when value_types of InputIterator
and OutputIterator (device) do not match and cases when they do
match.
 2016-05-21 17:16:13 +02:00
Jakub Szuppe
7c3d0c20e9 Add tests for coping on device with mismatched types 2016-05-21 16:58:31 +02:00
Jakub Szuppe
d12e07c0e9 Fix type-safety issues for async copying host->device 2016-05-21 16:58:15 +02:00
Jakub Szuppe
3493b750e8 Fix type, long_ and long might be different types 2016-05-21 16:57:45 +02:00
Jakub Szuppe
bba6c61ed4 Add tests for copying host->device with mismatched types 2016-05-21 16:52:05 +02:00
Jakub Szuppe
a830531445 Fix type-safety issues when copying host->device 2016-05-21 16:44:44 +02:00
Kyle Lutz
d41ff00c06 Merge pull request #613 from haahh/pr_discrete_distribution 
Default constructor for discrete distribution
 2016-05-12 20:23:25 -07:00
Jakub Szuppe
56ad192b92 Now discrete_distribution generates IntType values 
Class discrete_distribution should generate values of type
IntType. Until now it always generated unsigned int values.
 2016-05-11 08:30:46 +02:00
Jakub Szuppe
650e828542 Add more tests for discrete_distribution 2016-05-11 08:30:45 +02:00
Jakub Szuppe
227c05cbdc Add min() and max() methods for discrete_distribution 2016-05-11 08:30:44 +02:00
Jakub Szuppe
e9b2c0ff4b Add default constructor for discrete_distribution 2016-05-11 08:30:41 +02:00
Jakub Szuppe
1799ee1b6e Support for first==last in discrete_distribution range ctor 
Add support for the case with first iterator being equal
to last iterator in range ctor. Now it behaves like ctor in
std::discrete_distribution.
Additionaly: now method probabilities() returns correct vector
of probabilities.
 2016-05-11 08:30:39 +02:00
Kyle Lutz
c173bf02e3 Merge pull request #611 from haahh/pr_coveralls_build 
Dedicated build for coveralls
 2016-05-10 22:06:55 -07:00
Kyle Lutz
d172c8020e Merge pull request #610 from haahh/pr_osx 
OSX
 2016-05-09 21:46:09 -07:00
Jakub Szuppe
476b15933d Remove redundant Travis-CI build 
Remove redundant Travis-CI AMD APP SDK 2.9.1, OpenCL 1.2
build (the Coveralls build has the same test environment,
except for Linux version).
 2016-05-09 12:42:14 +02:00