testFmmAdaptiveAlgorithmAdvanced.cpp 9.19 KB
Newer Older
1
// ===================================================================================
2
// Copyright ScalFmm 2011 INRIA, Olivier Coulaud, Berenger Bramas
3 4 5 6 7 8 9 10 11 12 13 14 15 16
// olivier.coulaud@inria.fr, berenger.bramas@inria.fr
// This software is a computer program whose purpose is to compute the FMM.
//
// This software is governed by the CeCILL-C and LGPL licenses and
// abiding by the rules of distribution of free software.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public and CeCILL-C Licenses for more details.
// "http://www.cecill.info".
// "http://www.gnu.org/licenses".
// ===================================================================================

17 18
// Keep in private GIT
// @SCALFMM_PRIVATE
19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
#include <iostream>
#include <cstdio>


#include "../../Src/Utils/FParameters.hpp"
#include "../../Src/Utils/FTic.hpp"

#include "../../Src/Containers/FOctree.hpp"
#include "../../Src/Containers/FVector.hpp"

#include "../../Src/Components/FSimpleLeaf.hpp"

#include "../../Src/Utils/FPoint.hpp"

#include "../../Src/Components/FTestParticleContainer.hpp"
#include "../../Src/Components/FTestCell.hpp"
#include "../../Src/Components/FTestKernels.hpp"

#include "../../Src/Core/FFmmAlgorithm.hpp"
#include "../../Src/Core/FFmmAlgorithmThread.hpp"
#include "../../Src/Core/FFmmAlgorithmTask.hpp"

#include "../../Src/Components/FBasicKernels.hpp"

#include "../../Src/Files/FRandomLoader.hpp"
44
#include "../../Src/Files/FFmaGenericLoader.hpp"
45

46 47 48
#include "../../Src/Adaptive/FAdaptiveCell.hpp"
#include "../../Src/Adaptive/FAdaptiveKernelWrapper.hpp"
#include "../../Src/Adaptive/FAbstractAdaptiveKernel.hpp"
49
#include "../../Src/Adaptive/FAdaptiveTestKernel.hpp"
50

51 52
#include "../../Src/Utils/FParameterNames.hpp"

53 54 55 56 57 58 59

/** This program show an example of use of the fmm basic algo
  * it also check that each particles is impacted each other particles
  */

