blob: 65aa1ef23f2495d2c9be38fa2202ca84a639237e (
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
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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
|
#ifndef T_LIST_H
#define T_LIST_H
#include "common.h"
// A templated list, similar to nw4r::ut::LinkList.
// Notable differences are:
// * No dtor
// * Entirely in headers
// * Swapped node and count members
// Used in DowsingTarget, maybe also in dAcBase_c.soundStuff
//
// The current implementation has various unexplained behaviors
// * Constructor doesn't match if offset != 0 https://decomp.me/scratch/YqOCh
// * Many loops based on these iterators don't match in general, but probably not worth
// messing with until the ctor is fixed
// * -ipa file optimizes things that shouldn't be optimized https://decomp.me/scratch/lqM6i
template <typename T>
class TListNode {
public:
TListNode() : mpPrev(nullptr), mpNext(nullptr) {}
T *GetNext() const {
return mpNext;
}
T *GetPrev() const {
return mpPrev;
}
T *mpPrev;
T *mpNext;
};
template <typename T, int offset>
class TList {
public:
typedef TListNode<T> TNode;
class Iterator {
public:
Iterator() : pVal(NULL) {}
Iterator(T *p_val) : pVal(p_val) {}
Iterator &operator++() {
pVal = GetNodeFromPtr(pVal)->GetNext();
return *this;
}
Iterator &operator--() {
pVal = GetNodeFromPtr(pVal)->GetPrev();
return *this;
}
T *operator->() const {
return pVal;
}
T &operator*() {
return *this->operator->();
}
friend bool operator==(const Iterator &lhs, const Iterator &rhs) {
return lhs.pVal == rhs.pVal;
}
friend bool operator!=(const Iterator &lhs, const Iterator &rhs) {
return !(lhs.pVal == rhs.pVal);
}
private:
T *pVal; // at 0x0
};
TList() {
mStartEnd.mpNext = GetPtrFromNode(&mStartEnd);
mStartEnd.mpPrev = GetPtrFromNode(&mStartEnd);
mCount = 0;
}
Iterator GetBeginIter() {
if (GetEndIter() != Iterator(mStartEnd.GetNext())) {
return Iterator(mStartEnd.GetNext());
} else {
return GetEndIter();
}
}
/**
* Returns an iterator representing the position of pT in this
* list. If pT is not in the list, the result is the end iterator.
*
* This is typically used to check if an object is contained in a
* list of this type.
*/
Iterator GetPosition(T *pT) {
if (GetNodeFromPtr(pT)->mpNext == nullptr || GetNodeFromPtr(pT)->mpPrev == nullptr) {
return GetEndIter();
} else {
return Iterator(pT);
}
}
Iterator GetEndIter() {
return Iterator(GetPtrFromNode(&mStartEnd));
}
static TNode *GetNodeFromPtr(T *pT) {
return (TNode *)((u8 *)pT + offset);
}
static T *GetPtrFromNode(TNode *pN) {
return (T *)((u8 *)pN - offset);
}
void append(T *value) {
TNode *node = GetNodeFromPtr(value);
if (GetPtrFromNode(&mStartEnd) == mStartEnd.mpNext) {
node->mpNext = GetPtrFromNode(&mStartEnd);
node->mpPrev = GetPtrFromNode(&mStartEnd);
mStartEnd.mpNext = value;
mStartEnd.mpPrev = value;
mCount++;
} else {
node->mpPrev = mStartEnd.mpPrev;
node->mpNext = GetPtrFromNode(&mStartEnd);
GetNodeFromPtr(mStartEnd.mpPrev)->mpNext = value;
mStartEnd.mpPrev = value;
mCount++;
}
}
void prepend(T *value) {
TNode *node = GetNodeFromPtr(value);
if (GetPtrFromNode(&mStartEnd) == mStartEnd.mpNext) {
node->mpNext = GetPtrFromNode(&mStartEnd);
node->mpPrev = GetPtrFromNode(&mStartEnd);
mStartEnd.mpNext = value;
mStartEnd.mpPrev = value;
mCount++;
} else {
node->mpPrev = GetPtrFromNode(&mStartEnd);
node->mpNext = mStartEnd.mpNext;
GetNodeFromPtr(mStartEnd.mpNext)->mpPrev = value;
mStartEnd.mpNext = value;
mCount++;
}
}
void insertBefore(T* existing, T *value) {
TNode *node = GetNodeFromPtr(value);
TNode *existingNode = GetNodeFromPtr(existing);
T* itPrev = existingNode->mpPrev;
node->mpPrev = itPrev;
node->mpNext = existing;
GetNodeFromPtr(itPrev)->mpNext = value;
existingNode->mpPrev = value;
mCount++;
}
void remove(T *value) {
TNode *node = GetNodeFromPtr(value);
T *next = reinterpret_cast<T *>(node->mpNext);
if (GetPtrFromNode(&mStartEnd) == node->mpPrev) {
this->mStartEnd.mpNext = next;
} else {
GetNodeFromPtr(node->mpPrev)->mpNext = next;
}
if (GetPtrFromNode(&mStartEnd) == node->mpNext) {
this->mStartEnd.mpPrev = node->mpPrev;
} else {
GetNodeFromPtr(node->mpNext)->mpPrev = node->mpPrev;
}
node->mpPrev = nullptr;
node->mpNext = nullptr;
mCount--;
}
T *GetFirst() {
return GetPtrFromNode(&mStartEnd);
}
void RemoveFirst() {
if (mCount != 0) {
remove(GetFirst());
}
}
TNode mStartEnd;
s32 mCount;
};
#endif
|
