forked from uncrustify/uncrustify
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathChunkStack.cpp
More file actions
126 lines (105 loc) · 2.04 KB
/
ChunkStack.cpp
File metadata and controls
126 lines (105 loc) · 2.04 KB
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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
/**
* @file ChunkStack.cpp
* Manages a chunk stack
*
* @author Ben Gardner
* @license GPL v2+
*/
#include "ChunkStack.h"
#include <cstdio>
#include <cstdlib>
void ChunkStack::Set(const ChunkStack& cs)
{
m_cse.resize(cs.m_cse.size());
for (int idx = 0; idx < (int)m_cse.size(); idx++)
{
m_cse[idx].m_pc = cs.m_cse[idx].m_pc;
m_cse[idx].m_seqnum = cs.m_cse[idx].m_seqnum;
}
m_seqnum = cs.m_seqnum;
}
const ChunkStack::Entry *ChunkStack::Top() const
{
if (m_cse.size() > 0)
{
return(&m_cse[m_cse.size() - 1]);
}
return(NULL);
}
const ChunkStack::Entry *ChunkStack::Get(int idx) const
{
if ((idx >= 0) && (idx < (int)m_cse.size()))
{
return(&m_cse[idx]);
}
return(NULL);
}
chunk_t *ChunkStack::GetChunk(int idx) const
{
if ((idx >= 0) && (idx < (int)m_cse.size()))
{
return(m_cse[idx].m_pc);
}
return(NULL);
}
chunk_t *ChunkStack::Pop_Front()
{
chunk_t *pc = NULL;
if (m_cse.size() > 0)
{
pc = m_cse[0].m_pc;
m_cse.pop_front();
}
return(pc);
}
chunk_t *ChunkStack::Pop_Back()
{
chunk_t *pc = NULL;
if (m_cse.size() > 0)
{
pc = m_cse[m_cse.size() - 1].m_pc;
m_cse.pop_back();
}
return(pc);
}
void ChunkStack::Push_Back(chunk_t *pc, int seqnum)
{
m_cse.push_back(Entry(seqnum, pc));
if (m_seqnum < seqnum)
{
m_seqnum = seqnum;
}
}
/**
* Mark an entry to be removed by Collapse()
*
* @param idx The item to remove
*/
void ChunkStack::Zap(int idx)
{
if ((idx >= 0) && (idx < (int)m_cse.size()))
{
m_cse[idx].m_pc = NULL;
}
}
/**
* Compresses down the stack by removing dead entries
*/
void ChunkStack::Collapse()
{
int wr_idx = 0;
int rd_idx;
for (rd_idx = 0; rd_idx < (int)m_cse.size(); rd_idx++)
{
if (m_cse[rd_idx].m_pc != NULL)
{
if (rd_idx != wr_idx)
{
m_cse[wr_idx].m_pc = m_cse[rd_idx].m_pc;
m_cse[wr_idx].m_seqnum = m_cse[rd_idx].m_seqnum;
}
wr_idx++;
}
}
m_cse.resize(wr_idx);
}