2006-05-29 08:59:36 +00:00
|
|
|
/*
|
|
|
|
* Clutter.
|
|
|
|
*
|
|
|
|
* An OpenGL based 'interactive canvas' library.
|
|
|
|
*
|
|
|
|
* Authored By Matthew Allum <mallum@openedhand.com>
|
|
|
|
*
|
|
|
|
* Copyright (C) 2006 OpenedHand
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library 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
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
2010-03-01 12:56:10 +00:00
|
|
|
* License along with this library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*
|
|
|
|
*
|
2006-05-29 08:59:36 +00:00
|
|
|
*/
|
|
|
|
|
2015-01-03 20:34:20 +00:00
|
|
|
/**
|
|
|
|
* SECTION:clutter-util
|
|
|
|
* @short_description: Utility functions
|
|
|
|
*
|
|
|
|
* Various miscellaneous utilility functions.
|
|
|
|
*/
|
|
|
|
|
2016-05-05 14:21:51 +00:00
|
|
|
#include "clutter-build-config.h"
|
2010-06-03 11:56:17 +00:00
|
|
|
|
2019-05-17 23:11:43 +00:00
|
|
|
#include <fribidi.h>
|
2012-09-03 19:54:43 +00:00
|
|
|
#include <math.h>
|
|
|
|
|
|
|
|
#include "clutter-debug.h"
|
2006-05-29 08:59:36 +00:00
|
|
|
#include "clutter-main.h"
|
2012-03-15 11:02:30 +00:00
|
|
|
#include "clutter-interval.h"
|
2012-03-07 12:34:06 +00:00
|
|
|
#include "clutter-private.h"
|
|
|
|
|
2010-09-08 19:39:15 +00:00
|
|
|
/* Help macros to scale from OpenGL <-1,1> coordinates system to
|
|
|
|
* window coordinates ranging [0,window-size]
|
|
|
|
*/
|
|
|
|
#define MTX_GL_SCALE_X(x,w,v1,v2) ((((((x) / (w)) + 1.0f) / 2.0f) * (v1)) + (v2))
|
|
|
|
#define MTX_GL_SCALE_Y(y,w,v1,v2) ((v1) - (((((y) / (w)) + 1.0f) / 2.0f) * (v1)) + (v2))
|
|
|
|
#define MTX_GL_SCALE_Z(z,w,v1,v2) (MTX_GL_SCALE_X ((z), (w), (v1), (v2)))
|
|
|
|
|
2020-09-09 22:45:20 +00:00
|
|
|
typedef struct
|
|
|
|
{
|
|
|
|
float x;
|
|
|
|
float y;
|
|
|
|
float z;
|
|
|
|
float w;
|
|
|
|
} ClutterVertex4;
|
|
|
|
|
2010-09-08 19:39:15 +00:00
|
|
|
void
|
2020-09-11 18:57:28 +00:00
|
|
|
_clutter_util_fully_transform_vertices (const graphene_matrix_t *modelview,
|
|
|
|
const graphene_matrix_t *projection,
|
|
|
|
const float *viewport,
|
2019-02-20 13:18:48 +00:00
|
|
|
const graphene_point3d_t *vertices_in,
|
2020-09-11 18:57:28 +00:00
|
|
|
graphene_point3d_t *vertices_out,
|
|
|
|
int n_vertices)
|
2010-09-08 19:39:15 +00:00
|
|
|
{
|
2020-09-11 18:57:28 +00:00
|
|
|
graphene_matrix_t modelview_projection;
|
2011-02-08 10:37:15 +00:00
|
|
|
ClutterVertex4 *vertices_tmp;
|
2010-09-08 19:39:15 +00:00
|
|
|
int i;
|
|
|
|
|
2011-02-08 10:37:15 +00:00
|
|
|
vertices_tmp = g_alloca (sizeof (ClutterVertex4) * n_vertices);
|
|
|
|
|
|
|
|
if (n_vertices >= 4)
|
|
|
|
{
|
|
|
|
/* XXX: we should find a way to cache this per actor */
|
2020-09-11 20:50:33 +00:00
|
|
|
graphene_matrix_multiply (modelview, projection, &modelview_projection);
|
|
|
|
|
2020-09-11 18:14:26 +00:00
|
|
|
cogl_graphene_matrix_project_points (&modelview_projection,
|
|
|
|
3,
|
|
|
|
sizeof (graphene_point3d_t),
|
|
|
|
vertices_in,
|
|
|
|
sizeof (ClutterVertex4),
|
|
|
|
vertices_tmp,
|
|
|
|
n_vertices);
|
2011-02-08 10:37:15 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2020-09-11 18:14:26 +00:00
|
|
|
cogl_graphene_matrix_transform_points (modelview,
|
|
|
|
3,
|
|
|
|
sizeof (graphene_point3d_t),
|
|
|
|
vertices_in,
|
|
|
|
sizeof (ClutterVertex4),
|
|
|
|
vertices_tmp,
|
|
|
|
n_vertices);
|
2011-02-08 10:37:15 +00:00
|
|
|
|
2020-09-11 18:14:26 +00:00
|
|
|
cogl_graphene_matrix_project_points (projection,
|
|
|
|
3,
|
|
|
|
sizeof (ClutterVertex4),
|
|
|
|
vertices_tmp,
|
|
|
|
sizeof (ClutterVertex4),
|
|
|
|
vertices_tmp,
|
|
|
|
n_vertices);
|
2011-02-08 10:37:15 +00:00
|
|
|
}
|
2010-09-08 19:39:15 +00:00
|
|
|
|
|
|
|
for (i = 0; i < n_vertices; i++)
|
|
|
|
{
|
2011-02-08 10:37:15 +00:00
|
|
|
ClutterVertex4 vertex_tmp = vertices_tmp[i];
|
2019-02-20 13:18:48 +00:00
|
|
|
graphene_point3d_t *vertex_out = &vertices_out[i];
|
2010-09-08 19:39:15 +00:00
|
|
|
/* Finally translate from OpenGL coords to window coords */
|
2020-10-13 11:23:56 +00:00
|
|
|
vertex_out->x = MTX_GL_SCALE_X (vertex_tmp.x,
|
|
|
|
vertex_tmp.w,
|
|
|
|
viewport[2],
|
|
|
|
viewport[0]);
|
|
|
|
vertex_out->y = MTX_GL_SCALE_Y (vertex_tmp.y,
|
|
|
|
vertex_tmp.w,
|
|
|
|
viewport[3],
|
|
|
|
viewport[1]);
|
|
|
|
clutter_round_to_256ths (&vertex_out->x);
|
|
|
|
clutter_round_to_256ths (&vertex_out->y);
|
2010-09-08 19:39:15 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-03-01 19:50:49 +00:00
|
|
|
void
|
|
|
|
_clutter_util_rect_from_rectangle (const cairo_rectangle_int_t *src,
|
2019-02-20 15:23:04 +00:00
|
|
|
graphene_rect_t *dest)
|
2019-03-01 14:43:14 +00:00
|
|
|
{
|
2019-02-20 15:23:04 +00:00
|
|
|
*dest = (graphene_rect_t) {
|
2019-03-01 14:43:14 +00:00
|
|
|
.origin = {
|
|
|
|
.x = src->x,
|
|
|
|
.y = src->y
|
|
|
|
},
|
|
|
|
.size = {
|
|
|
|
.width = src->width,
|
|
|
|
.height = src->height
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2019-03-01 19:50:49 +00:00
|
|
|
void
|
2019-02-20 15:23:04 +00:00
|
|
|
_clutter_util_rectangle_int_extents (const graphene_rect_t *src,
|
2019-03-01 19:50:49 +00:00
|
|
|
cairo_rectangle_int_t *dest)
|
2019-03-01 14:43:14 +00:00
|
|
|
{
|
2019-02-20 15:23:04 +00:00
|
|
|
graphene_rect_t tmp = *src;
|
2019-03-01 14:43:14 +00:00
|
|
|
|
2019-02-20 15:23:04 +00:00
|
|
|
graphene_rect_round_extents (&tmp, &tmp);
|
2019-03-01 14:43:14 +00:00
|
|
|
|
|
|
|
*dest = (cairo_rectangle_int_t) {
|
|
|
|
.x = tmp.origin.x,
|
|
|
|
.y = tmp.origin.y,
|
|
|
|
.width = tmp.size.width,
|
|
|
|
.height = tmp.size.height,
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2019-03-01 19:50:49 +00:00
|
|
|
void
|
|
|
|
_clutter_util_rectangle_offset (const cairo_rectangle_int_t *src,
|
|
|
|
int x,
|
|
|
|
int y,
|
|
|
|
cairo_rectangle_int_t *dest)
|
2019-03-01 14:43:14 +00:00
|
|
|
{
|
|
|
|
*dest = *src;
|
|
|
|
|
|
|
|
dest->x += x;
|
|
|
|
dest->y += y;
|
|
|
|
}
|
|
|
|
|
2011-08-16 15:01:22 +00:00
|
|
|
/*< private >
|
|
|
|
* _clutter_util_rectangle_union:
|
|
|
|
* @src1: first rectangle to union
|
|
|
|
* @src2: second rectangle to union
|
|
|
|
* @dest: (out): return location for the unioned rectangle
|
|
|
|
*
|
|
|
|
* Calculates the union of two rectangles.
|
|
|
|
*
|
|
|
|
* The union of rectangles @src1 and @src2 is the smallest rectangle which
|
|
|
|
* includes both @src1 and @src2 within it.
|
|
|
|
*
|
|
|
|
* It is allowed for @dest to be the same as either @src1 or @src2.
|
|
|
|
*
|
|
|
|
* This function should really be in Cairo.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
_clutter_util_rectangle_union (const cairo_rectangle_int_t *src1,
|
|
|
|
const cairo_rectangle_int_t *src2,
|
|
|
|
cairo_rectangle_int_t *dest)
|
|
|
|
{
|
|
|
|
int dest_x, dest_y;
|
|
|
|
|
|
|
|
dest_x = MIN (src1->x, src2->x);
|
|
|
|
dest_y = MIN (src1->y, src2->y);
|
|
|
|
|
|
|
|
dest->width = MAX (src1->x + src1->width, src2->x + src2->width) - dest_x;
|
|
|
|
dest->height = MAX (src1->y + src1->height, src2->y + src2->height) - dest_y;
|
|
|
|
dest->x = dest_x;
|
|
|
|
dest->y = dest_y;
|
|
|
|
}
|
2012-03-15 11:02:30 +00:00
|
|
|
|
Introduce regional stage rendering
Add support for drawing a stage using multiple framebuffers each making
up one part of the stage. This works by the stage backend
(ClutterStageWindow) providing a list of views which will be for
splitting up the stage in different regions.
A view layout, for now, is a set of rectangles. The stage window (i.e.
stage "backend" will use this information when drawing a frame, using
one framebuffer for each view. The scene graph is adapted to explictly
take a view when painting the stage. It will use this view, its
assigned framebuffer and layout to offset and clip the drawing
accordingly.
This effectively removes any notion of "stage framebuffer", since each
stage now may consist of multiple framebuffers. Therefore, API
involving this has been deprecated and made no-ops; namely
clutter_stage_ensure_context(). Callers are now assumed to either
always use a framebuffer reference explicitly, or push/pop the
framebuffer of a given view where the code has not yet changed to use
the explicit-buffer-using cogl API.
Currently only the nested X11 backend supports this mode fully, and the
per view framebuffers are all offscreen. Upon frame completion, it'll
blit each view's framebuffer onto the onscreen framebuffer before
swapping.
Other backends (X11 CM and native/KMS) are adapted to manage a
full-stage view. The X11 CM backend will continue to use this method,
while the native/KMS backend will be adopted to use multiple view
drawing.
https://bugzilla.gnome.org/show_bug.cgi?id=768976
2016-05-27 03:09:24 +00:00
|
|
|
gboolean
|
|
|
|
_clutter_util_rectangle_intersection (const cairo_rectangle_int_t *src1,
|
|
|
|
const cairo_rectangle_int_t *src2,
|
|
|
|
cairo_rectangle_int_t *dest)
|
|
|
|
{
|
|
|
|
int x1, y1, x2, y2;
|
|
|
|
|
|
|
|
x1 = MAX (src1->x, src2->x);
|
|
|
|
y1 = MAX (src1->y, src2->y);
|
|
|
|
|
|
|
|
x2 = MIN (src1->x + (int) src1->width, src2->x + (int) src2->width);
|
|
|
|
y2 = MIN (src1->y + (int) src1->height, src2->y + (int) src2->height);
|
|
|
|
|
|
|
|
if (x1 >= x2 || y1 >= y2)
|
|
|
|
{
|
|
|
|
dest->x = 0;
|
|
|
|
dest->y = 0;
|
|
|
|
dest->width = 0;
|
|
|
|
dest->height = 0;
|
|
|
|
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
dest->x = x1;
|
|
|
|
dest->y = y1;
|
|
|
|
dest->width = x2 - x1;
|
|
|
|
dest->height = y2 - y1;
|
|
|
|
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-02-06 09:12:54 +00:00
|
|
|
gboolean
|
|
|
|
clutter_util_rectangle_equal (const cairo_rectangle_int_t *src1,
|
|
|
|
const cairo_rectangle_int_t *src2)
|
|
|
|
{
|
|
|
|
return ((src1->x == src2->x) &&
|
|
|
|
(src1->y == src2->y) &&
|
|
|
|
(src1->width == src2->width) &&
|
|
|
|
(src1->height == src2->height));
|
|
|
|
}
|
|
|
|
|
2012-03-15 11:02:30 +00:00
|
|
|
typedef struct
|
|
|
|
{
|
|
|
|
GType value_type;
|
|
|
|
ClutterProgressFunc func;
|
|
|
|
} ProgressData;
|
|
|
|
|
|
|
|
G_LOCK_DEFINE_STATIC (progress_funcs);
|
|
|
|
static GHashTable *progress_funcs = NULL;
|
|
|
|
|
|
|
|
gboolean
|
|
|
|
_clutter_has_progress_function (GType gtype)
|
|
|
|
{
|
|
|
|
const char *type_name = g_type_name (gtype);
|
|
|
|
|
|
|
|
if (progress_funcs == NULL)
|
|
|
|
return FALSE;
|
|
|
|
|
|
|
|
return g_hash_table_lookup (progress_funcs, type_name) != NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
gboolean
|
|
|
|
_clutter_run_progress_function (GType gtype,
|
|
|
|
const GValue *initial,
|
|
|
|
const GValue *final,
|
|
|
|
gdouble progress,
|
|
|
|
GValue *retval)
|
|
|
|
{
|
|
|
|
ProgressData *pdata;
|
|
|
|
gboolean res;
|
|
|
|
|
|
|
|
G_LOCK (progress_funcs);
|
|
|
|
|
|
|
|
if (G_UNLIKELY (progress_funcs == NULL))
|
|
|
|
{
|
|
|
|
res = FALSE;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
pdata = g_hash_table_lookup (progress_funcs, g_type_name (gtype));
|
|
|
|
if (G_UNLIKELY (pdata == NULL))
|
|
|
|
{
|
|
|
|
res = FALSE;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
res = pdata->func (initial, final, progress, retval);
|
|
|
|
|
|
|
|
out:
|
|
|
|
G_UNLOCK (progress_funcs);
|
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
progress_data_destroy (gpointer data_)
|
|
|
|
{
|
2020-10-19 17:57:45 +00:00
|
|
|
g_free (data_);
|
2012-03-15 11:02:30 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* clutter_interval_register_progress_func: (skip)
|
|
|
|
* @value_type: a #GType
|
|
|
|
* @func: a #ClutterProgressFunc, or %NULL to unset a previously
|
|
|
|
* set progress function
|
|
|
|
*
|
|
|
|
* Sets the progress function for a given @value_type, like:
|
|
|
|
*
|
2022-05-25 16:41:48 +00:00
|
|
|
* ```c
|
2012-03-15 11:02:30 +00:00
|
|
|
* clutter_interval_register_progress_func (MY_TYPE_FOO,
|
|
|
|
* my_foo_progress);
|
2022-05-25 16:41:48 +00:00
|
|
|
* ```
|
2012-03-15 11:02:30 +00:00
|
|
|
*
|
2022-05-25 16:41:48 +00:00
|
|
|
* Whenever a [class@Interval] instance using the default
|
|
|
|
* [method@Interval.compute_value] implementation is set as an
|
|
|
|
* interval between two [struct@GObject.Value] of type @value_type, it will call
|
2012-03-15 11:02:30 +00:00
|
|
|
* @func to establish the value depending on the given progress,
|
|
|
|
* for instance:
|
|
|
|
*
|
2022-05-25 16:41:48 +00:00
|
|
|
* ```c
|
2012-03-15 11:02:30 +00:00
|
|
|
* static gboolean
|
|
|
|
* my_int_progress (const GValue *a,
|
|
|
|
* const GValue *b,
|
|
|
|
* gdouble progress,
|
|
|
|
* GValue *retval)
|
|
|
|
* {
|
|
|
|
* gint ia = g_value_get_int (a);
|
|
|
|
* gint ib = g_value_get_int (b);
|
|
|
|
* gint res = factor * (ib - ia) + ia;
|
|
|
|
*
|
|
|
|
* g_value_set_int (retval, res);
|
|
|
|
*
|
|
|
|
* return TRUE;
|
|
|
|
* }
|
|
|
|
*
|
|
|
|
* clutter_interval_register_progress_func (G_TYPE_INT, my_int_progress);
|
2022-05-25 16:41:48 +00:00
|
|
|
* ```
|
2012-03-15 11:02:30 +00:00
|
|
|
*
|
2022-05-25 16:41:48 +00:00
|
|
|
* To unset a previously set progress function of a [alias@GObject.Type], pass %NULL
|
2012-03-15 11:02:30 +00:00
|
|
|
* for @func.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
clutter_interval_register_progress_func (GType value_type,
|
|
|
|
ClutterProgressFunc func)
|
|
|
|
{
|
|
|
|
ProgressData *progress_func;
|
|
|
|
const char *type_name;
|
|
|
|
|
|
|
|
g_return_if_fail (value_type != G_TYPE_INVALID);
|
|
|
|
|
|
|
|
type_name = g_type_name (value_type);
|
|
|
|
|
|
|
|
G_LOCK (progress_funcs);
|
|
|
|
|
|
|
|
if (G_UNLIKELY (progress_funcs == NULL))
|
|
|
|
progress_funcs = g_hash_table_new_full (NULL, NULL,
|
|
|
|
NULL,
|
|
|
|
progress_data_destroy);
|
|
|
|
|
|
|
|
progress_func =
|
|
|
|
g_hash_table_lookup (progress_funcs, type_name);
|
|
|
|
|
|
|
|
if (G_UNLIKELY (progress_func))
|
|
|
|
{
|
|
|
|
if (func == NULL)
|
|
|
|
{
|
|
|
|
g_hash_table_remove (progress_funcs, type_name);
|
2020-10-19 17:57:45 +00:00
|
|
|
g_free (progress_func);
|
2012-03-15 11:02:30 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
progress_func->func = func;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2020-10-19 17:57:45 +00:00
|
|
|
progress_func = g_new0 (ProgressData, 1);
|
2012-03-15 11:02:30 +00:00
|
|
|
progress_func->value_type = value_type;
|
|
|
|
progress_func->func = func;
|
|
|
|
|
|
|
|
g_hash_table_replace (progress_funcs,
|
|
|
|
(gpointer) type_name,
|
|
|
|
progress_func);
|
|
|
|
}
|
|
|
|
|
|
|
|
G_UNLOCK (progress_funcs);
|
|
|
|
}
|
2019-05-17 23:11:43 +00:00
|
|
|
|
|
|
|
PangoDirection
|
|
|
|
_clutter_pango_unichar_direction (gunichar ch)
|
|
|
|
{
|
|
|
|
FriBidiCharType fribidi_ch_type;
|
|
|
|
|
|
|
|
G_STATIC_ASSERT (sizeof (FriBidiChar) == sizeof (gunichar));
|
|
|
|
|
|
|
|
fribidi_ch_type = fribidi_get_bidi_type (ch);
|
|
|
|
|
|
|
|
if (!FRIBIDI_IS_STRONG (fribidi_ch_type))
|
|
|
|
return PANGO_DIRECTION_NEUTRAL;
|
|
|
|
else if (FRIBIDI_IS_RTL (fribidi_ch_type))
|
|
|
|
return PANGO_DIRECTION_RTL;
|
|
|
|
else
|
|
|
|
return PANGO_DIRECTION_LTR;
|
|
|
|
}
|
|
|
|
|
|
|
|
PangoDirection
|
|
|
|
_clutter_pango_find_base_dir (const gchar *text,
|
|
|
|
gint length)
|
|
|
|
{
|
|
|
|
PangoDirection dir = PANGO_DIRECTION_NEUTRAL;
|
|
|
|
const gchar *p;
|
|
|
|
|
|
|
|
g_return_val_if_fail (text != NULL || length == 0, PANGO_DIRECTION_NEUTRAL);
|
|
|
|
|
|
|
|
p = text;
|
|
|
|
while ((length < 0 || p < text + length) && *p)
|
|
|
|
{
|
|
|
|
gunichar wc = g_utf8_get_char (p);
|
|
|
|
|
|
|
|
dir = _clutter_pango_unichar_direction (wc);
|
|
|
|
|
|
|
|
if (dir != PANGO_DIRECTION_NEUTRAL)
|
|
|
|
break;
|
|
|
|
|
|
|
|
p = g_utf8_next_char (p);
|
|
|
|
}
|
|
|
|
|
|
|
|
return dir;
|
|
|
|
}
|