GridPoint.h

Go to the documentation of this file.

/*  @author János Végh (jvegh)
*  @bug No known bugs.
*/
#ifndef GRIDPOINT_H
#define GRIDPOINT_H
//#include <iostream>
#include <sstream>
#include "MemoryClustering.h"
using namespace std;
class scHThread;
 
 
class GridPoint
{
  public:
    // Arranged in a two-dimensional hexagonal grid; with the H HThread, 3 dimensional
    GridPoint(char xx=0,char yy=0, ClusterStatus CS=cs_NONE):X(xx),Y(yy){
          mClusterAddress.HThread = 0,
          mClusterAddress.Reserved = 0, //reserved
          mClusterAddress.Rack= 0,//Rack
          mClusterAddress.Topology= 0,//Topology (like Processor)
          mClusterAddress.Card= 0,//Card
          mClusterAddress.Cluster = MAX_CLUSTERS_LIMIT,//Cluster
          mClusterAddress.Member=cm_Head,//Member
          mClusterAddress.Proxy =cm_Head;//Proxy
          mClusterAddress.Status = CS;
//          mMyHThreads = 0;  // Initially, no HThreads are
        }
         virtual
    ~GridPoint(){}
 
        ClusterAddress_t 
    ClusterAddress_Get(void){ return mClusterAddress;}
        void 
    ClusterAddress_Set(ClusterAddress_t CA){ mClusterAddress = CA;}
        void 
    ClusterAddressHThread_Set(int H){ mClusterAddress.HThread = H;}
        ClusterStatus 
    ClusterStatus_Get(void){ return (ClusterStatus)mClusterAddress.Status;}
        void 
    ClusterStatus_Set(ClusterStatus CS){ mClusterAddress.Status = (int)CS;}
        int8_t X, 
               Y; 
        ClusterAddress_t
    mClusterAddress; 
        int
    YPosition_Get(void){ return Y*2 +moduloN(X,2); }
 
        bool
    IsNeighborOf(GridPoint* GP)
    {
        if(!(GP)) return false; // The candidate GridPoint is outside
         // Check N and S
        if( (X == GP->X) && (abs(YPosition_Get() - GP->YPosition_Get()) == 2)) return true;
        // Check NE, SE, SW, NW positions
        return( (abs(X - GP->X) == 1) && (abs(YPosition_Get() - GP->YPosition_Get()) == 1) );
    }
 
 
        bool
    Is2ndNeighborOf(GridPoint* GP)
    {
        if(!(GP)) return false; // The candidate GridPoint is outside
        // Both points are within the grid
        // Check N and S
        if( (abs(X - GP->X)== 0) && (abs(YPosition_Get() - GP->YPosition_Get()) == 4)) return true;
        // Check E and W
        if( (abs(X - GP->X)== 2) && (abs(YPosition_Get() - GP->YPosition_Get()) == 0)) return true;
        // Check NNE, SE, SW, NNW positions
        if( (abs(X - GP->X) == 1) && (abs(YPosition_Get() - GP->YPosition_Get()) == 3) ) return true;
        // Check NNE, SSE, SSW, NNW positions
        if( (abs(X - GP->X) == 2) && (abs(YPosition_Get() - GP->YPosition_Get()) == 2) ) return true;
        return false;
     }
 
       bool
    IsTheSameAs(GridPoint* GP)
    {
        if(!GP) return false;
        return this == GP;
    }
        bool
    IsInTheSameClusterAs(GridPoint* GP)
    {
        if(!GP) return false;
        return mClusterAddress.Cluster == GP->ClusterAddress_Get().Cluster;
    }
 
#if 0
 
       string
   StringOfProxy_Get(void
                     )
   {   ostringstream oss;
           ClusterAddress_t CA = ClusterAddress_Get();
        if(CA.Proxy) {oss << ":" << ClusterMembers[CA.Proxy].name;}
       return oss.str();
   }
#endif //0
 
       string
   StringOfThread_Get(
               )
   {   ostringstream oss;
          ClusterAddress_t CA = ClusterAddress_Get();
//       if(CA.HThread)
           oss << CA.HThread;
       return oss.str();
   }
      string
    StringOfClusterAddressName_Get(void)
    {
        ostringstream oss;
        oss << '{' << (int16_t)X << ',' << (int16_t)YPosition_Get() << '}' << '=';
        oss << "(" ;
        ClusterAddress_t CA = ClusterAddress_Get();
        oss << CA.Cluster << "." << ClusterMembers[CA.Member].name;
        if(CA.Proxy) {oss << ":" << ClusterMembers[CA.Proxy].name;}
//        oss << StringOfProxy_Get() << ")";
        if(CA.HThread) oss << '/' << StringOfThread_Get();
        return oss.str();
    }
 
};
 
#endif // GRIDPOINT_H