// Simply create particles and try the kernels
int main(int argc, char ** argv){
60
    const FParameterNames PrintTree =  { {"-print-trees"}, "Print the details of the trees."};
61 62 63
    FHelpDescribeAndExit(argc, argv,
                         "Test the adaptive FMM.",
                         FParameterDefinitions::NbParticles, FParameterDefinitions::OctreeHeight,
64
                         FParameterDefinitions::OctreeSubHeight,PrintTree);
65

66 67 68 69
    typedef FTestCell                   CellClass;
    typedef FTestParticleContainer      ContainerClass;
    typedef FSimpleLeaf< ContainerClass >                     LeafClass;
    typedef FAdaptiveTestKernel< CellClass, ContainerClass >         KernelClass;
70 71
    typedef FAdaptiveCell< CellClass, ContainerClass >         CellWrapperClass;
    typedef FAdaptiveKernelWrapper< KernelClass, CellClass, ContainerClass >         KernelWrapperClass;
72 73 74
    typedef FOctree< CellWrapperClass, ContainerClass , LeafClass >  OctreeClass;
    typedef FFmmAlgorithm<OctreeClass, CellWrapperClass, ContainerClass, KernelWrapperClass, LeafClass >     FmmClass;

75 76 77 78 79 80 81
    typedef FTestCell                   CellClassTest;
    typedef FTestParticleContainer      ContainerClassTest;
    typedef FSimpleLeaf< ContainerClassTest >                     LeafClassTest;
    typedef FOctree< CellClassTest, ContainerClassTest , LeafClassTest >  OctreeClassTest;
    typedef FTestKernels< CellClassTest, ContainerClassTest >         KernelClassTest;
    typedef FFmmAlgorithm<OctreeClassTest, CellClass, ContainerClassTest, KernelClassTest, LeafClassTest >     FmmClassTest;

82 83 84 85
    ///////////////////////What we do/////////////////////////////
    std::cout << ">> This executable has to be used to test the FMM algorithm.\n";
    //////////////////////////////////////////////////////////////

86 87
    const int NbLevels      = FParameters::getValue(argc,argv,FParameterDefinitions::OctreeHeight.options, 7);
    const int SizeSubLevels = FParameters::getValue(argc,argv,FParameterDefinitions::OctreeSubHeight.options, 3);
88 89 90 91 92
    FTic counter;

    //////////////////////////////////////////////////////////////////////////////////
    //////////////////////////////////////////////////////////////////////////////////

93 94
    //FRandomLoader loader(FParameters::getValue(argc,argv,FParameterDefinitions::NbParticles.options, 2000000), 1, FPoint(0.5,0.5,0.5), 1);
    FFmaGenericLoader loader(FParameters::getStr(argc,argv,FParameterDefinitions::InputFile.options,"../Data/noDist/prolate50-ref.fma"));
95
    OctreeClass tree(NbLevels, SizeSubLevels, loader.getBoxWidth(), loader.getCenterOfBox());
96
    OctreeClassTest treeTest(NbLevels, SizeSubLevels, loader.getBoxWidth(), loader.getCenterOfBox());
97 98 99 100

    //////////////////////////////////////////////////////////////////////////////////
    //////////////////////////////////////////////////////////////////////////////////

101
    std::cout << "Creating & Inserting " << loader.getNumberOfParticles() << " particles ..." << std::endl;
102 103 104 105 106 107
    std::cout << "\tHeight : " << NbLevels << " \t sub-height : " << SizeSubLevels << std::endl;
    counter.tic();

    {
        FPoint particlePosition;
        for(int idxPart = 0 ; idxPart < loader.getNumberOfParticles() ; ++idxPart){
108 109 110
            FReal pv;
            loader.fillParticle(&particlePosition, &pv);
            //loader.fillParticle(&particlePosition);
111
            tree.insert(particlePosition);
112
            treeTest.insert(particlePosition);
113 114 115 116 117 118 119 120 121 122 123 124
        }
    }

    counter.tac();
    std::cout << "Done  " << "(@Creating and Inserting Particles = " << counter.elapsed() << "s)." << std::endl;

    //////////////////////////////////////////////////////////////////////////////////
    //////////////////////////////////////////////////////////////////////////////////

    std::cout << "Working on particles ..." << std::endl;
    counter.tic();

125
    KernelWrapperClass kernels(4);            // FTestKernels FBasicKernels
126 127 128 129 130 131
    FmmClass algo(&tree,&kernels);  //FFmmAlgorithm FFmmAlgorithmThread
    algo.execute();

    counter.tac();
    std::cout << "Done  " << "(@Algorithm = " << counter.elapsed() << "s)." << std::endl;

132 133 134 135
    KernelClassTest kernelsTest;            // FTestKernels FBasicKernels
    FmmClassTest algoTest(&treeTest,&kernelsTest);  //FFmmAlgorithm FFmmAlgorithmThread
    algoTest.execute();

136 137 138 139 140 141
    //////////////////////////////////////////////////////////////////////////////////
    //////////////////////////////////////////////////////////////////////////////////

    tree.forEachCellLeaf([&](CellWrapperClass*, LeafClass* leaf){
        long long int*const particlesAttributes = leaf->getTargets()->getDataDown();
        for(int idxPart = 0 ; idxPart < leaf->getTargets()->getNbParticles() ; ++idxPart){
142
            if(particlesAttributes[idxPart] != (loader.getNumberOfParticles()-1)){
143
                std::cout << "Incorrect " << particlesAttributes[idxPart] << " instead of " << (loader.getNumberOfParticles()-1) << "\n";
144 145 146 147
            }
        }
    });

148 149 150 151 152 153 154 155 156 157 158 159 160 161 162

    //////////////////////////////////////////////////////////////////////////////////
    //////////////////////////////////////////////////////////////////////////////////

    tree.forEachCellWithLevel([&](CellWrapperClass* cell, int level){
        if(cell->hasDevelopment()){
            FAssertLF(cell->isAdaptive());
            CellClass* testcell = cell->getRealCell();
            FAssertLF(testcell);
            CellClassTest* testcelltest = treeTest.getCell(testcell->getMortonIndex(), level);
            FAssertLF(testcelltest);
            if(testcell->getDataUp() != testcelltest->getDataUp()){
                std::cout << "Error at index " << testcell->getMortonIndex() << " level " << level << " up is " << testcell->getDataUp()
                             << " should be " << testcelltest->getDataUp() << "\n";
            }
163 164 165 166
            if(testcell->getDataDown() != testcelltest->getDataDown()){
                std::cout << "Error at index " << testcell->getMortonIndex() << " level " << level << " up is " << testcell->getDataDown()
                             << " should be " << testcelltest->getDataDown() << "\n";
            }
167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199
        }
    });


    //////////////////////////////////////////////////////////////////////////////////
    //////////////////////////////////////////////////////////////////////////////////

    if(FParameters::existParameter(argc, argv, PrintTree.options)){
        int previousLevel = 0;
        tree.forEachCellWithLevel([&](CellWrapperClass* cell, int level){
            if(cell->hasDevelopment()){
                if(previousLevel != level){
                    previousLevel = level;
                    std::cout << "\n" << level << "] ";
                }
                FAssertLF(cell->isAdaptive());
                CellClass* testcell = cell->getRealCell();
                std::cout << "Idx:" << testcell->getMortonIndex() << " Up " << testcell->getDataUp() << "\t";
            }
        });
        std::cout << "\n";

        previousLevel = 0;
        treeTest.forEachCellWithLevel([&](CellClassTest* cell, int level){
            if(previousLevel != level){
                previousLevel = level;
                std::cout << "\n" << level << "] ";
            }
            std::cout << "Idx:" << cell->getMortonIndex() << " Up " << cell->getDataUp() << "\t";
        });
        std::cout << "\n";
    }

200 201 202 203 204 205
    return 0;
}