smooth.h

#ifndef __SMOOTH_H
#define __SMOOTH_H
/*
 * structure for the priority queue.  Also contains information for
 * smooth calculation.
 */
#include <queue>
#include "Compute.h"
#include "State.h"

class pqSmoothNode
{
 public:
    double fKey;    // distance^2 -> place in priority queue
    Vector3D<double> dx; // displacement of this particle
    GravityParticle *p; // pointer to rest of particle data
    
    inline bool operator<(const pqSmoothNode& n) const {
    return fKey < n.fKey;
    }
    };
 
    
 
class NearNeighborState: public State {
public:
    CkVec<pqSmoothNode> *Qs; 
    int nParticlesPending;
    int mynParts; 
    bool started;
    
    NearNeighborState(int nParts, int nSmooth) {
        Qs = new CkVec<pqSmoothNode>[nParts+2];
    mynParts = nParts; 
        }
 
    void finishBucketSmooth(int iBucket, TreePiece *tp);
    ~NearNeighborState() {
    delete [] Qs; 
        }
};
 
#include "smoothparams.h"
 
// XXX so we can access the init function with the Cache unpack
// method.
 
extern SmoothParams *globalSmoothParams;

class DensitySmoothParams : public SmoothParams
{
    virtual void fcnSmooth(GravityParticle *p, int nSmooth,
               pqSmoothNode *nList);
    virtual int isSmoothActive(GravityParticle *p);
    virtual void initSmoothParticle(GravityParticle *p);
    virtual void initTreeParticle(GravityParticle *p) {}
    virtual void postTreeParticle(GravityParticle *p) {}
    virtual void initSmoothCache(GravityParticle *p);
    virtual void combSmoothCache(GravityParticle *p1,
                 ExternalSmoothParticle *p2);
 public:
    DensitySmoothParams() {}
    DensitySmoothParams(int _iType, int am) {
    iType = _iType;
    activeRung = am;
    }
    PUPable_decl(DensitySmoothParams);
    DensitySmoothParams(CkMigrateMessage *m) : SmoothParams(m) {}
    virtual void pup(PUP::er &p) {
        SmoothParams::pup(p);//Call base class
    }
    };

class SmoothCompute : public Compute
{
 protected:
    TreePiece *tp;
 
 public:
    SmoothParams *params;
 
    SmoothCompute(TreePiece *_tp, SmoothParams *_params) : Compute(Smooth){
    params = _params;
    // XXX Assign to global pointer: not thread safe
    globalSmoothParams = params;
        tp = _tp;       // needed in getNewState()
    params->tp = tp;
    }
    ~SmoothCompute() { //delete state;
      // delete params;
    }
 
    virtual 
      void bucketCompare(TreePiece *tp,
             GravityParticle *p,  // Particle to test
             GenericTreeNode *node, // bucket
             GravityParticle *particles, // local particle data
             Vector3D<double> offset,
             State *state
             ) = 0;
 
    int doWork(GenericTreeNode *node,
           TreeWalk *tw,
           State *state,
           int chunk,
           int reqID,
           bool isRoot, 
           bool &didcomp, int awi);
    void reassoc(void *ce, int ar, Opt *o);    
    void nodeMissedEvent(int reqID, int chunk, State *state, TreePiece *tp);
    
 
 
};

class KNearestSmoothCompute : public SmoothCompute 
{
    int nSmooth;
    // limit small smoothing lengths
    int iLowhFix;
    // smoothing to gravitational softening ratio limit
    double dfBall2OverSoft2;
    
public:
    
    KNearestSmoothCompute(TreePiece *_tp, SmoothParams *_params, int nSm,
              int iLhF, double dfB2OS2)
       : SmoothCompute(_tp, _params){
         nSmooth = nSm;
     iLowhFix = iLhF;
     dfBall2OverSoft2 = dfB2OS2;
         }
    ~KNearestSmoothCompute() { //delete state;
    delete params;
    }
 
    void bucketCompare(TreePiece *tp,
               GravityParticle *p,  // Particle to test
               GenericTreeNode *node, // bucket
               GravityParticle *particles, // local particle data
               Vector3D<double> offset,
                       State *state
               ) ;
        
    void initSmoothPrioQueue(int iBucket, State *state) ;
    int openCriterion(TreePiece *ownerTP, GenericTreeNode *node, int reqID, State *state);
    void startNodeProcessEvent(State *state){ }
    void finishNodeProcessEvent(TreePiece *owner, State *state){ }
    void nodeRecvdEvent(TreePiece *owner, int chunk, State *state, int bucket);
    void recvdParticlesFull(GravityParticle *egp,int num,int chunk,
            int reqID,State *state, TreePiece *tp,
            Tree::NodeKey &remoteBucket);
    void walkDone(State *state) ;
 
