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
|
/* This file is part of the Spring engine (GPL v2 or later), see LICENSE.html */
#include "LegacyAtlasAlloc.h"
#include <algorithm>
#include <vector>
#include <list>
// texture spacing in the atlas (in pixels)
#define TEXMARGIN 2
inline int CLegacyAtlasAlloc::CompareTex(SAtlasEntry* tex1, SAtlasEntry* tex2)
{
// sort in reverse order
if ((tex1)->size.y == (tex2)->size.y)
return ((tex1)->size.x > (tex2)->size.x);
return ((tex1)->size.y > (tex2)->size.y);
}
bool CLegacyAtlasAlloc::IncreaseSize()
{
if (atlasSize.y < atlasSize.x) {
if ((atlasSize.y * 2) <= maxsize.y) {
atlasSize.y *= 2;
return true;
}
if ((atlasSize.x * 2) <= maxsize.x) {
atlasSize.x *= 2;
return true;
}
} else {
if ((atlasSize.x * 2) <= maxsize.x) {
atlasSize.x *= 2;
return true;
}
if ((atlasSize.y * 2) <= maxsize.y) {
atlasSize.y *= 2;
return true;
}
}
return false;
}
bool CLegacyAtlasAlloc::Allocate()
{
atlasSize.x = 32;
atlasSize.y = 32;
std::vector<SAtlasEntry*> memtextures;
memtextures.reserve(entries.size());
for (auto& entry: entries) {
memtextures.push_back(&entry.second);
}
std::sort(memtextures.begin(), memtextures.end(), CLegacyAtlasAlloc::CompareTex);
bool success = true;
bool recalc = false;
int2 max;
int2 cur;
std::list<int2> nextSub;
std::list<int2> thisSub;
for (int a = 0; a < static_cast<int>(memtextures.size()); ++a) {
SAtlasEntry* curtex = memtextures[a];
bool done = false;
while (!done) {
if (thisSub.empty()) {
if (nextSub.empty()) {
cur.y = max.y;
max.y += curtex->size.y + TEXMARGIN;
if (max.y > atlasSize.y) {
if (IncreaseSize()) {
nextSub.clear();
thisSub.clear();
cur.y = max.y = cur.x = 0;
recalc = true;
break;
} else {
success = false;
break;
}
}
thisSub.emplace_back(0, cur.y);
} else {
thisSub = nextSub;
nextSub.clear();
}
}
if ((thisSub.front().x + curtex->size.x + TEXMARGIN) > atlasSize.x) {
thisSub.clear();
continue;
}
if (thisSub.front().y + curtex->size.y > max.y) {
thisSub.pop_front();
continue;
}
// found space in both dimensions s.t. texture
// PLUS margin fits within current atlas bounds
curtex->texCoords.x1 = thisSub.front().x;
curtex->texCoords.y1 = thisSub.front().y;
curtex->texCoords.x2 = thisSub.front().x + curtex->size.x - 1;
curtex->texCoords.y2 = thisSub.front().y + curtex->size.y - 1;
cur.x = thisSub.front().x + curtex->size.x + TEXMARGIN;
max.x = std::max(max.x, cur.x);
done = true;
if ((thisSub.front().y + curtex->size.y + TEXMARGIN) < max.y) {
nextSub.emplace_back(thisSub.front().x + TEXMARGIN, thisSub.front().y + curtex->size.y + TEXMARGIN);
}
thisSub.front().x += (curtex->size.x + TEXMARGIN);
while (thisSub.size()>1 && thisSub.front().x >= (++thisSub.begin())->x) {
(++thisSub.begin())->x = thisSub.front().x;
thisSub.erase(thisSub.begin());
}
}
if (recalc) {
// reset all existing texcoords
for (auto& memtexture: memtextures) {
memtexture->texCoords = float4();
}
recalc = false;
a = -1;
continue;
}
}
if (npot)
atlasSize = max;
return success;
}
|
