mirror of
				https://github.com/RGBCube/serenity
				synced 2025-10-31 19:22:45 +00:00 
			
		
		
		
	
		
			
				
	
	
		
			135 lines
		
	
	
	
		
			4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			135 lines
		
	
	
	
		
			4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| /*
 | |
|  * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
 | |
|  * All rights reserved.
 | |
|  *
 | |
|  * Redistribution and use in source and binary forms, with or without
 | |
|  * modification, are permitted provided that the following conditions are met:
 | |
|  *
 | |
|  * 1. Redistributions of source code must retain the above copyright notice, this
 | |
|  *    list of conditions and the following disclaimer.
 | |
|  *
 | |
|  * 2. 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 COPYRIGHT HOLDER 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 <AK/Function.h>
 | |
| #include <AK/InlineLinkedList.h>
 | |
| #include <AK/NonnullRefPtr.h>
 | |
| #include <AK/OwnPtr.h>
 | |
| #include <AK/RefCounted.h>
 | |
| #include <Kernel/Time/TimeManagement.h>
 | |
| 
 | |
| namespace Kernel {
 | |
| 
 | |
| typedef u64 TimerId;
 | |
| 
 | |
| class Timer : public RefCounted<Timer>
 | |
|     , public InlineLinkedListNode<Timer> {
 | |
|     friend class TimerQueue;
 | |
|     friend class InlineLinkedListNode<Timer>;
 | |
| 
 | |
| public:
 | |
|     Timer(clockid_t clock_id, u64 expires, Function<void()>&& callback)
 | |
|         : m_clock_id(clock_id)
 | |
|         , m_expires(expires)
 | |
|         , m_callback(move(callback))
 | |
|     {
 | |
|     }
 | |
|     ~Timer()
 | |
|     {
 | |
|         ASSERT(!is_queued());
 | |
|     }
 | |
| 
 | |
|     timespec remaining() const;
 | |
| 
 | |
| private:
 | |
|     TimerId m_id;
 | |
|     clockid_t m_clock_id;
 | |
|     u64 m_expires;
 | |
|     u64 m_remaining { 0 };
 | |
|     Function<void()> m_callback;
 | |
|     Timer* m_next { nullptr };
 | |
|     Timer* m_prev { nullptr };
 | |
|     Atomic<bool, AK::MemoryOrder::memory_order_relaxed> m_queued { false };
 | |
| 
 | |
|     bool operator<(const Timer& rhs) const
 | |
|     {
 | |
|         return m_expires < rhs.m_expires;
 | |
|     }
 | |
|     bool operator>(const Timer& rhs) const
 | |
|     {
 | |
|         return m_expires > rhs.m_expires;
 | |
|     }
 | |
|     bool operator==(const Timer& rhs) const
 | |
|     {
 | |
|         return m_id == rhs.m_id;
 | |
|     }
 | |
|     bool is_queued() const { return m_queued; }
 | |
|     void set_queued(bool queued) { m_queued = queued; }
 | |
|     u64 now(bool) const;
 | |
| };
 | |
| 
 | |
| class TimerQueue {
 | |
|     friend class Timer;
 | |
| 
 | |
| public:
 | |
|     TimerQueue();
 | |
|     static TimerQueue& the();
 | |
| 
 | |
|     TimerId add_timer(NonnullRefPtr<Timer>&&);
 | |
|     RefPtr<Timer> add_timer_without_id(clockid_t, const timespec&, Function<void()>&&);
 | |
|     TimerId add_timer(clockid_t, timeval& timeout, Function<void()>&& callback);
 | |
|     bool cancel_timer(TimerId id);
 | |
|     bool cancel_timer(Timer&);
 | |
|     bool cancel_timer(NonnullRefPtr<Timer>&& timer)
 | |
|     {
 | |
|         return cancel_timer(*move(timer));
 | |
|     }
 | |
|     void fire();
 | |
| 
 | |
| private:
 | |
|     struct Queue {
 | |
|         InlineLinkedList<Timer> list;
 | |
|         u64 next_timer_due { 0 };
 | |
|     };
 | |
|     void remove_timer_locked(Queue&, Timer&);
 | |
|     void update_next_timer_due(Queue&);
 | |
|     void add_timer_locked(NonnullRefPtr<Timer>);
 | |
| 
 | |
|     Queue& queue_for_timer(Timer& timer)
 | |
|     {
 | |
|         switch (timer.m_clock_id) {
 | |
|         case CLOCK_MONOTONIC:
 | |
|         case CLOCK_MONOTONIC_COARSE:
 | |
|         case CLOCK_MONOTONIC_RAW:
 | |
|             return m_timer_queue_monotonic;
 | |
|         case CLOCK_REALTIME:
 | |
|         case CLOCK_REALTIME_COARSE:
 | |
|             return m_timer_queue_realtime;
 | |
|         default:
 | |
|             ASSERT_NOT_REACHED();
 | |
|         }
 | |
|     }
 | |
| 
 | |
|     u64 m_timer_id_count { 0 };
 | |
|     u64 m_ticks_per_second { 0 };
 | |
|     Queue m_timer_queue_monotonic;
 | |
|     Queue m_timer_queue_realtime;
 | |
|     InlineLinkedList<Timer> m_timers_executing;
 | |
| };
 | |
| 
 | |
| }
 | 
