priority.h

Go to the documentation of this file.

/*
 *  COPYRIGHT (c) 1989-2011.
 *  On-Line Applications Research Corporation (OAR).
 *
 *  Copyright (c) 2016, 2017 embedded brains GmbH.
 *
 *  The license and distribution terms for this file may be
 *  found in the file LICENSE in this distribution or at
 *  http://www.rtems.org/license/LICENSE.
 */

#ifndef _RTEMS_SCORE_PRIORITY_H
#define _RTEMS_SCORE_PRIORITY_H

#include <rtems/score/chain.h>
#include <rtems/score/cpu.h>
#include <rtems/score/rbtree.h>

struct _Scheduler_Control;

#ifdef __cplusplus
extern "C" {
#endif

typedef uint64_t Priority_Control;

#define PRIORITY_MINIMUM      0

#define PRIORITY_PSEUDO_ISR   PRIORITY_MINIMUM

#if defined (CPU_PRIORITY_MAXIMUM)
  #define PRIORITY_DEFAULT_MAXIMUM      CPU_PRIORITY_MAXIMUM
#else
  #define PRIORITY_DEFAULT_MAXIMUM      255
#endif

typedef struct {
  union {
    Chain_Node Chain;
    RBTree_Node RBTree;
  } Node;

  Priority_Control priority;
} Priority_Node;

typedef enum {
  PRIORITY_ACTION_ADD,
  PRIORITY_ACTION_CHANGE,
  PRIORITY_ACTION_REMOVE,
  PRIORITY_ACTION_INVALID
} Priority_Action_type;

typedef struct Priority_Aggregation Priority_Aggregation;

struct Priority_Aggregation {
  Priority_Node Node;

  RBTree_Control Contributors;

#if defined(RTEMS_SMP)

  const struct _Scheduler_Control *scheduler;
#endif

  struct {
#if defined(RTEMS_SMP)

    Priority_Aggregation *next;
#endif

    Priority_Node *node;

    Priority_Action_type type;
  } Action;
};

typedef struct {
  Priority_Aggregation *actions;
} Priority_Actions;

#ifdef __cplusplus
}
#endif

#endif
/* end of include file */