Home Research Papers Posters Manuals Talks Download People Help Internal

conv-core/queueing.h

Go to the documentation of this file.

#ifndef QUEUEING_H
#define QUEUEING_H
/*#define FASTQ*/

#ifdef __cplusplus
extern "C" {
#endif


extern int schedAdaptMemThresholdMB;

#ifndef CINTBITS
#define CINTBITS ((unsigned int) (sizeof(int)*8))
#endif
#ifndef CLONGBITS
#define CLONGBITS ((unsigned int) (sizeof(CmiInt8)*8))
#endif

typedef struct prio_struct
{
  unsigned short bits;
  unsigned short ints;
  unsigned int data[1];
}
*_prio;

typedef struct deq_struct
{
  /* Note: if head==tail, circ is empty */
  void **bgn; 
  void **end; 
  void **head; 
  void **tail; 
  void *space[4]; 
}
*_deq;

#ifndef FASTQ

typedef struct prioqelt_struct
{
  struct deq_struct data;
  struct prioqelt_struct *ht_next; 
  struct prioqelt_struct **ht_handle; 
  struct prio_struct pri;
}
*_prioqelt;
#else
typedef struct prioqelt_struct
{
  struct deq_struct data;
  struct prioqelt_struct *ht_left; 
  struct prioqelt_struct *ht_right; 
  struct prioqelt_struct *ht_parent; 
  struct prioqelt_struct **ht_handle; 
  struct prio_struct pri;
  /*  int deleted; */
}
*_prioqelt;
#endif
/*
#ifndef FASTQ
#define PRIOQ_TABSIZE 1017
#else */
#define PRIOQ_TABSIZE 1017
/*#endif */

/*#ifndef FASTQ*/
typedef struct prioq_struct
{
  int heapsize; 
  int heapnext;
  _prioqelt *heap; 
  _prioqelt *hashtab;
  int hash_key_size;
  int hash_entry_size;
}
*_prioq;
/*#else
typedef struct prioq1_struct
{
  int heapsize;
  int heapnext;
  prioqelt1 *heap;
  prioqelt1 hashtab[PRIOQ_TABSIZE];
}
*prioq1;
#endif
*/

/*#ifndef FASTQ*/
typedef struct Queue_struct
{
  unsigned int length;
  unsigned int maxlen;
  struct deq_struct zeroprio; 
  struct prioq_struct negprioq; 
  struct prioq_struct posprioq; 
}
*Queue;
/*#else
typedef struct Queue1_struct
{
  unsigned int length;
  unsigned int maxlen;
  struct deq_struct zeroprio;
  struct prioq1_struct negprioq;
  struct prioq1_struct posprioq;
}
*Queue;
#endif
*/

Queue CqsCreate(void);

void CqsDelete(Queue);

void CqsEnqueue(Queue, void *msg);

void CqsEnqueueFifo(Queue, void *msg);

void CqsEnqueueLifo(Queue, void *msg);

void CqsEnqueueGeneral(Queue, void *msg, int strategy, 
                       int priobits, unsigned int *prioPtr);

void CqsEnumerateQueue(Queue q, void ***resp);

void CqsDequeue(Queue, void **msgPtr);

unsigned int CqsLength(Queue);
int CqsEmpty(Queue);
int CqsPrioGT_(unsigned int ints1, unsigned int *data1, unsigned int ints2, unsigned int *data2);
int CqsPrioGT(_prio, _prio);

_prio CqsGetPriority(Queue);

void CqsIncreasePriorityForEntryMethod(Queue q, const int entrymethod);

void CqsRemoveSpecific(Queue, const void *msgPtr);

#ifdef ADAPT_SCHED_MEM
void CqsIncreasePriorityForMemCriticalEntries(Queue q);
#endif

#ifdef __cplusplus
}
#endif

#endif

---