RGBCube/serenity
1
Fork 0
mirror of https://github.com/RGBCube/serenity synced 2025-07-26 14:47:35 +00:00
Code Issues Activity Actions

Add primitive FIFO and hook it up to sys$pipe().

Browse source 
It's now possible to do this in bash:

cat kernel.map | fgrep List

This is very cool! :^)
This commit is contained in:
Andreas Kling 2018-11-12 01:28:46 +01:00
parent 18e3ddf605
commit f1404aa948
13 changed files with 305 additions and 22 deletions
Download patch file Download diff file Expand all files Collapse all files

20
AK/CircularQueue.h
View file

@ -5,32 +5,34 @@
namespace AK {
template<typename T, size_t capacity>
template<typename T, size_t Capacity>
class CircularQueue {
public:
CircularQueue()
{
for (size_t i = 0; i < capacity; ++i)
for (size_t i = 0; i < Capacity; ++i)
m_elements[i] = T();
}
bool isEmpty() const { return !m_size; }
size_t size() const { return m_size; }
size_t capacity() const { return Capacity; }
void dump() const
{
kprintf("CircularQueue<%zu>:\n", capacity);
kprintf("CircularQueue<%zu>:\n", Capacity);
kprintf(" size: %zu\n", m_size);
for (size_t i = 0; i < capacity; ++i) {
for (size_t i = 0; i < Capacity; ++i) {
kprintf(" [%zu] %d %c\n", i, m_elements[i], i == m_head ? '*' : ' ');
}
}
void enqueue(const T& t)
{
m_elements[(m_head + m_size) % capacity] = t;
if (m_size == capacity)
m_head = (m_head + 1) % capacity;
m_elements[(m_head + m_size) % Capacity] = t;
if (m_size == Capacity)
m_head = (m_head + 1) % Capacity;
else
++m_size;
}
@ -39,13 +41,13 @@ public:
{
ASSERT(!isEmpty());
T value = m_elements[m_head];
m_head = (m_head + 1) % capacity;
m_head = (m_head + 1) % Capacity;
--m_size;
return value;
}
private:
T m_elements[capacity];
T m_elements[Capacity];
size_t m_size { 0 };
size_t m_head { 0 };
};