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): Garret Rieger
25 */
26
27 #ifndef HB_SUBSET_TEST_H
28 #define HB_SUBSET_TEST_H
29
30 #include <stdio.h>
31
32 #include "hb-test.h"
33 #include "hb-subset.h"
34
35
36 HB_BEGIN_DECLS
37
38 static inline hb_subset_input_t *
hb_subset_test_create_input(const hb_set_t * codepoints)39 hb_subset_test_create_input (const hb_set_t *codepoints)
40 {
41 hb_subset_input_t *input = hb_subset_input_create_or_fail ();
42 hb_set_t * input_codepoints = hb_subset_input_unicode_set (input);
43 hb_set_union (input_codepoints, codepoints);
44 return input;
45 }
46
47 static inline hb_subset_input_t *
hb_subset_test_create_input_from_glyphs(const hb_set_t * glyphs)48 hb_subset_test_create_input_from_glyphs (const hb_set_t *glyphs)
49 {
50 hb_subset_input_t *input = hb_subset_input_create_or_fail ();
51 hb_set_t * input_glyphs = hb_subset_input_glyph_set (input);
52 hb_set_union (input_glyphs, glyphs);
53 return input;
54 }
55
56 static inline hb_subset_input_t *
hb_subset_test_create_input_from_nameids(const hb_set_t * name_ids)57 hb_subset_test_create_input_from_nameids (const hb_set_t *name_ids)
58 {
59 hb_subset_input_t *input = hb_subset_input_create_or_fail ();
60 hb_set_t * input_name_ids = hb_subset_input_set (input, HB_SUBSET_SETS_NAME_ID);
61 hb_set_set (input_name_ids, name_ids);
62
63 hb_set_t *name_langids = hb_subset_input_set (input, HB_SUBSET_SETS_NAME_LANG_ID);
64 hb_set_add_range (name_langids, 0, 0x5FFF);
65
66 hb_subset_input_set_flags (input,
67 HB_SUBSET_FLAGS_NAME_LEGACY);
68 return input;
69 }
70
71 static inline hb_face_t *
hb_subset_test_create_subset(hb_face_t * source,hb_subset_input_t * input)72 hb_subset_test_create_subset (hb_face_t *source,
73 hb_subset_input_t *input)
74 {
75 hb_face_t *subset = hb_subset_or_fail (source, input);
76 g_assert (subset);
77
78 hb_subset_input_destroy (input);
79 return subset;
80 }
81
82 static inline void
hb_subset_test_check(hb_face_t * expected,hb_face_t * actual,hb_tag_t table)83 hb_subset_test_check (hb_face_t *expected,
84 hb_face_t *actual,
85 hb_tag_t table)
86 {
87 hb_blob_t *expected_blob, *actual_blob;
88 expected_blob = hb_face_reference_table (expected, table);
89 actual_blob = hb_face_reference_table (actual, table);
90 fprintf(stderr, "comparing %c%c%c%c, expected %d bytes, actual %d bytes\n", HB_UNTAG(table), hb_blob_get_length(expected_blob), hb_blob_get_length (actual_blob));
91
92 if (hb_blob_get_length (expected_blob) != 0 ||
93 hb_blob_get_length (actual_blob) != 0)
94 hb_test_assert_blobs_equal (expected_blob, actual_blob);
95 hb_blob_destroy (expected_blob);
96 hb_blob_destroy (actual_blob);
97 }
98
99
100 HB_END_DECLS
101
102 #endif /* HB_SUBSET_TEST_H */
103