Zoltan 2 Version 0.5
BasicIdentifierInput.cpp
Go to the documentation of this file.
00001 // @HEADER
00002 //
00003 // ***********************************************************************
00004 //
00005 //   Zoltan2: A package of combinatorial algorithms for scientific computing
00006 //                  Copyright 2012 Sandia Corporation
00007 //
00008 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
00009 // the U.S. Government retains certain rights in this software.
00010 //
00011 // Redistribution and use in source and binary forms, with or without
00012 // modification, are permitted provided that the following conditions are
00013 // met:
00014 //
00015 // 1. Redistributions of source code must retain the above copyright
00016 // notice, this list of conditions and the following disclaimer.
00017 //
00018 // 2. Redistributions in binary form must reproduce the above copyright
00019 // notice, this list of conditions and the following disclaimer in the
00020 // documentation and/or other materials provided with the distribution.
00021 //
00022 // 3. Neither the name of the Corporation nor the names of the
00023 // contributors may be used to endorse or promote products derived from
00024 // this software without specific prior written permission.
00025 //
00026 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00027 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00028 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00029 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00030 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00031 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00032 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00033 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00034 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00035 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00036 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00037 //
00038 // Questions? Contact Karen Devine      (kddevin@sandia.gov)
00039 //                    Erik Boman        (egboman@sandia.gov)
00040 //                    Siva Rajamanickam (srajama@sandia.gov)
00041 //
00042 // ***********************************************************************
00043 //
00044 // @HEADER
00045 //
00046 // Basic testing of Zoltan2::BasicIdentifierInput 
00047 
00048 #include <Zoltan2_BasicIdentifierInput.hpp>
00049 #include <Zoltan2_TestHelpers.hpp>
00050 
00051 #include <Teuchos_GlobalMPISession.hpp>
00052 #include <Teuchos_DefaultComm.hpp>
00053 #include <Teuchos_RCP.hpp>
00054 #include <Teuchos_CommHelpers.hpp>
00055 
00056 using Teuchos::RCP;
00057 using Teuchos::Comm;
00058 using Teuchos::DefaultComm;
00059 
00060 int main(int argc, char *argv[])
00061 {
00062   Teuchos::GlobalMPISession session(&argc, &argv);
00063   RCP<const Comm<int> > comm = DefaultComm<int>::getComm();
00064   int rank = comm->getRank();
00065   int nprocs = comm->getSize();
00066   int fail = 0, gfail=0;
00067 
00068   // Create global identifiers with weights
00069 
00070   lno_t numLocalIds = 10;
00071   int weightDim = 2;
00072 
00073   gno_t *myIds = new gno_t [numLocalIds];
00074   scalar_t *weights = new scalar_t [numLocalIds*weightDim];
00075   gno_t base = rank * numLocalIds * numLocalIds;
00076 
00077   for (lno_t i=0; i < numLocalIds; i++){
00078     myIds[i] = base+i;
00079     weights[i*weightDim] = 1.0;
00080     weights[i*weightDim + 1] = (nprocs-rank) / (i+1);
00081   }
00082 
00083   // Create a Zoltan2::BasicIdentifierInput object
00084   // and verify that it is correct
00085 
00086   typedef Zoltan2::BasicUserTypes<scalar_t, gno_t, lno_t, gno_t> userTypes_t;
00087   std::vector<const scalar_t *> weightValues;
00088   std::vector<int> strides;
00089 
00090   weightValues.push_back(weights);
00091   weightValues.push_back(weights + 1);
00092   strides.push_back(2);
00093   strides.push_back(2);
00094 
00095   Zoltan2::BasicIdentifierInput<userTypes_t> ia( numLocalIds, myIds,
00096     weightValues, strides);
00097 
00098   if (rank == 0)
00099     std::cout << "Testing " << ia.inputAdapterName() << std::endl;
00100 
00101   if (!fail && ia.getLocalNumberOfIdentifiers() != size_t(numLocalIds)){
00102     fail = 4;
00103   }
00104 
00105   if (!fail && ia.getNumberOfWeights() != weightDim)
00106     fail = 5;
00107 
00108   const gno_t *globalIdsIn;
00109   scalar_t const *weightsIn[2];
00110   int weightStridesIn[2];
00111 
00112   if (!fail && ia.getIdentifierList(globalIdsIn) != size_t(numLocalIds))
00113     fail = 6;
00114 
00115   for (int w=0; !fail && w < weightDim; w++){
00116     if (ia.getIdentifierWeights(w, weightsIn[w], weightStridesIn[w]) <
00117         size_t(numLocalIds * weightStridesIn[w]))
00118       fail = 20;
00119   }
00120 
00121   const scalar_t *w1 = weightsIn[0];
00122   const scalar_t *w2 = weightsIn[1];
00123   int incr1 = weightStridesIn[0];
00124   int incr2 = weightStridesIn[1];
00125 
00126   for (lno_t i=0; !fail && i < numLocalIds; i++){
00127 
00128     if (globalIdsIn[i] != base+i)
00129       fail = 8;
00130     
00131     if (!fail && w1[i*incr1] != 1.0)
00132       fail = 9;
00133     
00134     if (!fail && w2[i*incr2] != weights[i*weightDim+1])
00135       fail = 10;
00136   }
00137 
00138   delete [] myIds;
00139   delete [] weights;
00140 
00141   gfail = globalFail(comm, fail);
00142   if (gfail)
00143     printFailureCode(comm, fail);   // will exit(1)
00144 
00145   if (rank == 0)
00146     std::cout << "PASS" << std::endl;
00147 }
00148