    // this function is used to allocate and initialize a new state object
    // these operations were earlier carried out in the constructor of the
    // class.
    State *getNewState(int d1);
    // Unused.
    State *getNewState(int d1, int d2) {return 0;}
    State *getNewState() {return 0;}
    };

 
class ReNearNeighborState: public State {
public:
    CkVec<pqSmoothNode> *Qs;
    int nParticlesPending;
    bool started;
    ReNearNeighborState(int nParts) {
    Qs = new CkVec<pqSmoothNode>[nParts+2];
    }
    void finishBucketSmooth(int iBucket, TreePiece *tp);
    ~ReNearNeighborState() { delete [] Qs; }
};

class ReSmoothCompute : public SmoothCompute 
{
    
public:
    ReSmoothCompute(TreePiece *_tp, SmoothParams *_params) : SmoothCompute(_tp, _params){}
 
    ~ReSmoothCompute() { //delete state;
    delete params;
    }
 
    void bucketCompare(TreePiece *tp,
               GravityParticle *p,  // Particle to test
               GenericTreeNode *node, // bucket
               GravityParticle *particles, // local particle data
               Vector3D<double> offset,
                       State *state
               ) ;
        
    int openCriterion(TreePiece *ownerTP, GenericTreeNode *node, int reqID, State *state);
    void startNodeProcessEvent(State *state){ }
    void finishNodeProcessEvent(TreePiece *owner, State *state){ }
    void nodeRecvdEvent(TreePiece *owner, int chunk, State *state, int bucket);
    void recvdParticlesFull(GravityParticle *egp,int num,int chunk,
            int reqID,State *state, TreePiece *tp,
            Tree::NodeKey &remoteBucket);
    void walkDone(State *state) ;
 
    // this function is used to allocate and initialize a new state object
    // these operations were earlier carried out in the constructor of the
    // class.
    State *getNewState(int d1);
    State *getNewState(int d1, int d2) {return 0;}
    State *getNewState() {return 0;}
    };

class MarkSmoothCompute : public SmoothCompute 
{
    
public:
    MarkSmoothCompute(TreePiece *_tp, SmoothParams *_params) : SmoothCompute(_tp, _params){}
 
    ~MarkSmoothCompute() { //delete state;
    delete params;
    }
 
    void bucketCompare(TreePiece *tp,
               GravityParticle *p,  // Particle to test
               GenericTreeNode *node, // bucket
               GravityParticle *particles, // local particle data
               Vector3D<double> offset,
                       State *state
               ) ;
        
    int openCriterion(TreePiece *ownerTP, GenericTreeNode *node, int reqID, State *state);
    void startNodeProcessEvent(State *state){ }
    void finishNodeProcessEvent(TreePiece *owner, State *state){ }
    void nodeRecvdEvent(TreePiece *owner, int chunk, State *state, int bucket);
    void recvdParticlesFull(GravityParticle *egp,int num,int chunk,
            int reqID,State *state, TreePiece *tp,
            Tree::NodeKey &remoteBucket);
    void walkDone(State *state) ;
 
    // this function is used to allocate and initialize a new state object
    // these operations were earlier carried out in the constructor of the
    // class.
    State *getNewState(int d1, int d2) {return 0;}
    State *getNewState(int d1);
    State *getNewState() {return 0;}
    };

 
class MarkNeighborState: public State {
public:
    int nParticlesPending;
    bool started;
    MarkNeighborState(int nParts) {}
    void finishBucketSmooth(int iBucket, TreePiece *tp);
    ~MarkNeighborState() {}
};
 
#include "Opt.h"

