diff --git a/branches/ParadisEO-GPU/test/t-moGPUBitNeighbor.cu b/branches/ParadisEO-GPU/test/t-moGPUBitNeighbor.cu new file mode 100644 index 000000000..f2539728d --- /dev/null +++ b/branches/ParadisEO-GPU/test/t-moGPUBitNeighbor.cu @@ -0,0 +1,96 @@ +/* + + 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 +#include +#include +#include + +typedef moGPUBitVector Solution; +typedef moGPUBitNeighbor Neighbor; + + +int main() { + + + std::cout << "[t-moGPUBitNeighbor] => START" << std::endl; + + //init sol + Solution sol(3); + sol[0]=1; + sol[1]=0; + sol[2]=1; + + //test default Constructor + Neighbor test1; + assert(test1.index()==0); + + //test index setter + test1.index(6); + //test index getter + assert(test1.index()==6); + + //test fitness setter + test1.fitness(2); + //test fitness getter + assert(test1.fitness()==2); + + //test Cpy constructor + Neighbor test2(test1); + assert(test2.index()==6); + assert(test2.fitness()==2); + + //test assignement operator + test1.fitness(8); + test1.index(2); + test2=test1; + assert(test2.fitness()==8); + assert(test2.index()==2); + + //test move + test2.move(sol); + assert(!sol[2]); + + //test moveBack + test2.moveBack(sol); + assert(sol[2]); + + test1.printOn(std::cout); + test2.printOn(std::cout); + + assert(test1.className()=="moGPUBitNeighbor"); + + std::cout << "[t-moCudaBitNeighbor] => OK" << std::endl; + + return EXIT_SUCCESS; +} \ No newline at end of file diff --git a/branches/ParadisEO-GPU/test/t-moGPUMemory.cu b/branches/ParadisEO-GPU/test/t-moGPUMemory.cu index 1dd8fec25..688b01c91 100644 --- a/branches/ParadisEO-GPU/test/t-moGPUMemory.cu +++ b/branches/ParadisEO-GPU/test/t-moGPUMemory.cu @@ -36,7 +36,7 @@ #include #include #include -#include +#include #include @@ -49,7 +49,7 @@ int main() { int * cpy_data; int * d_data; moGPUAllocator alloc; - moGPUDisallocator disalloc; + moGPUDeallocator disalloc; moGPUCopy cpy; int i=0; @@ -82,8 +82,8 @@ int main() { for(i=0;i<5;i++) assert(cpy_data[i]==i*2); - //test GPU memory disallocation - disalloc(d_data); + //test GPU memory deallocation + dealloc(d_data); delete[] h_data; delete[] cpy_data; diff --git a/branches/ParadisEO-GPU/test/t-moGPUXBitFlippingNeighbor.cu b/branches/ParadisEO-GPU/test/t-moGPUXBitFlippingNeighbor.cu new file mode 100644 index 000000000..70db31e2f --- /dev/null +++ b/branches/ParadisEO-GPU/test/t-moGPUXBitFlippingNeighbor.cu @@ -0,0 +1,131 @@ +/* + + 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 +#include +#include +#include +#include + +typedef moGPUBitVector Solution; +typedef moGPUXBitFlippingNeighbor Neighbor; + +int main() { + + std::cout << "[t-moGPUXBitFlippingNeighbor] => START" << std::endl; + + Solution sol(5, 0); + for (int i = 0; i < 5; i++) { + sol[i] = (i % 2 == 0) ? 0 : 1; + } + + assert(sol[0] == 0); + assert(sol[1] == 1); + assert(sol[2] == 0); + assert(sol[3] == 1); + assert(sol[4] == 0); + + //test constructor + Neighbor neighbor; + assert(neighbor.index() == 0); + //test x-change getter + assert(neighbor.getXChange() == 0); + + //test x-change setter + neighbor.setXChange(2); + assert(neighbor.getXChange() == 2); + + //test index setter + for (unsigned int i = 0; i < neighbor.getXChange(); i++) + neighbor.setIndice(i, i); + + //test index getter + for (unsigned int i = 0; i < neighbor.getXChange(); i++) + assert(neighbor.getIndice(i) == i); + + //test move + neighbor.move(sol); + assert(sol[neighbor.getIndice(0)] == 1); + assert(sol[neighbor.getIndice(1)] == 0); + + //test moveBack + neighbor.moveBack(sol); + assert(sol[neighbor.getIndice(0)] == 0); + assert(sol[neighbor.getIndice(1)] == 1); + + //test set & get indice + neighbor.setIndice(0, 1); + neighbor.setIndice(1, 2); + assert(neighbor.getIndice(0) == 1); + assert(neighbor.getIndice(1) == 2); + + //test move + neighbor.move(sol); + assert(sol[neighbor.getIndice(0)] == 0); + assert(sol[neighbor.getIndice(1)] == 1); + + //test move back + neighbor.moveBack(sol); + assert(sol[neighbor.getIndice(0)] == 1); + assert(sol[neighbor.getIndice(1)] == 0); + + Neighbor neighbor1(3); + + //test setter of one index + neighbor1.setIndice(0, 2); + neighbor1.setIndice(1, 3); + neighbor1.setIndice(2, 4); + + //test getter of one index + assert(neighbor1.getIndice(0) == 2); + assert(neighbor1.getIndice(1) == 3); + assert(neighbor1.getIndice(2) == 4); + + //test move + neighbor1.move(sol); + assert(sol[neighbor1.getIndice(0)] == 1); + assert(sol[neighbor1.getIndice(1)] == 0); + assert(sol[neighbor1.getIndice(2)] == 1); + + //test moveBack + neighbor1.moveBack(sol); + assert(sol[neighbor1.getIndice(0)] == 0); + assert(sol[neighbor1.getIndice(1)] == 1); + assert(sol[neighbor1.getIndice(2)] == 0); + + std::cout << "[t-moGPUXBitFlippingNeighbor] => OK" << std::endl; + + return EXIT_SUCCESS; +} + diff --git a/branches/ParadisEO-GPU/test/t-moGPUXSwapNeighbor.cu b/branches/ParadisEO-GPU/test/t-moGPUXSwapNeighbor.cu new file mode 100644 index 000000000..eb118e42a --- /dev/null +++ b/branches/ParadisEO-GPU/test/t-moGPUXSwapNeighbor.cu @@ -0,0 +1,120 @@ +/* + + 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 +#include +#include +#include +#include +#include + +typedef moGPUPermutationVector Solution; +typedef moGPUXSwapNeighbor Neighbor; + +int main() { + + std::cout << "[t-moGPUXSwapNeighbor] => START" << std::endl; + + Solution sol1(5); + for (int i = 4; i >=0; i--) + sol1[4-i] = i; + + //test constructor + Neighbor neighbor(2); + assert(neighbor.index() == 0); + assert(neighbor.getXChange() == 2); + + //test setter of one index + for (unsigned int i = 0; i < neighbor.getXChange(); i++) + neighbor.setIndice(i, i); + + //test getter of one index + for (unsigned int i = 0; i < neighbor.getXChange(); i++) + assert(neighbor.getIndice(i) == i); + + //test move + neighbor.move(sol1); + assert(sol1[neighbor.getIndice(0)] == 3); + assert(sol1[neighbor.getIndice(1)] == 4); + + //test moveBack + neighbor.moveBack(sol1); + assert(sol1[neighbor.getIndice(0)] == 4); + assert(sol1[neighbor.getIndice(1)] == 3); + + //test set & get indice + neighbor.setIndice(0, 1); + neighbor.setIndice(1, 2); + assert(neighbor.getIndice(0) == 1); + assert(neighbor.getIndice(1) == 2); + + //test move + neighbor.move(sol1); + assert(sol1[neighbor.getIndice(0)] == 2); + assert(sol1[neighbor.getIndice(1)] == 3); + + //test move back + neighbor.moveBack(sol1); + assert(sol1[neighbor.getIndice(0)] == 3); + assert(sol1[neighbor.getIndice(1)] == 2); + + Neighbor neighbor2(3); + + //test setter of one index + neighbor2.setIndice(0, 0); + neighbor2.setIndice(1, 1); + neighbor2.setIndice(2, 2); + + //test getter of one index + assert(neighbor2.getIndice(0) == 0); + assert(neighbor2.getIndice(1) == 1); + assert(neighbor2.getIndice(2) == 2); + + //test move + neighbor2.move(sol1); + assert(sol1[neighbor2.getIndice(0)] == 3); + assert(sol1[neighbor2.getIndice(1)] == 2); + assert(sol1[neighbor2.getIndice(2)] == 4); + + //test moveBack + neighbor2.moveBack(sol1); + assert(sol1[neighbor2.getIndice(0)] == 4); + assert(sol1[neighbor2.getIndice(1)] == 3); + assert(sol1[neighbor2.getIndice(2)] == 2); + + std::cout << "[t-moGPUXSwapNeighbor] => OK" << std::endl; + + return EXIT_SUCCESS; +} +