Home Research Papers Posters Manuals Talks Download People Help Internal

libs/ck-libs/pose/cancel.h

Go to the documentation of this file.

#ifndef CANCEL_H
#define CANCEL_H

class CancelNode { 
 public:
  POSE_TimeType timestamp;   
  eventID evID;    
  CancelNode *next;
  CancelNode() : timestamp(POSE_UnsetTS), next(NULL) { }
  CancelNode(POSE_TimeType ts, eventID e) :timestamp (ts), evID (e), next(NULL){ }
  void dump() {
#if USE_LONG_TIMESTAMPS
    CkPrintf("[timestamp=%lld ", timestamp); evID.dump();  CkPrintf("] ");
#else
    CkPrintf("[timestamp=%d ", timestamp); evID.dump();  CkPrintf("] ");
#endif
  }
  void pup(PUP::er &p) { p(timestamp); evID.pup(p); }
};

class CancelList { 
  int count;

  POSE_TimeType earliest;        
  CancelNode *cancellations;
  CancelNode *current; 
 public:
  CancelList() :
    count (0), earliest(POSE_UnsetTS), cancellations(NULL), current(NULL) 
  {}

  void Insert(POSE_TimeType ts, eventID e) {
    CancelNode *newnode = new CancelNode(ts, e);
    count++;
    /*if (count%1000 == 0) 
      CkPrintf("WARNING: CancelList has %d events!\n", count); */
    if ((ts < earliest) || (earliest < 0)) // new event has earliest timestamp
      earliest = ts;
    newnode->next = cancellations; // place at front of list
    cancellations = newnode;
    if (!current) current = newnode; // set current if list was empty
  }    

  CancelNode *GetItem() {
    CancelNode *result;
    if (!current) 
      CkPrintf("ERROR: CancelList::GetItem: CancelList is empty\n");
    result = current;
    if (current->next) current = current->next;
    else current = cancellations;
    return result;
  }
  void RemoveItem(CancelNode *item);      
  inline int IsEmpty() { 
    CmiAssert(((count == 0) && (cancellations == NULL)) ||
          ((count > 0) && (cancellations != NULL)));
    return (count == 0);
  }    
  inline POSE_TimeType getEarliest() { return earliest; }
  void dump();               
  void pup(PUP::er &p);                   
};

#endif

---