lumiera_/src/lib/call-queue.hpp
Ichthyostega 806db414dd Copyright: clarify and simplify the file headers
* Lumiera source code always was copyrighted by individual contributors
 * there is no entity "Lumiera.org" which holds any copyrights
 * Lumiera source code is provided under the GPL Version 2+

== Explanations ==
Lumiera as a whole is distributed under Copyleft, GNU General Public License Version 2 or above.
For this to become legally effective, the ''File COPYING in the root directory is sufficient.''

The licensing header in each file is not strictly necessary, yet considered good practice;
attaching a licence notice increases the likeliness that this information is retained
in case someone extracts individual code files. However, it is not by the presence of some
text, that legally binding licensing terms become effective; rather the fact matters that a
given piece of code was provably copyrighted and published under a license. Even reformatting
the code, renaming some variables or deleting parts of the code will not alter this legal
situation, but rather creates a derivative work, which is likewise covered by the GPL!

The most relevant information in the file header is the notice regarding the
time of the first individual copyright claim. By virtue of this initial copyright,
the first author is entitled to choose the terms of licensing. All further
modifications are permitted and covered by the License. The specific wording
or format of the copyright header is not legally relevant, as long as the
intention to publish under the GPL remains clear. The extended wording was
based on a recommendation by the FSF. It can be shortened, because the full terms
of the license are provided alongside the distribution, in the file COPYING.
2024-11-17 23:42:55 +01:00

113 lines
2.7 KiB
C++
Raw Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

/*
CALL-QUEUE.hpp - a queue to dispatch bound function invocations into another thread
Copyright (C)
2017, Hermann Vosseler <Ichthyostega@web.de>
  **Lumiera** is free software; you can redistribute it and/or modify it
  under the terms of the GNU General Public License as published by the
  Free Software Foundation; either version 2 of the License, or (at your
  option) any later version. See the file COPYING for further details.
*/
/** @file call-queue.hpp
** A Queue for function invocations, allowing them to be dispatched on demand.
** Typically this queue helper is used to forward lambdas into another thread, e.g.
** the UI thread for execution.
**
** @todo simplistic braindead implementation with locking and heap based storage
** based on std::function; should use a lock-fee queue and should have an eye
** on the impact of managing argument storage
**
** @see stage::NotificationService usage example
*/
#ifndef LIB_CALL_QUEUE_H
#define LIB_CALL_QUEUE_H
#include "lib/error.hpp"
#include "lib/sync.hpp"
#include "lib/iter-stack.hpp"
#include "lib/nocopy.hpp"
#include <functional>
namespace lib {
namespace error = lumiera::error;
/*********************************************************//**
* A threadsafe queue for bound `void(void)` functors.
* Typically used to dispatch function invocations together with
* their concrete parameters into another thread for invocation.
*/
class CallQueue
: util::NonCopyable
, public Sync<>
{
public:
using Operation = std::function<void(void)>;
private:
lib::IterQueue<Operation> queue_;
public:
CallQueue() { }
CallQueue&
feed (Operation&& op)
{
if (not op)
throw error::Logic( "Unbound Functor fed to dispatcher CallQueue"
, error::LUMIERA_ERROR_BOTTOM_VALUE);
{
Lock sync{this};
queue_.feed (move(op));
}
return *this;
}
CallQueue&
invoke()
{
if (not empty())
{
Operation operate;
{
Lock sync{this};
operate = move (*queue_);
++queue_;
}
ASSERT (operate);
operate();
}
return *this;
}
/* == diagnostics == */
size_t
size() const
{
Lock sync{this};
return queue_.size();
}
bool
empty() const
{
return 0 == size();
}
};
} // namespace lib
#endif /*LIB_CALL_QUEUE_H*/