Home Research Papers Posters Manuals Talks Download People Help Internal

libs/ck-libs/fem/fem_adapt.h

Go to the documentation of this file.

/* File: fem_adapt.h
 * Authors: Terry Wilmarth, Nilesh Choudhury
 *
 */


#ifndef __CHARM_FEM_ADAPT_H
#define __CHARM_FEM_ADAPT_H

#include "charm-api.h"
#include "ckvector3d.h"
#include "fem.h"
#include "fem_mesh.h"

class FEM_Adapt {
  FEM_Mesh *theMesh;
  int cid;  
  FEM_DataAttribute *nodeValid, *elemValid;
  FEM_DataAttribute *validDataFor(int entityNumber);

  // Helper methods: see bottom of this file

  int check_orientation(int e1, int e3, int n, int n1, int n2);

  void adj_traverse(int n, int startNode, int stopNode, int startElem, 
            int stopElem, int *nn, int *ne, int *nodeList,
            int *elemList);
  int newSlot(FEM_DataAttribute *validData);
  void invalidateSlot(FEM_DataAttribute *validData,int slotNumber);
  void printValidArray(FEM_DataAttribute *validData);
 public:

  int get_edge_index(int local_node1, int local_node2);

  int find_local_node_index(int e, int n);
  void findAdjData(int n1, int n2, int *e1, int *e2, int *en1, int *en2, 
           int *en3, int *n3, int *edge, int *nbr);
  void findAdjData(int n1, int n2, int e2, int *en1, int *en2, int *en3, 
           int *n4, int *edge, int *nbr);

  FEM_Adapt(FEM_Mesh *m) {
    cid = -1;
    theMesh = m;
    nodeValid = validDataFor(FEM_NODE);
    elemValid = validDataFor(FEM_ELEM);
  }
  FEM_Adapt(FEM_Mesh *m, int chunkId) {
    cid = chunkId;
    theMesh = m;
    nodeValid = validDataFor(FEM_NODE);
    elemValid = validDataFor(FEM_ELEM);
  }

  virtual int edge_flip(int n1, int n2);
  virtual int edge_flip_help(int e1, int e2, int n1, int n2, int e1_n1, 
                 int e1_n2, int e1_n3, int n3, int edge1, 
                 int e1nbr);
  

  virtual int edge_bisect(int n1, int n2);
  virtual int edge_bisect_help(int e1, int e2, int n1, int n2, int e1_n1, 
                   int e1_n2, int e1_n3, int n3, int edge1, 
                   int e1nbr);
  void localEdgeBisect(int n1, int n2, int e1, int e2, int e3, int e1n1, 
               int e1n2, int e1n3, int e1nbr, int n3, int n5);


  virtual int vertex_remove(int n1, int n2);
  virtual int vertex_remove_help(int e1, int e2, int n1, int n2, int e1_n1,
                 int e1_n2, int e1_n3, int n3, int edge1, 
                 int e1nbr);


  virtual int edge_contraction(int n1, int n2);
  virtual int edge_contraction(int e1, int n1, int n2);
  virtual int edge_contraction_help(int e1, int e2, int n1, int n2, int e1_n1,
                    int e1_n2);


  virtual int vertex_split(int n, int n1, int n2);
  virtual int vertex_split(int n, int n1, int n2, int e1, int e3);
  
  // SINCE THIS USES THE MARKED VERTEX BISECTION ALGORITHM, IT IS A SPECIAL
  // PURPOSE METHOD FOR CPSD.  THIS SHOULD MOVE UP INTO THE CPSD INTERFACE
  // AS SHOULD THE MARKING OPERATIONS IN FEM_Mesh.


  int newNode();
  int newElement();
  void deleteNode(int n);
  void deleteElement(int e); 





  void addSharedNodeInstance(int n, int someIdx, int someChunk) {}
  void removeSharedNodeInstance(int n, int someIdx, int someChunk) {}
  int lookupSharedNodeInstance(int someIdx, int someChunk) {return -1;}


  int newGhostNode() {return -1;}
  int newGhostNode(int remoteChunk, int remoteIdx) {return -1;}
  void updateGhostNode(int n, int remoteChunk, int remoteIdx) {}
  void deleteGhostNode(int n) {}
  int newGhostElement() {return -1;}
  int newGhostElement(int remoteChunk, int remoteIdx) {return -1;}
  void updateGhostElement(int e, int remoteChunk, int remoteIdx) {}
  void deleteGhostElement(int e) {}
  int getRemoteChunkID(int e) {return -1;}
  int getRemoteIndex(int e) {return -1;}

  int isSharedNode(int n) {return 0;}
  int isGhostNode(int n) {return 0;}
  int isGhostElement(int e) {return 0;}
  int getGhostNode(int remoteChunk, int remoteIdx) {return -1;}
  int getGhostElement(int remoteChunk, int remoteIdx) {return -1;}
};

#endif

---