summaryrefslogtreecommitdiff
path: root/hw/xgl/xglarea.c
blob: cdf652d0f6ccf81ff256eb20e6d2e1617882db2d (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
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
/*
 * Copyright © 2005 Novell, Inc.
 *
 * Permission to use, copy, modify, distribute, and sell this software
 * and its documentation for any purpose is hereby granted without
 * fee, provided that the above copyright notice appear in all copies
 * and that both that copyright notice and this permission notice
 * appear in supporting documentation, and that the name of
 * Novell, Inc. not be used in advertising or publicity pertaining to
 * distribution of the software without specific, written prior permission.
 * Novell, Inc. makes no representations about the suitability of this
 * software for any purpose. It is provided "as is" without express or
 * implied warranty.
 *
 * NOVELL, INC. DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN
 * NO EVENT SHALL NOVELL, INC. BE LIABLE FOR ANY SPECIAL, INDIRECT OR
 * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
 * OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
 * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 *
 * Author: David Reveman <davidr@novell.com>
 */

#include "xgl.h"

static Bool
xglAreaMoveIn (xglAreaPtr pArea,
	       pointer	  closure)
{
    pArea->closure = closure;
    pArea->state   = xglAreaOccupied;

    return (*pArea->pRoot->funcs->MoveIn) (pArea, closure);
}

static void
xglAreaMoveOut (xglAreaPtr pArea)
{
    (*pArea->pRoot->funcs->MoveOut) (pArea, pArea->closure);

    pArea->closure = (pointer) 0;
    pArea->state   = xglAreaAvailable;
}

static xglAreaPtr
xglAreaCreate (xglRootAreaPtr pRoot,
	       int	      level,
	       int	      x,
	       int	      y,
	       int	      width,
	       int	      height)
{
    xglAreaPtr pArea;
    int	       n = 4;

    pArea = xalloc (sizeof (xglAreaRec) + pRoot->devPrivateSize);
    if (!pArea)
	return NULL;

    pArea->level   = level;
    pArea->x	   = x;
    pArea->y	   = y;
    pArea->width   = width;
    pArea->height  = height;
    pArea->pRoot   = pRoot;
    pArea->closure = (pointer) 0;
    pArea->state   = xglAreaAvailable;

    while (n--)
	pArea->pArea[n] = NULL;

    if (pRoot->devPrivateSize)
	pArea->devPrivate.ptr = pArea + 1;
    else
	pArea->devPrivate.ptr = (pointer) 0;

    if (!(*pArea->pRoot->funcs->Create) (pArea))
    {
	free (pArea);
	return NULL;
    }

    return pArea;
}

static void
xglAreaDestroy (xglAreaPtr pArea)
{
    if (!pArea)
	return;

    if (pArea->state == xglAreaOccupied)
    {
	xglAreaMoveOut (pArea);
    }
    else
    {
	int n = 4;

	while (n--)
	    xglAreaDestroy (pArea->pArea[n]);
    }

    xfree (pArea);
}

static xglAreaPtr
xglAreaGetTopScoredSubArea (xglAreaPtr pArea)
{
    if (!pArea)
	return NULL;

    switch (pArea->state) {
    case xglAreaOccupied:
	return pArea;
    case xglAreaAvailable:
	break;
    case xglAreaDivided: {
	xglAreaPtr tmp, top = NULL;
	int	   i;

	for (i = 0; i < 4; i++)
	{
	    tmp = xglAreaGetTopScoredSubArea (pArea->pArea[i]);
	    if (tmp && top)
	    {
		if ((*pArea->pRoot->funcs->CompareScore) (tmp,
							  tmp->closure,
							  top->closure) > 0)
		    top = tmp;
	    }
	    else if (tmp)
	    {
		top = tmp;
	    }
	}
	return top;
    }
    }

    return NULL;
}

static Bool
xglAreaFind (xglAreaPtr pArea,
	     int	width,
	     int	height,
	     Bool	kickOut,
	     pointer	closure)
{
    if (pArea->width < width || pArea->height < height)
	return FALSE;

    switch (pArea->state) {
    case xglAreaOccupied:
	if (kickOut)
	{
	    if ((*pArea->pRoot->funcs->CompareScore) (pArea,
						      pArea->closure,
						      closure) >= 0)
		return FALSE;

	    xglAreaMoveOut (pArea);
	} else
	    return FALSE;

    /* fall-through */
    case xglAreaAvailable:
    {
	if (pArea->level == pArea->pRoot->maxLevel ||
	    (pArea->width == width && pArea->height == height))
	{
	    if (xglAreaMoveIn (pArea, closure))
		return TRUE;
	}
	else
	{
	    int dx[4], dy[4], w[4], h[4], i;

	    dx[0] = dx[2] = dy[0] = dy[1] = 0;

	    w[0] = w[2] = dx[1] = dx[3] = width;
	    h[0] = h[1] = dy[2] = dy[3] = height;

	    w[1] = w[3] = pArea->width - width;
	    h[2] = h[3] = pArea->height - height;

	    for (i = 0; i < 2; i++)
	    {
		if (w[i])
		    pArea->pArea[i] =
			xglAreaCreate (pArea->pRoot,
				       pArea->level + 1,
				       pArea->x + dx[i],
				       pArea->y + dy[i],
				       w[i], h[i]);
	    }

	    for (; i < 4; i++)
	    {
		if (w[i] && h[i])
		    pArea->pArea[i] =
			xglAreaCreate (pArea->pRoot,
				       pArea->level + 1,
				       pArea->x + dx[i],
				       pArea->y + dy[i],
				       w[i], h[i]);
	    }

	    pArea->state = xglAreaDivided;

	    if (xglAreaFind (pArea->pArea[0], width, height, kickOut, closure))
		return TRUE;
	}
    } break;
    case xglAreaDivided:
    {
	xglAreaPtr topArea;
	int	   i, rejected = FALSE;

	for (i = 0; i < 4; i++)
	{
	    if (pArea->pArea[i])
	    {
		if (pArea->pArea[i]->width >= width &&
		    pArea->pArea[i]->height >= height)
		{
		    if (xglFindArea (pArea->pArea[i], width, height, kickOut,
				     closure))
			return TRUE;

		    rejected = TRUE;
		}
	    }
	}

	if (rejected)
	    return FALSE;

	topArea = xglAreaGetTopScoredSubArea (pArea);
	if (topArea)
	{
	    if (kickOut)
	    {
		if ((*pArea->pRoot->funcs->CompareScore) (topArea,
							  topArea->closure,
							  closure) >= 0)
		    return FALSE;
	    } else
		return FALSE;
	}

	for (i = 0; i < 4; i++)
	{
	    xglAreaDestroy (pArea->pArea[i]);
	    pArea->pArea[i] = NULL;
	}

	pArea->closure = (pointer) 0;
	pArea->state   = xglAreaAvailable;
	if (xglFindArea (pArea, width, height, TRUE, closure))
	    return TRUE;

    } break;
    }

    return FALSE;
}

Bool
xglRootAreaInit (xglRootAreaPtr	    pRoot,
		 int		    maxLevel,
		 int		    width,
		 int		    height,
		 int		    devPrivateSize,
		 xglAreaFuncsPtr    funcs,
		 pointer	    closure)
{
    pRoot->maxLevel	  = maxLevel;
    pRoot->funcs	  = funcs;
    pRoot->devPrivateSize = devPrivateSize;
    pRoot->closure	  = closure;

    pRoot->pArea = xglAreaCreate (pRoot, 0, 0, 0, width, height);
    if (!pRoot->pArea)
	return FALSE;

    return TRUE;
}

void
xglRootAreaFini (xglRootAreaPtr pRoot)
{
    xglAreaDestroy (pRoot->pArea);
}

void
xglLeaveArea (xglAreaPtr pArea)
{
    xglAreaMoveOut (pArea);
}

void
xglWithdrawArea (xglAreaPtr pArea)
{
    pArea->closure = NULL;
    pArea->state   = xglAreaAvailable;
}

Bool
xglFindArea (xglAreaPtr pArea,
	     int	width,
	     int	height,
	     Bool	kickOut,
	     pointer	closure)
{
    if (width < 1 || height < 0)
	return FALSE;

    return xglAreaFind (pArea, width, height, kickOut, closure);
}