Isorropia_TpetraQueryObject.hpp

Go to the documentation of this file.

//@HEADER
// ***********************************************************************
//
//            Isorropia: Partitioning and Load Balancing Package
//              Copyright (2006) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//
// This library 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
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
//
// ***********************************************************************
//@HEADER

#ifndef ISORROPIA_TPETRA_ZOLTAN_QUERYOBJECT_H
#define ISORROPIA_TPETRA_ZOLTAN_QUERYOBJECT_H

#include "Isorropia_ConfigDefs.hpp"

#include <Teuchos_RCP.hpp>

#include <zoltan_cpp.h>

#include <set>
#include <map>


#include <Kokkos_DefaultNode.hpp>
#include <Tpetra_CrsGraph_decl.hpp>
#include <Tpetra_RowMatrix.hpp>
#include <Tpetra_MultiVector_decl.hpp>

#include <Isorropia_TpetraCostDescriber.hpp>

namespace Isorropia {

namespace Tpetra {



namespace ZoltanLib {

template <typename Node = Kokkos::DefaultNode::DefaultNodeType >
class QueryObject 
{

  const bool haveGraph_;

  Teuchos::RCP<const ::Tpetra::CrsGraph<int,int,Node> > graph_;

  Teuchos::RCP<const ::Tpetra::RowMatrix<double,int,int,Node> > matrix_;

  Teuchos::RCP<const ::Tpetra::MultiVector<double,int,int,Node> > coords_;

  const ::Tpetra::Map<int,int,Node> *rowMap_;

  const ::Tpetra::Map<int,int,Node> *colMap_;

  Teuchos::RCP<const Isorropia::Tpetra::CostDescriber<Node> > costs_;

  Teuchos::RCP<const ::Tpetra::MultiVector<double,int,int,Node> > weights_;

  std::map<int,int> procmap_;
  std::set<int> graph_self_edges_;

  int myProc_;
  int base_;

  void fill_procmap();

  int My_Number_Objects(int *ierr);

  void My_Object_List  (int num_gid_entries, int num_lid_entries,
         ZOLTAN_ID_PTR global_ids, ZOLTAN_ID_PTR local_ids,
         int weight_dim, float * object_weights, int * ierr );

  void My_Number_Edges_Multi  (int num_gid_entries, int num_lid_entries,
         int num_obj, ZOLTAN_ID_PTR global_ids, ZOLTAN_ID_PTR local_ids,
         int *num_edges, int * ierr );

  void My_Edge_List_Multi(int num_gid_entries, int num_lid_entries,
         int num_obj, ZOLTAN_ID_PTR global_ids, ZOLTAN_ID_PTR local_ids,
         int *num_edges, ZOLTAN_ID_PTR neighbor_global_ids, int * neighbor_procs,
         int weight_dim, float * edge_weights, int * ierr );

  void My_HG_Size_CS (int* num_lists, int* num_pins, int* format,
        int * ierr );

  void My_HG_CS (int num_gid_entries, int num_row_or_col, int num_pins,
     int format, ZOLTAN_ID_PTR vtxedge_GID, int* vtxedge_ptr, ZOLTAN_ID_PTR pin_GID,
               int * ierr );


  void My_FGHG_CS (int num_gid_entries, int num_row_or_col, int num_pins,
     int format, ZOLTAN_ID_PTR vtxedge_GID, int* vtxedge_ptr, ZOLTAN_ID_PTR pin_GID,
               int * ierr );

  void My_HG_Size_Edge_Weights(int* num_edges, int* ierr);
  
  void My_HG_Edge_Weights(int num_gid_entries, int num_lid_entries, int num_edges, int edge_weight_dim,
        ZOLTAN_ID_PTR edge_GID, ZOLTAN_ID_PTR edge_LID, float* edge_weights, int* ierr);

  int My_Number_Geom(int *ierr);

  void My_Geom_Multi(int num_gid_entries, int num_lid_entries,
        int num_obj, ZOLTAN_ID_PTR gids, ZOLTAN_ID_PTR lids, int num_dim,
        double *geom_vec, int *ierr);

 public:

  QueryObject( Teuchos::RCP<const ::Tpetra::CrsGraph<int,int,Node> > graph,
         Teuchos::RCP<const Isorropia::Tpetra::CostDescriber<Node> > costs,
         int inputType);


