summaryrefslogtreecommitdiff
path: root/atari/gemtk/redrawslots.c
blob: ee5627dafdcab1078cdf56f177e9ae6314b3e1b4 (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
/*

 * Copyright 2011 Ole Loots <ole@monochrom.net>

 *

 * This file is part of NetSurf, http://www.netsurf-browser.org/

 *

 * NetSurf 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; version 2 of the License.

 *

 * NetSurf 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 this program.  If not, see <http://www.gnu.org/licenses/>.

 */

#include <stdbool.h>
#define WITH_RECT
#include "gemtk.h"
#undef WITH_RECT

void redraw_slots_init(struct s_redrw_slots * slots, short size)
{
    // TODO: allocate slots dynamically!
	slots->size = MIN( MAX_REDRW_SLOTS , size);
	slots->areas_used = 0;
}

void redraw_slots_free(struct s_redrw_slots * slots)
{
    // TOOD: free areas...
}


static inline bool rect_intersect( struct rect * box1, struct rect * box2 )
{
	if (box2->x1 < box1->x0)
 	       return false;

	if (box2->y1 < box1->y0)
        	return false;

	if (box2->x0 > box1->x1)
        	return false;

	if (box2->y0 > box1->y1)
        	return false;

	return true;
}


void redraw_slot_schedule_grect(struct s_redrw_slots * slots, GRECT *area,
                                bool force)
{
    redraw_slot_schedule(slots, area->g_x, area->g_y,
                         area->g_x + area->g_w, area->g_y + area->g_h, force);
}

/*

	schedule redraw coords.

*/
void redraw_slot_schedule(struct s_redrw_slots * slots, short x0, short y0,
                          short x1, short y1, bool force)
{
	int i = 0;
	struct rect area;

	area.x0 = x0;
	area.y0 = y0;
	area.x1 = x1;
	area.y1 = y1;

    if (force == false) {
        for (i=0; i<slots->areas_used; i++) {
            if (slots->areas[i].x0 <= x0
                && slots->areas[i].x1 >= x1
                && slots->areas[i].y0 <= y0
                && slots->areas[i].y1 >= y1) {
                /* the area is already queued for redraw */
                return;
            } else {
                if (rect_intersect(&slots->areas[i], &area )) {
                    slots->areas[i].x0 = MIN(slots->areas[i].x0, x0);
                    slots->areas[i].y0 = MIN(slots->areas[i].y0, y0);
                    slots->areas[i].x1 = MAX(slots->areas[i].x1, x1);
                    slots->areas[i].y1 = MAX(slots->areas[i].y1, y1);
                    return;
                }
            }
        }
	}

	if (slots->areas_used < slots->size) {
		slots->areas[slots->areas_used].x0 = x0;
		slots->areas[slots->areas_used].x1 = x1;
		slots->areas[slots->areas_used].y0 = y0;
		slots->areas[slots->areas_used].y1 = y1;
		slots->areas_used++;
	} else {
		/*

			we are out of available slots, merge box with last slot

			this is dumb... but also a very rare case.

		*/
		slots->areas[slots->size-1].x0 = MIN(slots->areas[i].x0, x0);
		slots->areas[slots->size-1].y0 = MIN(slots->areas[i].y0, y0);
		slots->areas[slots->size-1].x1 = MAX(slots->areas[i].x1, x1);
		slots->areas[slots->size-1].y1 = MAX(slots->areas[i].y1, y1);
	}
done:
	return;
}

void redraw_slots_remove_area(struct s_redrw_slots * slots, int i)
{
    int x;
    for(x = i+1; i<slots->areas_used; x++){
        slots->areas[x-1] = slots->areas[x];
    }
    slots->areas_used--;
}