Update package
git-svn-id: svn://scm.gforge.inria.fr/svnroot/paradiseo@2274 331e1502-861f-0410-8da2-ba01fb791d7f
This commit is contained in:
boufaras
parent
2b96354018
commit
ab5377d1a1
4 changed files with 0 additions and 345 deletions
|
|
@ -1,89 +0,0 @@
|
|||
/*
|
||||
<t-memory.cu>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||
|
||||
Karima Boufaras, Thé Van LUONG
|
||||
|
||||
This software is governed by the CeCILL license under French law and
|
||||
abiding by the rules of distribution of free software. You can use,
|
||||
modify and/ or redistribute the software under the terms of the CeCILL
|
||||
license as circulated by CEA, CNRS and INRIA at the following URL
|
||||
"http://www.cecill.info".
|
||||
|
||||
As a counterpart to the access to the source code and rights to copy,
|
||||
modify and redistribute granted by the license, users are provided only
|
||||
with a limited warranty and the software's author, the holder of the
|
||||
economic rights, and the successive licensors have only limited liability.
|
||||
|
||||
In this respect, the user's attention is drawn to the risks associated
|
||||
with loading, using, modifying and/or developing or reproducing the
|
||||
software by the user in light of its specific status of free software,
|
||||
that may mean that it is complicated to manipulate, and that also
|
||||
therefore means that it is reserved for developers and experienced
|
||||
professionals having in-depth computer knowledge. Users are therefore
|
||||
encouraged to load and test the software's suitability as regards their
|
||||
requirements in conditions enabling the security of their systems and/or
|
||||
data to be ensured and, more generally, to use and operate it in the
|
||||
same conditions as regards security.
|
||||
The fact that you are presently reading this means that you have had
|
||||
knowledge of the CeCILL license and that you accept its terms.
|
||||
|
||||
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||
*/
|
||||
|
||||
#include <cstdlib>
|
||||
#include <cassert>
|
||||
#include <iostream>
|
||||
#include <memory/moCudaAllocator.h>
|
||||
#include <memory/moCudaDesallocator.h>
|
||||
#include <memory/moCudaCopy.h>
|
||||
|
||||
|
||||
int main() {
|
||||
|
||||
|
||||
std::cout << "[t-memory] => START" << std::endl;
|
||||
|
||||
//test constructor
|
||||
int * h_data;
|
||||
int * cpy_data;
|
||||
int * d_data;
|
||||
moCudaAllocator<int> alloc;
|
||||
moCudaDesallocator<int> desalloc;
|
||||
moCudaCopy<int> cpy;
|
||||
int i=0;
|
||||
|
||||
//data allocation
|
||||
h_data= new int[5];
|
||||
cpy_data= new int[5];
|
||||
alloc(d_data,5);
|
||||
|
||||
for(i=0;i<5;i++)
|
||||
h_data[i]=i;
|
||||
|
||||
//test default way of copy from host to device
|
||||
cpy(d_data,h_data,5);
|
||||
|
||||
//test copy from device to host
|
||||
cpy(cpy_data,d_data,5,0);
|
||||
for(i=0;i<5;i++)
|
||||
assert(cpy_data[i]==i);
|
||||
|
||||
for(i=0;i<5;i++)
|
||||
h_data[i]=i*2;
|
||||
|
||||
//test copy from host to device
|
||||
cpy(d_data,h_data,5,1);
|
||||
|
||||
//test copy from device to host
|
||||
cpy(cpy_data,d_data,5,0);
|
||||
i=0;
|
||||
for(i=0;i<5;i++)
|
||||
assert(cpy_data[i]==i*2);
|
||||
desalloc(d_data);
|
||||
std::cout << "[t-memory] => OK" << std::endl;
|
||||
|
||||
return EXIT_SUCCESS;
|
||||
}
|
||||
|
||||
|
|
@ -1,71 +0,0 @@
|
|||
/*
|
||||
<t-moCudaBitNeighbor.cu>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||
|
||||
Karima Boufaras, Thé Van LUONG
|
||||
|
||||
This software is governed by the CeCILL license under French law and
|
||||
abiding by the rules of distribution of free software. You can use,
|
||||
modify and/ or redistribute the software under the terms of the CeCILL
|
||||
license as circulated by CEA, CNRS and INRIA at the following URL
|
||||
"http://www.cecill.info".
|
||||
|
||||
As a counterpart to the access to the source code and rights to copy,
|
||||
modify and redistribute granted by the license, users are provided only
|
||||
with a limited warranty and the software's author, the holder of the
|
||||
economic rights, and the successive licensors have only limited liability.
|
||||
|
||||
In this respect, the user's attention is drawn to the risks associated
|
||||
with loading, using, modifying and/or developing or reproducing the
|
||||
software by the user in light of its specific status of free software,
|
||||
that may mean that it is complicated to manipulate, and that also
|
||||
therefore means that it is reserved for developers and experienced
|
||||
professionals having in-depth computer knowledge. Users are therefore
|
||||
encouraged to load and test the software's suitability as regards their
|
||||
requirements in conditions enabling the security of their systems and/or
|
||||
data to be ensured and, more generally, to use and operate it in the
|
||||
same conditions as regards security.
|
||||
The fact that you are presently reading this means that you have had
|
||||
knowledge of the CeCILL license and that you accept its terms.
|
||||
|
||||
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||
*/
|
||||
|
||||
#include <cstdlib>
|
||||
#include <cassert>
|
||||
#include <iostream>
|
||||
#include <cudaType/moCudaBitVector.h>
|
||||
#include <neighborhood/moCudaBitNeighbor.h>
|
||||
|
||||
typedef moCudaBitVector<eoMaximizingFitness> Solution;
|
||||
typedef moCudaBitNeighbor<Solution,eoMaximizingFitness> Neighbor;
|
||||
|
||||
|
||||
int main() {
|
||||
|
||||
|
||||
std::cout << "[t-moCudaBitNeighbor] => START" << std::endl;
|
||||
//test constructor
|
||||
Neighbor test1, test2;
|
||||
|
||||
test1.fitness(3);
|
||||
//test operateur d'affectation
|
||||
test2=test1;
|
||||
assert(test1.fitness()==test2.fitness());
|
||||
|
||||
//test operateur de copy
|
||||
Neighbor test3(test1);
|
||||
assert(test1.fitness()==test3.fitness());
|
||||
|
||||
test1.printOn(std::cout);
|
||||
test2.printOn(std::cout);
|
||||
test3.printOn(std::cout);
|
||||
|
||||
assert(test1.className()=="moCudaBitNeighbor");
|
||||
|
||||
std::cout << "[t-moCudaBitNeighbor] => OK" << std::endl;
|
||||
|
||||
return EXIT_SUCCESS;
|
||||
}
|
||||
|
||||
|
|
@ -1,96 +0,0 @@
|
|||
/*
|
||||
<t-moCudaBitVector.cu>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||
|
||||
Karima Boufaras, Thé Van LUONG
|
||||
|
||||
This software is governed by the CeCILL license under French law and
|
||||
abiding by the rules of distribution of free software. You can use,
|
||||
modify and/ or redistribute the software under the terms of the CeCILL
|
||||
license as circulated by CEA, CNRS and INRIA at the following URL
|
||||
"http://www.cecill.info".
|
||||
|
||||
As a counterpart to the access to the source code and rights to copy,
|
||||
modify and redistribute granted by the license, users are provided only
|
||||
with a limited warranty and the software's author, the holder of the
|
||||
economic rights, and the successive licensors have only limited liability.
|
||||
|
||||
In this respect, the user's attention is drawn to the risks associated
|
||||
with loading, using, modifying and/or developing or reproducing the
|
||||
software by the user in light of its specific status of free software,
|
||||
that may mean that it is complicated to manipulate, and that also
|
||||
therefore means that it is reserved for developers and experienced
|
||||
professionals having in-depth computer knowledge. Users are therefore
|
||||
encouraged to load and test the software's suitability as regards their
|
||||
requirements in conditions enabling the security of their systems and/or
|
||||
data to be ensured and, more generally, to use and operate it in the
|
||||
same conditions as regards security.
|
||||
The fact that you are presently reading this means that you have had
|
||||
knowledge of the CeCILL license and that you accept its terms.
|
||||
|
||||
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||
*/
|
||||
|
||||
#include <cstdlib>
|
||||
#include <cassert>
|
||||
#include <iostream>
|
||||
#include <cudaType/moCudaBitVector.h>
|
||||
#include <problems/eval/EvalOneMax.h>
|
||||
#include <eo>
|
||||
|
||||
typedef moCudaBitVector<eoMaximizingFitness> Solution;
|
||||
|
||||
|
||||
int main() {
|
||||
|
||||
|
||||
std::cout << "[t-moCudaBitVector] => START" << std::endl;
|
||||
|
||||
EvalOneMax<Solution> eval;
|
||||
|
||||
//test default constructor
|
||||
Solution sol;
|
||||
assert(sol.size()==0);
|
||||
|
||||
//test constructor of random vector
|
||||
Solution sol1(5);
|
||||
assert(sol1.size()==5);
|
||||
|
||||
//test random vector of bool
|
||||
for(int i=0;i<5;i++)
|
||||
assert((sol1[i]==0)||(sol1[i]==1));
|
||||
|
||||
//test oneMax eval function
|
||||
eval(sol1);
|
||||
eoMaximizingFitness sum=0;
|
||||
for(int i=0;i<5;i++)
|
||||
sum=sum+sol1[i];
|
||||
assert(sol1.fitness()==sum);
|
||||
|
||||
//verif constructor of constant vector
|
||||
Solution sol2(4,1);
|
||||
assert(sol2.size()==4);
|
||||
for(int i=0;i<4;i++)
|
||||
assert(sol2[i]==1);
|
||||
eval(sol2);
|
||||
assert(sol2.fitness()==4);
|
||||
|
||||
//test accessor
|
||||
sol2[3]=0;
|
||||
assert(sol2[3]==0);
|
||||
eval(sol2);
|
||||
assert(sol2.fitness()==3);
|
||||
|
||||
//test assignement operator
|
||||
sol2=sol1;
|
||||
assert(sol1.size()==sol2.size());
|
||||
assert(sol1.fitness()==sol2.fitness());
|
||||
for(int i=0;i<5;i++)
|
||||
assert(sol1[i]==sol2[i]);
|
||||
|
||||
std::cout << "[t-moCudaBitVector] => OK" << std::endl;
|
||||
|
||||
return EXIT_SUCCESS;
|
||||
}
|
||||
|
||||
|
|
@ -1,89 +0,0 @@
|
|||
/*
|
||||
<t-moCudaIntVector.cu>
|
||||
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2010
|
||||
|
||||
Karima Boufaras, Thé Van LUONG
|
||||
|
||||
This software is governed by the CeCILL license under French law and
|
||||
abiding by the rules of distribution of free software. You can use,
|
||||
modify and/ or redistribute the software under the terms of the CeCILL
|
||||
license as circulated by CEA, CNRS and INRIA at the following URL
|
||||
"http://www.cecill.info".
|
||||
|
||||
As a counterpart to the access to the source code and rights to copy,
|
||||
modify and redistribute granted by the license, users are provided only
|
||||
with a limited warranty and the software's author, the holder of the
|
||||
economic rights, and the successive licensors have only limited liability.
|
||||
|
||||
In this respect, the user's attention is drawn to the risks associated
|
||||
with loading, using, modifying and/or developing or reproducing the
|
||||
software by the user in light of its specific status of free software,
|
||||
that may mean that it is complicated to manipulate, and that also
|
||||
therefore means that it is reserved for developers and experienced
|
||||
professionals having in-depth computer knowledge. Users are therefore
|
||||
encouraged to load and test the software's suitability as regards their
|
||||
requirements in conditions enabling the security of their systems and/or
|
||||
data to be ensured and, more generally, to use and operate it in the
|
||||
same conditions as regards security.
|
||||
The fact that you are presently reading this means that you have had
|
||||
knowledge of the CeCILL license and that you accept its terms.
|
||||
|
||||
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
||||
Contact: paradiseo-help@lists.gforge.inria.fr
|
||||
*/
|
||||
|
||||
#include <cstdlib>
|
||||
#include <cassert>
|
||||
#include <iostream>
|
||||
#include <cudaType/moCudaIntVector.h>
|
||||
#include <eo>
|
||||
|
||||
typedef moCudaIntVector<eoMaximizingFitness> Solution;
|
||||
|
||||
|
||||
int main() {
|
||||
|
||||
|
||||
std::cout << "[t-moCudaIntVector] => START" << std::endl;
|
||||
|
||||
//test Default constructor
|
||||
Solution sol;
|
||||
assert(sol.size()==0);
|
||||
|
||||
//test constructor
|
||||
Solution sol1(5);
|
||||
Solution sol2(3);
|
||||
|
||||
assert(sol1.size()==5);
|
||||
assert(sol2.size()==3);
|
||||
|
||||
//test discret vector (create) & getter
|
||||
for(int i=0;i<5;i++)
|
||||
assert((sol1[i]>=0)||(sol1[i]<5));
|
||||
|
||||
//test size setter
|
||||
sol1.setSize(4);
|
||||
assert(sol1.size()==4);
|
||||
|
||||
//test solution setter
|
||||
sol1[4]=0;
|
||||
assert(sol1[4]==0);
|
||||
|
||||
//test discret vector
|
||||
for(int i=0;i<3;i++)
|
||||
assert((sol2[i]>=0)||(sol2[i]<3));
|
||||
sol2.fitness(200);
|
||||
|
||||
//test assignement operator
|
||||
sol1=sol2;
|
||||
assert(sol1.size()==3);
|
||||
assert(sol1.fitness()==200);
|
||||
for(int i=0;i<3;i++)
|
||||
assert(sol1[i]==sol2[i]);
|
||||
|
||||
|
||||
std::cout << "[t-moCudaIntVector] => OK" << std::endl;
|
||||
|
||||
return EXIT_SUCCESS;
|
||||
}
|
||||
|
||||
Loading…
Add table
Add a link
Reference in a new issue