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
|
/* Copyright 2020 Jaakko Keränen <jaakko.keranen@iki.fi>
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */
#include "visbuf.h"
#include "window.h"
#include "util.h"
iDefineTypeConstruction(VisBuf)
void init_VisBuf(iVisBuf *d) {
d->texSize = zero_I2();
iZap(d->buffers);
}
void deinit_VisBuf(iVisBuf *d) {
dealloc_VisBuf(d);
}
void invalidate_VisBuf(iVisBuf *d) {
iForIndices(i, d->buffers) {
iZap(d->buffers[i].validRange);
}
}
void alloc_VisBuf(iVisBuf *d, const iInt2 size, int granularity) {
const iInt2 texSize = init_I2(size.x, (size.y / 2 / granularity + 1) * granularity);
if (!d->buffers[0].texture || !isEqual_I2(texSize, d->texSize)) {
d->texSize = texSize;
iForIndices(i, d->buffers) {
iVisBufTexture *tex = &d->buffers[i];
if (tex->texture) {
SDL_DestroyTexture(tex->texture);
}
tex->texture =
SDL_CreateTexture(renderer_Window(get_Window()),
SDL_PIXELFORMAT_RGBA8888,
SDL_TEXTUREACCESS_STATIC | SDL_TEXTUREACCESS_TARGET,
texSize.x,
texSize.y);
SDL_SetTextureBlendMode(tex->texture, SDL_BLENDMODE_NONE);
tex->origin = i * texSize.y;
iZap(tex->validRange);
}
}
}
void dealloc_VisBuf(iVisBuf *d) {
d->texSize = zero_I2();
iForIndices(i, d->buffers) {
SDL_DestroyTexture(d->buffers[i].texture);
d->buffers[i].texture = NULL;
}
}
void reposition_VisBuf(iVisBuf *d, const iRangei vis) {
d->vis = vis;
iRangei good = { 0, 0 };
size_t avail[3], numAvail = 0;
/* Check which buffers are available for reuse. */ {
iForIndices(i, d->buffers) {
iVisBufTexture *buf = d->buffers + i;
const iRangei region = { buf->origin, buf->origin + d->texSize.y };
if (region.start >= vis.end || region.end <= vis.start) {
avail[numAvail++] = i;
iZap(buf->validRange);
}
else {
good = union_Rangei(good, region);
}
}
}
if (numAvail == iElemCount(d->buffers)) {
/* All buffers are outside the visible range, do a reset. */
d->buffers[0].origin = vis.start;
d->buffers[1].origin = vis.start + d->texSize.y;
d->buffers[2].origin = vis.start + 2 * d->texSize.y;
}
else {
/* Extend to cover the visible range. */
while (vis.start < good.start) {
iAssert(numAvail > 0);
d->buffers[avail[--numAvail]].origin = good.start - d->texSize.y;
good.start -= d->texSize.y;
}
while (vis.end > good.end) {
iAssert(numAvail > 0);
d->buffers[avail[--numAvail]].origin = good.end;
good.end += d->texSize.y;
}
}
}
void invalidRanges_VisBuf(const iVisBuf *d, const iRangei full, iRangei *out_invalidRanges) {
iForIndices(i, d->buffers) {
const iVisBufTexture *buf = d->buffers + i;
const iRangei before = { full.start, buf->validRange.start };
const iRangei after = { buf->validRange.end, full.end };
const iRangei region = intersect_Rangei(d->vis, (iRangei){ buf->origin,
buf->origin + d->texSize.y });
out_invalidRanges[i] = intersect_Rangei(before, region);
if (isEmpty_Rangei(out_invalidRanges[i])) {
out_invalidRanges[i] = intersect_Rangei(after, region);
}
}
}
void validate_VisBuf(iVisBuf *d) {
iForIndices(i, d->buffers) {
iVisBufTexture *buf = &d->buffers[i];
buf->validRange =
intersect_Rangei(d->vis, (iRangei){ buf->origin, buf->origin + d->texSize.y });
}
}
void draw_VisBuf(const iVisBuf *d, iInt2 topLeft) {
SDL_Renderer *render = renderer_Window(get_Window());
iForIndices(i, d->buffers) {
const iVisBufTexture *buf = d->buffers + i;
SDL_RenderCopy(render,
buf->texture,
NULL,
&(SDL_Rect){ topLeft.x,
topLeft.y + buf->origin,
d->texSize.x,
d->texSize.y });
}
}
|
