aboutsummaryrefslogtreecommitdiff
path: root/FIFO.cpp
blob: e8525eb34bffe6730a72034daad251148503b9c4 (plain)
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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
/*
    Copyright 2016-2017 StapleButter

    This file is part of melonDS.

    melonDS 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 3 of the License, or (at your option)
    any later version.

    melonDS is distributed in the hope that it will be useful, but WITHOUT ANY
    WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
    FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

    You should have received a copy of the GNU General Public License along
    with melonDS. If not, see http://www.gnu.org/licenses/.
*/

#include "FIFO.h"


FIFO::FIFO(u32 num)
{
    NumEntries = num;
    Entries = new u32[num];
    Clear();
}

FIFO::~FIFO()
{
    delete[] Entries;
}

void FIFO::Clear()
{
    NumOccupied = 0;
    ReadPos = 0;
    WritePos = 0;
    Entries[ReadPos] = 0;
}

void FIFO::Write(u32 val)
{
    if (IsFull()) return;

    Entries[WritePos] = val;

    WritePos++;
    if (WritePos >= NumEntries)
        WritePos = 0;

    NumOccupied++;
}

u32 FIFO::Read()
{
    u32 ret = Entries[ReadPos];
    if (IsEmpty())
        return ret;

    ReadPos++;
    if (ReadPos >= NumEntries)
        ReadPos = 0;

    NumOccupied--;
    return ret;
}

u32 FIFO::Peek()
{
    return Entries[ReadPos];
}