1/*
2 * Copyright © 2018 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#ifndef HB_AAT_MAP_HH
28#define HB_AAT_MAP_HH
29
30#include "hb.hh"
31
32
33struct hb_aat_map_t
34{
35 friend struct hb_aat_map_builder_t;
36
37 public:
38 struct range_flags_t
39 {
40 hb_mask_t flags;
41 unsigned cluster_first;
42 unsigned cluster_last; // end - 1
43 };
44
45 public:
46 hb_vector_t<hb_sorted_vector_t<range_flags_t>> chain_flags;
47};
48
49struct hb_aat_map_builder_t
50{
51 public:
52
53 HB_INTERNAL hb_aat_map_builder_t (hb_face_t *face_,
54 const hb_segment_properties_t props_) :
55 face (face_),
56 props (props_) {}
57
58 HB_INTERNAL void add_feature (const hb_feature_t &feature);
59
60 HB_INTERNAL void compile (hb_aat_map_t &m);
61
62 public:
63 struct feature_info_t
64 {
65 hb_aat_layout_feature_type_t type;
66 hb_aat_layout_feature_selector_t setting;
67 bool is_exclusive;
68 unsigned seq; /* For stable sorting only. */
69
70 HB_INTERNAL static int cmp (const void *pa, const void *pb)
71 {
72 const feature_info_t *a = (const feature_info_t *) pa;
73 const feature_info_t *b = (const feature_info_t *) pb;
74 if (a->type != b->type) return (a->type < b->type ? -1 : 1);
75 if (!a->is_exclusive &&
76 (a->setting & ~1) != (b->setting & ~1)) return (a->setting < b->setting ? -1 : 1);
77 return (a->seq < b->seq ? -1 : a->seq > b->seq ? 1 : 0);
78 }
79
80 /* compares type & setting only */
81 int cmp (const feature_info_t& f) const
82 {
83 return (f.type != type) ? (f.type < type ? -1 : 1) :
84 (f.setting != setting) ? (f.setting < setting ? -1 : 1) : 0;
85 }
86 };
87
88 struct feature_range_t
89 {
90 feature_info_t info;
91 unsigned start;
92 unsigned end;
93 };
94
95 private:
96 struct feature_event_t
97 {
98 unsigned int index;
99 bool start;
100 feature_info_t feature;
101
102 HB_INTERNAL static int cmp (const void *pa, const void *pb) {
103 const feature_event_t *a = (const feature_event_t *) pa;
104 const feature_event_t *b = (const feature_event_t *) pb;
105 return a->index < b->index ? -1 : a->index > b->index ? 1 :
106 a->start < b->start ? -1 : a->start > b->start ? 1 :
107 feature_info_t::cmp (&a->feature, &b->feature);
108 }
109 };
110
111 public:
112 hb_face_t *face;
113 hb_segment_properties_t props;
114
115 public:
116 hb_sorted_vector_t<feature_range_t> features;
117 hb_sorted_vector_t<feature_info_t> current_features;
118 unsigned range_first = HB_FEATURE_GLOBAL_START;
119 unsigned range_last = HB_FEATURE_GLOBAL_END;
120};
121
122
123#endif /* HB_AAT_MAP_HH */
124