class SmoothOpt : public Opt{
  public:
  SmoothOpt() : Opt(Local){
    // don't need to open
    // these nodes are your concern
    action_array[0][Internal] = DUMP;
    action_array[0][Bucket] = DUMP;
 
    action_array[0][Boundary] = DUMP; 
    action_array[0][NonLocal] = DUMP; 
    action_array[0][NonLocalBucket] = DUMP; 
    action_array[0][Cached] = DUMP; 
    action_array[0][CachedBucket] = DUMP;
 
    action_array[0][Empty] = DUMP;
    action_array[0][CachedEmpty] = DUMP;
    action_array[0][Top] = ERROR;
    action_array[0][Invalid] = ERROR;
    //--------------
    // need to open node
    // local data
    action_array[1][Internal] = KEEP;
    action_array[1][Bucket] = KEEP_LOCAL_BUCKET;
    action_array[1][Boundary] = KEEP;
 
    // remote data
    action_array[1][NonLocal] = KEEP;
    action_array[1][NonLocalBucket] = KEEP_REMOTE_BUCKET;
    action_array[1][CachedBucket] = KEEP_REMOTE_BUCKET;
    action_array[1][Cached] = KEEP;
 
    // discard
    action_array[1][Empty] = DUMP;
    action_array[1][CachedEmpty] = DUMP;
    action_array[1][Top] = ERROR;
    action_array[1][Invalid] = ERROR;
  }
 
};
 
/* return 1/(h_smooth)^2 for a particle */
inline
double invH2(GravityParticle *p) 
{
    return 4.0/(p->fBall*p->fBall);
    }

inline double kernelWendland(double ar2, int nSmooth)
{    
    double ak;
    if (nSmooth < 32)
    {
        ak = 2.0 - sqrt(ar2);
        if (ar2 < 1.0) ak = (1.0 - 0.75*ak*ar2);
        else ak = 0.25*ak*ak*ak;
        return ak;
    }
    if (ar2 <= 0) ak = (495/32./8.)*(1-0.01342*pow(nSmooth*0.01,-1.579));/* Dehnen & Aly 2012 correction */ 
    else {                              
        double au = sqrt(ar2*0.25);                 
        ak = 1-au;                          
        ak = ak*ak*ak;                          
        ak = ak*ak;                         
        ak = (495/32./8.)*ak*(1+6*au+(35/3.)*au*au); 
        }                               
    return ak;
    }
inline double dkernelWendland(double ar2)
{
    double adk;
    double _a2,au = sqrt(ar2*0.25);                     
    adk = 1-au;                                         
    _a2 = adk*adk;                                      
    adk = (-495/32.*7./3./4.)*_a2*_a2*adk*(1+5*au);        
    return adk;
    }

inline double kernelM6(double ar2) {
    double r = 0.5 * sqrt(ar2);
    double w;
    // Sanity checks
    CkAssert(r >= 0.0);
    CkAssert(r <= 1.0000001);
    w = pow(1. - r, 5);
    if (r < 2./3.) {
        w += -6. * pow(2./3. - r, 5);
        if (r < 1./3.) {
            w += 15. * pow(1./3. - r, 5);
        }
    }
    return 6.834375 * w;
}

inline double dkernelM6(double ar2) {
    double r = 0.5 * sqrt(ar2);
    double dw = 0.0;
    // Sanity checks
    CkAssert(r >= 0.0);
    CkAssert(r <= 1.0000001);
    dw = -5. *  pow(1. - r, 4);
    if (r < 2./3.) {
        dw += 30. * pow(2./3. - r, 4);
        if (r < 1./3.) {
            if (r == 0.) {
                dw = 0.0;
                r = 1.;
            } else {
                dw += -75. * pow(1./3. - r, 4);
            }
        }
    }
    dw /= r;
    // Normalize by 3^7/(32*40)
    dw *= 1.70859375;
    return dw;
}
 
/* Standard M_4 Kernel */
inline double kernelM4(double ar2)
{
    double ak;
    ak = 2.0 - sqrt(ar2);
    if (ar2 < 1.0) ak = (1.0 - 0.75*ak*ar2);
    else ak = 0.25*ak*ak*ak;
    return ak;
    }
inline double dkernelM4(double ar2)
{
    double adk;
    adk = sqrt(ar2);
    if (ar2 < 1.0) {
    adk = -3 + 2.25*adk;
    }
    else {
    adk = -0.75*(2.0-adk)*(2.0-adk)/adk;
    }
    return adk;
    }

inline double KERNEL(double ar2, int nSmooth) {
#if WENDLAND == 1
    return kernelWendland(ar2, nSmooth);
#elif M6KERNEL == 1
    return kernelM6(ar2);
#elif M4KERNEL == 1
    return kernelM4(ar2);
#else
    #error No available kernel selected.
#endif //KERNEL
}

inline double DKERNEL(double ar2) {
#if WENDLAND == 1
    return dkernelWendland(ar2);
#elif M6KERNEL == 1
    return dkernelM6(ar2);
#elif M4KERNEL == 1
    return dkernelM4(ar2);
#else
    #error No available kernel selected.
#endif //KERNEL
}
#endif