QueryObject.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_EPETRA_ZOLTAN_QUERYOBJECT_H
#define ISORROPIA_EPETRA_ZOLTAN_QUERYOBJECT_H

#include "Isorropia_ConfigDefs.hpp"

#include <Teuchos_RCP.hpp>

#include <zoltan_cpp.h>

#include <set>
#include <map>

class Epetra_BlockMap;
class Epetra_CrsGraph;
class Epetra_RowMatrix;

namespace Isorropia {

namespace Epetra {

  class CostDescriber;

namespace ZoltanLib {

class QueryObject
{
  Teuchos::RCP<const Epetra_CrsGraph> graph_;
  Teuchos::RCP<const Epetra_RowMatrix> matrix_;
  const Epetra_BlockMap *rowMap_;
  const Epetra_BlockMap *colMap_;

  Teuchos::RCP<const Isorropia::Epetra::CostDescriber> costs_;

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

  const bool isHypergraph_;
  const bool haveGraph_;
  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_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);

 public:

  QueryObject( Teuchos::RCP<const Epetra_CrsGraph> graph,
         Teuchos::RCP<const Isorropia::Epetra::CostDescriber> costs,
               bool isHypergraph);


  QueryObject( Teuchos::RCP<const Epetra_RowMatrix> matrix,
         Teuchos::RCP<const Isorropia::Epetra::CostDescriber> costs,
               bool isHypergraph);

  virtual ~QueryObject();

  const Epetra_BlockMap &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);

};

} //namespace ZoltanLib
} //namespace Epetra
} //namespace Isorropia

#endif //ISORROPIA_EPETRA_ZOLTAN_QUERYOBJECT_H