queue.h

Go to the documentation of this file.

/* --COPYRIGHT--,BSD
 * Copyright (c) 2012, Texas Instruments Incorporated
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * *  Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * *  Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 *
 * *  Neither the name of Texas Instruments Incorporated nor the names of
 *    its contributors may be used to endorse or promote products derived
 *    from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 * --/COPYRIGHT--*/
#ifndef _QUEUE_H_
#define _QUEUE_H_



// **************************************************************************
// the includes

#include "sw/modules/types/src/types.h"

// TEMP
#include "sw/modules/iqmath/src/32b/IQmathLib.h"

#include "sw/drivers/cpu/src/32b/f28x/f2803x/cpu.h"



// Include the algorithm overview defined in modules/<module>/docs/doxygen/doxygen.h


#ifdef __cplusplus
extern "C" {
#endif


// **************************************************************************
// the defines


#define    EVENT_MAX_NUM_ARGS           4


#define    QUEUE_MAX_NUM_EVENTS         8


// **************************************************************************
// the typedefs

typedef void             (*EVENT_Fxn)();


typedef struct _EVENT_ArgList_
{
  void                *arg[EVENT_MAX_NUM_ARGS];  
} EVENT_ArgList;


typedef struct _EVENT_Obj_
{
  struct _EVENT_Obj_  *nextEvent;        
  struct _EVENT_Obj_  *prevEvent;        
  bool                 taken;            
  uint_least8_t        queueNumber;      
  uint_least8_t        numArgs;          
  EVENT_Fxn            eventFxn;         
  EVENT_ArgList        argList;          
} EVENT_Obj;


typedef struct _EVENT_Obj_  *EVENT_Handle;


typedef struct _QUEUE_Obj_
{
  EVENT_Handle  firstEvent;              
  EVENT_Handle  lastEvent;               
} QUEUE_Obj;


typedef enum 
{
  QUEUE_STATUS_FIRST_EVENT_TAKEN=0,      
  QUEUE_STATUS_LAST_EVENT_TAKEN          
} QUEUE_Status_e;


typedef struct _QUEUE_Obj_ *QUEUE_Handle;


// **************************************************************************
// the globals

extern uint32_t gEventIndex;


extern EVENT_Obj gEvents[QUEUE_MAX_NUM_EVENTS];


// **************************************************************************
// the function prototypes


static inline bool QUEUE_isEvent(QUEUE_Handle handle)
{
  QUEUE_Obj *obj = (QUEUE_Obj *)handle;
  
  return(!(obj->firstEvent == (EVENT_Handle)obj));
} // end of QUEUE_isEvent() function


static inline bool QUEUE_isIdle(QUEUE_Handle handle)
{
  QUEUE_Obj *obj = (QUEUE_Obj *)handle;

  return(obj->firstEvent == (EVENT_Handle)obj);
} // end of QUEUE_isIdle() function


extern QUEUE_Handle QUEUE_init(void *pMemory,const size_t numBytes);


//             there is at least one event in the queue.
extern void QUEUE_listen(QUEUE_Handle handle);


static inline status QUEUE_postEventFirst(QUEUE_Handle handle,
                                          const EVENT_Fxn eventFxn,
                                          const EVENT_ArgList *pArgList,
                                          const uint_least8_t numArgs)
{

  if(numArgs > EVENT_MAX_NUM_ARGS)
    {
      return(ERROR);
    }
  else
    {
      QUEUE_Obj *obj = (QUEUE_Obj *)handle;
      EVENT_Obj *pEvent;
      EVENT_Obj *pFirstEvent;

      pEvent = &gEvents[gEventIndex];

      if(pEvent->taken)
        return(QUEUE_STATUS_FIRST_EVENT_TAKEN);

      gEventIndex++;
      gEventIndex &= QUEUE_MAX_NUM_EVENTS-1;

      pEvent->taken = true;

      pEvent->eventFxn = eventFxn;
      pEvent->argList.arg[0] = pArgList->arg[0];
      pEvent->argList.arg[1] = pArgList->arg[1];
      pEvent->argList.arg[2] = pArgList->arg[2];
      pEvent->argList.arg[3] = pArgList->arg[3];

      // set the number of arguments
      pEvent->numArgs = numArgs;

      // insert the event at top of the queue
      pFirstEvent = (EVENT_Obj *)obj->firstEvent;
  
      pEvent->prevEvent = pFirstEvent->prevEvent;
      pEvent->nextEvent = pFirstEvent;
      pFirstEvent->prevEvent = pEvent;
      obj->firstEvent = (EVENT_Handle)pEvent;
  
      return(OK);
    }
} // end of QUEUE_postEventFirst() function


static inline status QUEUE_postEventLast(QUEUE_Handle handle,
                                         const EVENT_Fxn eventFxn,
                                         const EVENT_ArgList *pArgList,
                                         const uint_least8_t numArgs)
{

  if(numArgs > EVENT_MAX_NUM_ARGS)
    {
      return(ERROR);
    }
  else
    {
      QUEUE_Obj *obj = (QUEUE_Obj *)handle;
      EVENT_Obj *pEvent;
      EVENT_Obj *pLastEvent;

      pEvent = &gEvents[gEventIndex];

      if(pEvent->taken)
        return(QUEUE_STATUS_LAST_EVENT_TAKEN);

      gEventIndex++;
      gEventIndex &= QUEUE_MAX_NUM_EVENTS-1;

      pEvent->taken = true;

      pEvent->eventFxn = eventFxn;
      pEvent->argList.arg[0] = pArgList->arg[0];
      pEvent->argList.arg[1] = pArgList->arg[1];
      pEvent->argList.arg[2] = pArgList->arg[2];
      pEvent->argList.arg[3] = pArgList->arg[3];

      // set the number of arguments
      pEvent->numArgs = numArgs;

      // insert the event at the bottom of the queue
      pLastEvent = (EVENT_Obj *)obj->lastEvent;

      pEvent->prevEvent = pLastEvent;
      pEvent->nextEvent = pLastEvent->nextEvent;
      pLastEvent->nextEvent = pEvent;
      obj->lastEvent = (EVENT_Handle)pEvent;

      return(OK);
    }

} // end of QUEUE_postEventLast() function


static inline void QUEUE_removeFirstEvent(QUEUE_Handle handle)
{
  QUEUE_Obj *obj = (QUEUE_Obj *)handle;
  EVENT_Obj *pFirstEvent;
  EVENT_Obj *pNextEvent;
  EVENT_Obj *pPrevEvent;


  // disable interrupts
  DISABLE_INTERRUPTS;

  pFirstEvent = (EVENT_Obj *)obj->firstEvent;

  pNextEvent = pFirstEvent->nextEvent;
  pPrevEvent = pFirstEvent->prevEvent;

  pNextEvent->prevEvent = pPrevEvent;
  pPrevEvent->nextEvent = pNextEvent;

  obj->firstEvent = (EVENT_Handle)pNextEvent;

  pFirstEvent->taken = false;

  // enable maskable interrupts
  ENABLE_INTERRUPTS;

  return;
} // end of QUEUE_removeFirstEvent() function


//extern void QUEUE_removeLastEvent(QUEUE_Handle handle);
static inline void QUEUE_removeLastEvent(QUEUE_Handle handle)
{
  QUEUE_Obj *obj = (QUEUE_Obj *)handle;
  EVENT_Obj *pLastEvent;
  EVENT_Obj *pNextEvent;
  EVENT_Obj *pPrevEvent;


  // disable interrupts
  DISABLE_INTERRUPTS;

  pLastEvent = (EVENT_Obj *)obj->lastEvent;

  pNextEvent = (EVENT_Obj *)pLastEvent->nextEvent;
  pPrevEvent = (EVENT_Obj *)pLastEvent->prevEvent;

  pNextEvent->prevEvent = pPrevEvent;
  pPrevEvent->nextEvent = pNextEvent;

  pLastEvent->taken = false;

  obj->lastEvent = (EVENT_Handle)pPrevEvent;

  // enable interrupts
  ENABLE_INTERRUPTS;

  return;
} // end of QUEUE_removeLastEvent() function


//             it is executed.
static inline void QUEUE_executeEvent(QUEUE_Handle handle)
{
  QUEUE_Obj *obj = (QUEUE_Obj *)handle;
  EVENT_Obj *pEvent = (EVENT_Obj *)obj->firstEvent;
  uint_least8_t numArgs = pEvent->numArgs;


  // based on the number of event arguments, make the appropriate event call
  if(numArgs == 4)
    {
      (pEvent->eventFxn)(pEvent->argList.arg[0],pEvent->argList.arg[1],pEvent->argList.arg[2],pEvent->argList.arg[3]);
    }
  else if(numArgs == 3)
    {
      (pEvent->eventFxn)(pEvent->argList.arg[0],pEvent->argList.arg[1],pEvent->argList.arg[2]);
    }
  else if(numArgs == 2)
    {
      (pEvent->eventFxn)(pEvent->argList.arg[0],pEvent->argList.arg[1]);
    }
  else if(numArgs == 1)
    {
      (pEvent->eventFxn)(pEvent->argList.arg[0]);
    }
  else if(numArgs == 0)
    {
      (pEvent->eventFxn)();
    }


  // remove the event from the queue
  QUEUE_removeFirstEvent(handle);

  return;
} // end of QUEUE_executeEvent() function


#ifdef __cplusplus
}
#endif // extern "C"

#endif // end of _QUEUE_H_ definition