scheduler.h

/* Copyright © 2018-2025 Pascal JEAN, All rights reserved.
 * This file is part of the Piduino Library.
 *
 * The Piduino Library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 3 of the License, or (at your option) any later version.
 *
 * The Piduino Library 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
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with the Piduino Library; if not, see <http://www.gnu.org/licenses/>.
 */
#pragma once
 
#include <mutex>
 
namespace Piduino {
 
  class Scheduler {
 
    public:
      Scheduler (int interruptPriority = -1) : _interruptPriority (interruptPriority) {
        if (interruptPriority < 0) {
          _interruptPriority = rtPriorityMax();
        }
        _previousPriority = rtPriority();
      }
 
      inline void noInterrupts() {
 
        _intMutex.lock();
        _previousPriority = rtPriority();
        setRtPriority (_interruptPriority);
      }
 
      inline void interrupts() {
 
        setRtPriority (_previousPriority);
        _intMutex.unlock();
      }
 
      int interrupPriority () const {
        return _interruptPriority;
      }
 
      void setInterrupPriority (int value) {
        std::unique_lock<std::mutex> lock (_intMutex);
        _interruptPriority = value;
      }
 
      static void setRtPriority (int priority);
 
      static int rtPriority();
 
      static int rtPriorityMin();
 
      static int rtPriorityMax();
      
      static void yield();
 
    protected:
      int _interruptPriority;
      int _previousPriority;
      std::mutex _intMutex;
  };
}
 
/* ========================================================================== */