workqueue.hpp

/****************************************************************************
 *
 *  Copyright (c) 2017, Michael Becker (michael.f.becker@gmail.com)
 *
 *  This file is part of the FreeRTOS Add-ons project.
 *
 *  Source Code:
 *  https://github.com/michaelbecker/freertos-addons
 *
 *  Project Page:
 *  http://michaelbecker.github.io/freertos-addons/
 *
 *  On-line Documentation:
 *  http://michaelbecker.github.io/freertos-addons/docs/html/index.html
 *
 *  Permission is hereby granted, free of charge, to any person obtaining a
 *  copy of this software and associated documentation files
 *  (the "Software"), to deal in the Software without restriction, including
 *  without limitation the rights to use, copy, modify, merge, publish,
 *  distribute, sublicense, and/or sell copies of the Software, and to
 *  permit persons to whom the Software is furnished to do so,subject to the
 *  following conditions:
 *
 *  + The above copyright notice and this permission notice shall be included
 *    in all copies or substantial portions of the Software.
 *  + Credit is appreciated, but not required, if you find this project
 *    useful enough to include in your application, product, device, etc.
 *
 *  THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
 *  OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 *  MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
 *  IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
 *  CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
 *  TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
 *  SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 *
 ***************************************************************************/
 
 
#include "freertos-config.h"
 
#ifndef WORK_QUEUE_HPP_
#define WORK_QUEUE_HPP_
 
#include "thread.hpp"
#include "queue.hpp"
#include "semaphore.hpp"
 
 
namespace cpp_freertos {
 
 
#define DEFAULT_MAX_WORK_ITEMS          10
#define DEFAULT_WORK_QUEUE_STACK_SIZE   (configMINIMAL_STACK_SIZE * 2)
#define DEFAULT_WORK_QUEUE_PRIORITY     (tskIDLE_PRIORITY + 1)
 
 
class WorkItem {
 
    //
    //  Public API
    //
    public:
 
        WorkItem(bool freeAfterComplete = false);
 
        virtual ~WorkItem();
        
        bool FreeAfterRun();
 
        virtual void Run() = 0;
 
    //
    //  Private API
    //  The internals of this wrapper class.
    //
    private:
        const bool FreeItemAfterCompleted;
};
 
 
class WorkQueue {
 
    //
    //  Public API
    //
    public:
        WorkQueue(  const char * const Name,
                    uint16_t StackDepth = DEFAULT_WORK_QUEUE_STACK_SIZE,
                    UBaseType_t Priority = DEFAULT_WORK_QUEUE_PRIORITY,
                    UBaseType_t MaxWorkItems = DEFAULT_MAX_WORK_ITEMS);
 
        WorkQueue(  uint16_t StackDepth = DEFAULT_WORK_QUEUE_STACK_SIZE,
                    UBaseType_t Priority = DEFAULT_WORK_QUEUE_PRIORITY,
                    UBaseType_t MaxWorkItems = DEFAULT_MAX_WORK_ITEMS);
 
#if (INCLUDE_vTaskDelete == 1)
        ~WorkQueue();
#else
//
//  If we are using C++11 or later, take advantage of the 
//  newer features to find bugs.
//
#if __cplusplus >= 201103L
        ~WorkQueue() = delete;
#endif
#endif
 
        bool QueueWork(WorkItem *work);
 
    //
    //  Private API
    //  The internals of this class.
    //
    private:
 
        class CWorkerThread : public Thread {
 
            public:
                CWorkerThread(  const char * const Name,
                                uint16_t StackDepth,
                                UBaseType_t Priority,
                                WorkQueue *Parent);
 
                CWorkerThread(  uint16_t StackDepth,
                                UBaseType_t Priority,
                                WorkQueue *Parent);
 
                virtual ~CWorkerThread();
 
            protected:
                virtual void Run();
 
            private:
                const WorkQueue *ParentWorkQueue;
        };
        
        CWorkerThread *WorkerThread;
 
        Queue *WorkItemQueue;
 
        BinarySemaphore *ThreadComplete;
};
 
 
}
#endif