TimerList.hxx 2.74 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35
/*
 * Copyright 2007-2021 CM4all GmbH
 * All rights reserved.
 *
 * author: Max Kellermann <mk@cm4all.com>
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 * notice, this list of conditions and the following disclaimer.
 *
 * - Redistributions in binary form must reproduce the above copyright
 * notice, this list of conditions and the following disclaimer in the
 * documentation and/or other materials provided with the
 * distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE
 * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
 * OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#pragma once

#include "Chrono.hxx"
36
#include "event/Features.h"
37 38
#include "util/IntrusiveList.hxx"

39
#ifndef NO_BOOST
40
#include <boost/intrusive/set.hpp>
41
#endif
42

43
class FineTimerEvent;
44 45

/**
46
 * A list of #FineTimerEvent instances sorted by due time point.
47 48 49
 */
class TimerList final {
	struct Compare {
50 51
		constexpr bool operator()(const FineTimerEvent &a,
					  const FineTimerEvent &b) const noexcept;
52 53
	};

54 55 56 57 58 59
#ifdef NO_BOOST
	/* when building without Boost, then this is just a sorted
	   doubly-linked list - this doesn't scale well, but is good
	   enough for most programs */
	IntrusiveList<FineTimerEvent> timers;
#else
60
	boost::intrusive::multiset<FineTimerEvent,
61 62 63
				   boost::intrusive::base_hook<boost::intrusive::set_base_hook<boost::intrusive::link_mode<boost::intrusive::auto_unlink>>>,
				   boost::intrusive::compare<Compare>,
				   boost::intrusive::constant_time_size<false>> timers;
64
#endif
65 66 67 68 69 70 71 72 73 74 75 76

public:
	TimerList();
	~TimerList() noexcept;

	TimerList(const TimerList &other) = delete;
	TimerList &operator=(const TimerList &other) = delete;

	bool IsEmpty() const noexcept {
		return timers.empty();
	}

77
	void Insert(FineTimerEvent &t) noexcept;
78 79

	/**
80
	 * Invoke all expired #FineTimerEvent instances and return the
81 82 83
	 * duration until the next timer expires.  Returns a negative
	 * duration if there is no timeout.
	 */
84
	Event::Duration Run(Event::TimePoint now) noexcept;
85
};