2009-08-13 23:13:25 +02:00
|
|
|
/*
|
2011-04-21 23:14:28 +02:00
|
|
|
* Copyright © 2009 Red Hat, Inc.
|
2009-08-13 23:13:25 +02:00
|
|
|
*
|
2010-04-22 06:11:43 +02:00
|
|
|
* This is part of HarfBuzz, a text shaping library.
|
2009-08-13 23:13:25 +02:00
|
|
|
*
|
|
|
|
* Permission is hereby granted, without written agreement and without
|
|
|
|
* license or royalty fees, to use, copy, modify, and distribute this
|
|
|
|
* software and its documentation for any purpose, provided that the
|
|
|
|
* above copyright notice and the following two paragraphs appear in
|
|
|
|
* all copies of this software.
|
|
|
|
*
|
|
|
|
* IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
|
|
|
|
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
|
|
|
|
* ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
|
|
|
|
* IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
|
|
|
|
* DAMAGE.
|
|
|
|
*
|
|
|
|
* THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
|
|
|
|
* BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
|
|
|
|
* ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
|
|
|
|
* PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
|
|
|
|
*
|
|
|
|
* Red Hat Author(s): Behdad Esfahbod
|
|
|
|
*/
|
|
|
|
|
2011-04-21 00:50:27 +02:00
|
|
|
#include "hb-private.hh"
|
2009-08-13 23:13:25 +02:00
|
|
|
|
|
|
|
#include "hb-shape.h"
|
|
|
|
|
2010-05-13 00:23:21 +02:00
|
|
|
#include "hb-buffer-private.hh"
|
2009-11-05 03:07:03 +01:00
|
|
|
|
2011-08-05 04:31:05 +02:00
|
|
|
#ifdef HAVE_UNISCRIBE
|
|
|
|
# include "hb-uniscribe.h"
|
2010-05-21 15:02:20 +02:00
|
|
|
#endif
|
2011-08-05 04:31:05 +02:00
|
|
|
#ifdef HAVE_OT
|
|
|
|
# include "hb-ot-shape.h"
|
|
|
|
#endif
|
|
|
|
#include "hb-fallback-shape-private.hh"
|
|
|
|
|
|
|
|
typedef hb_bool_t (*hb_shape_func_t) (hb_font_t *font,
|
|
|
|
hb_buffer_t *buffer,
|
|
|
|
const hb_feature_t *features,
|
|
|
|
unsigned int num_features,
|
|
|
|
const char *shaper_options);
|
|
|
|
|
|
|
|
#define HB_SHAPER_IMPLEMENT(name) {#name, hb_##name##_shape}
|
2011-08-08 21:36:24 +02:00
|
|
|
static struct hb_shaper_pair_t {
|
|
|
|
char name[16];
|
2011-08-05 04:31:05 +02:00
|
|
|
hb_shape_func_t func;
|
|
|
|
} shapers[] = {
|
|
|
|
/* v--- Add new shapers in the right place here */
|
|
|
|
#ifdef HAVE_UNISCRIBE
|
|
|
|
HB_SHAPER_IMPLEMENT (uniscribe),
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_OT
|
|
|
|
HB_SHAPER_IMPLEMENT (ot),
|
|
|
|
#endif
|
|
|
|
HB_SHAPER_IMPLEMENT (fallback) /* should be last */
|
|
|
|
};
|
|
|
|
#undef HB_SHAPER_IMPLEMENT
|
|
|
|
|
2011-08-06 00:02:30 +02:00
|
|
|
static struct static_shaper_list_t
|
|
|
|
{
|
2011-08-05 23:54:25 +02:00
|
|
|
static_shaper_list_t (void)
|
|
|
|
{
|
2011-08-05 04:31:05 +02:00
|
|
|
char *env = getenv ("HB_SHAPER_LIST");
|
2011-08-08 21:36:24 +02:00
|
|
|
if (env && *env)
|
|
|
|
{
|
|
|
|
/* Reorder shaper list to prefer requested shaper list. */
|
|
|
|
unsigned int i = 0;
|
|
|
|
char *end, *p = env;
|
|
|
|
for (;;) {
|
|
|
|
end = strchr (p, ',');
|
|
|
|
if (!end)
|
|
|
|
end = p + strlen (p);
|
|
|
|
|
|
|
|
for (unsigned int j = i; j < ARRAY_LENGTH (shapers); j++)
|
|
|
|
if (end - p == strlen (shapers[j].name) &&
|
|
|
|
0 == strncmp (shapers[j].name, p, end - p))
|
|
|
|
{
|
|
|
|
/* Reorder this shaper to position i */
|
|
|
|
struct hb_shaper_pair_t t = shapers[j];
|
|
|
|
memmove (&shapers[i + 1], &shapers[i], sizeof (shapers[i]) * (j - i));
|
|
|
|
shapers[i] = t;
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!*end)
|
|
|
|
break;
|
|
|
|
else
|
|
|
|
p = end + 1;
|
|
|
|
}
|
2011-08-06 01:48:49 +02:00
|
|
|
}
|
2011-08-05 23:54:25 +02:00
|
|
|
|
2011-08-08 21:36:24 +02:00
|
|
|
ASSERT_STATIC ((ARRAY_LENGTH (shapers) + 1) * sizeof (*shaper_list) <= sizeof (shaper_list));
|
|
|
|
unsigned int i;
|
|
|
|
for (i = 0; i < ARRAY_LENGTH (shapers); i++)
|
|
|
|
shaper_list[i] = shapers[i].name;
|
|
|
|
shaper_list[i] = NULL;
|
2011-08-05 23:54:25 +02:00
|
|
|
}
|
|
|
|
|
2011-08-08 21:36:24 +02:00
|
|
|
const char *shaper_list[ARRAY_LENGTH (shapers) + 1];
|
2011-08-06 01:48:49 +02:00
|
|
|
} static_shaper_list;
|
|
|
|
|
|
|
|
const char **
|
|
|
|
hb_shape_list_shapers (void)
|
|
|
|
{
|
|
|
|
return static_shaper_list.shaper_list;
|
|
|
|
}
|
2011-08-05 04:31:05 +02:00
|
|
|
|
|
|
|
hb_bool_t
|
2011-08-05 23:22:19 +02:00
|
|
|
hb_shape_full (hb_font_t *font,
|
|
|
|
hb_buffer_t *buffer,
|
|
|
|
const hb_feature_t *features,
|
|
|
|
unsigned int num_features,
|
|
|
|
const char *shaper_options,
|
|
|
|
const char **shaper_list)
|
2011-03-16 18:53:32 +01:00
|
|
|
{
|
2011-08-05 04:31:05 +02:00
|
|
|
if (likely (!shaper_list)) {
|
|
|
|
for (unsigned int i = 0; i < ARRAY_LENGTH (shapers); i++)
|
|
|
|
if (likely (shapers[i].func (font, buffer,
|
|
|
|
features, num_features,
|
|
|
|
shaper_options)))
|
|
|
|
return TRUE;
|
|
|
|
} else {
|
|
|
|
while (*shaper_list) {
|
|
|
|
for (unsigned int i = 0; i < ARRAY_LENGTH (shapers); i++)
|
2011-08-07 09:43:46 +02:00
|
|
|
if (0 == strcmp (*shaper_list, shapers[i].name)) {
|
|
|
|
if (likely (shapers[i].func (font, buffer,
|
|
|
|
features, num_features,
|
|
|
|
shaper_options)))
|
|
|
|
return TRUE;
|
|
|
|
break;
|
|
|
|
}
|
2011-08-05 04:31:05 +02:00
|
|
|
shaper_list++;
|
2011-03-16 18:53:32 +01:00
|
|
|
}
|
|
|
|
}
|
2011-08-05 04:31:05 +02:00
|
|
|
return FALSE;
|
2011-03-16 18:53:32 +01:00
|
|
|
}
|
2011-08-05 23:22:19 +02:00
|
|
|
|
|
|
|
void
|
|
|
|
hb_shape (hb_font_t *font,
|
|
|
|
hb_buffer_t *buffer,
|
|
|
|
const hb_feature_t *features,
|
|
|
|
unsigned int num_features)
|
|
|
|
{
|
|
|
|
hb_shape_full (font, buffer, features, num_features, NULL, NULL);
|
|
|
|
}
|