scheduler.h

Go to the documentation of this file.

/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/*
 * Copyright (c) 2005 INRIA
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation;
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 * Author: Mathieu Lacage <mathieu.lacage@sophia.inria.fr>
 */

#ifndef SCHEDULER_H
#define SCHEDULER_H

#include <stdint.h>
#include "object.h"

namespace ns3 {

class EventImpl;

class Scheduler : public Object
{
public:
  static TypeId GetTypeId (void);

  struct EventKey
  {
    uint64_t m_ts;         
    uint32_t m_uid;        
    uint32_t m_context;    
  };
  struct Event
  {
    EventImpl *impl;       
    EventKey key;          
  };

  virtual ~Scheduler () = 0;

  virtual void Insert (const Event &ev) = 0;
  virtual bool IsEmpty (void) const = 0;
  virtual Event PeekNext (void) const = 0;
  virtual Event RemoveNext (void) = 0;
  virtual void Remove (const Event &ev) = 0;
};

inline bool operator < (const Scheduler::EventKey &a,
                        const Scheduler::EventKey &b)
{
  if (a.m_ts < b.m_ts)
    {
      return true;
    }
  else if (a.m_ts == b.m_ts
           && a.m_uid < b.m_uid)
    {
      return true;
    }
  else
    {
      return false;
    }
}

inline bool operator != (const Scheduler::EventKey &a,
                         const Scheduler::EventKey &b)
{
  return a.m_uid != b.m_uid;
}

inline bool operator > (const Scheduler::EventKey &a,
                        const Scheduler::EventKey &b)
{
  if (a.m_ts > b.m_ts)
    {
      return true;
    }
  else if (a.m_ts == b.m_ts
           && a.m_uid > b.m_uid)
    {
      return true;
    }
  else
    {
      return false;
    }
}

inline bool operator < (const Scheduler::Event &a,
                        const Scheduler::Event &b)
{
  return a.key < b.key;
}


} // namespace ns3


#endif /* SCHEDULER_H */