  QueryObject( Teuchos::RCP<const ::Tpetra::RowMatrix<double,int,int,Node> > matrix,
         Teuchos::RCP<const Isorropia::Tpetra::CostDescriber<Node> > costs,
         int inputType);

  QueryObject( Teuchos::RCP<const ::Tpetra::MultiVector<double,int,int,Node> > coords,
               Teuchos::RCP<const ::Tpetra::MultiVector<double,int,int,Node> > weights);


  QueryObject(Teuchos::RCP<const ::Tpetra::CrsGraph<int,int,Node> > graph,
        Teuchos::RCP<const Isorropia::Tpetra::CostDescriber<Node> > costs, 
              Teuchos::RCP<const ::Tpetra::MultiVector<double,int,int,Node> > coords,
              Teuchos::RCP<const ::Tpetra::MultiVector<double,int,int,Node> > weights,
              int inputType);


  QueryObject(Teuchos::RCP<const ::Tpetra::RowMatrix<double,int,int,Node> > matrix,
        Teuchos::RCP<const Isorropia::Tpetra::CostDescriber<Node> > costs,
              Teuchos::RCP<const ::Tpetra::MultiVector<double,int,int,Node> > coords,
              Teuchos::RCP<const ::Tpetra::MultiVector<double,int,int,Node> > weights,
              int inputType);


  QueryObject( Teuchos::RCP<const ::Tpetra::Map<int,int,Node> > inputMap,
         int inputType);




  virtual ~QueryObject();

  static const int hgraph_input_ = 1;

  static const int hgraph2d_finegrain_input_ = 2;

  static const int graph_input_ = 3;

  static const int geometric_input_ = 4;

  static const int hgraph_graph_input_ = 5;

  static const int hgraph_geometric_input_ = 6;

  static const int graph_geometric_input_ = 7;

  static const int hgraph_graph_geometric_input_ = 8;

  static const int simple_input_ = 9;


  static const int unspecified_input_ = 10;



  int input_type_;

  const ::Tpetra::Map<int,int,Node> &RowMap(void){ return *rowMap_;};

  bool haveVertexWeights();

  bool haveGraphEdgeWeights();

  bool haveHypergraphEdgeWeights();

  // General query functions

  static int Number_Objects(void *data, int *ierr);
  
  static void Object_List  ( void * data, int num_gid_entries, int num_lid_entries,
         ZOLTAN_ID_PTR global_ids, ZOLTAN_ID_PTR local_ids,
         int weight_dim, float * object_weights, int * ierr );

  // Query functions for graph partitioning only
  
  static void Number_Edges_Multi  ( void * data, int num_gid_entries, int num_lid_entries,
         int num_obj, ZOLTAN_ID_PTR global_ids, ZOLTAN_ID_PTR local_ids,
         int *num_edges, int * ierr );

  static void Edge_List_Multi( void * data, int num_gid_entries, int num_lid_entries,
         int num_obj, ZOLTAN_ID_PTR global_ids, ZOLTAN_ID_PTR local_ids,
         int *num_edges, ZOLTAN_ID_PTR neighbor_global_ids, int * neighbor_procs,
         int weight_dim, float * edge_weights, int * ierr );

  // Query functions for hypergraph partitioning only
  
  static void HG_Size_CS ( void * data, int* num_lists, int* num_pins, int* format,
        int * ierr );
  static void HG_CS ( void * data, int num_gid_entries, int num_row_or_col, int num_pins,
     int format, ZOLTAN_ID_PTR vtxedge_GID, int* vtxedge_ptr, ZOLTAN_ID_PTR pin_GID,
               int * ierr );
  static void HG_Size_Edge_Weights(void * data, int* num_edges, int* ierr);
  
  static void HG_Edge_Weights(void * data,
        int num_gid_entries, int num_lid_entries, int num_edges, int edge_weight_dim,
        ZOLTAN_ID_PTR edge_GID, ZOLTAN_ID_PTR edge_LID, float* edge_weights, int* ierr);

  static int Number_Geom(void *data, int *ierr);

  static void Geom_Multi(void *data, int num_gid_entries, int num_lid_entries,
        int num_obj, ZOLTAN_ID_PTR gids, ZOLTAN_ID_PTR lids, int num_dim,
        double *geom_vec, int *ierr);


  //M.M.W. need to add hierarchical query functions

};

} //namespace ZoltanLib
} //namespace Tpetra
} //namespace Isorropia

#endif //ISORROPIA_TPETRA_ZOLTAN_QUERYOBJECT_H