hb-ot-shape-normalize.cc revision 5c6f5982d78e2d7fadc2fbb8b4f3a4be9420c59a 
1/*
2 * Copyright © 2011  Google, Inc.
3 *
4 *  This is part of HarfBuzz, a text shaping library.
5 *
6 * Permission is hereby granted, without written agreement and without
7 * license or royalty fees, to use, copy, modify, and distribute this
8 * software and its documentation for any purpose, provided that the
9 * above copyright notice and the following two paragraphs appear in
10 * all copies of this software.
11 *
12 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
13 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
14 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
15 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
16 * DAMAGE.
17 *
18 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
19 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
20 * FITNESS FOR A PARTICULAR PURPOSE.  THE SOFTWARE PROVIDED HEREUNDER IS
21 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
22 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
23 *
24 * Google Author(s): Behdad Esfahbod
25 */
26
27#include "hb-ot-shape-private.hh"
28
29HB_BEGIN_DECLS
30
31static bool
32get_glyph (hb_ot_shape_context_t *c, unsigned int i)
33{
34  hb_buffer_t *b = c->buffer;
35
36  return hb_font_get_glyph (c->font, b->info[i].codepoint, 0, &b->info[i].intermittent_glyph());
37}
38
39static bool
40handle_single_char_cluster (hb_ot_shape_context_t *c,
41			    unsigned int i)
42{
43  if (get_glyph (c, i))
44    return FALSE;
45
46  /* Decompose */
47
48  return FALSE;
49}
50
51static bool
52handle_multi_char_cluster (hb_ot_shape_context_t *c,
53			   unsigned int i,
54			   unsigned int end)
55{
56  /* If there's a variation-selector, give-up, it's just too hard. */
57  return FALSE;
58}
59
60bool
61_hb_normalize (hb_ot_shape_context_t *c)
62{
63  hb_buffer_t *b = c->buffer;
64  bool changed = FALSE;
65
66  unsigned int count = b->len;
67  for (unsigned int i = 0; i < count;) {
68    unsigned int end;
69    for (end = i + 1; end < count; end++)
70      if (b->info[i].cluster != b->info[end].cluster)
71        break;
72    if (i + 1 == end)
73      changed |= handle_single_char_cluster (c, i);
74    else
75      changed |= handle_multi_char_cluster (c, i, end);
76    i = end;
77  }
78
79  return changed;
80}
81
82HB_END_DECLS
83