| xf.li | bdd93d5 | 2023-05-12 07:10:14 -0700 | [diff] [blame] | 1 | /* Copyright (C) 1996-2016 Free Software Foundation, Inc. | 
|  | 2 | This file is part of the GNU C Library. | 
|  | 3 | Contributed by Ulrich Drepper <drepper@gnu.org>, 1996. | 
|  | 4 |  | 
|  | 5 | This program is free software; you can redistribute it and/or modify | 
|  | 6 | it under the terms of the GNU General Public License as published | 
|  | 7 | by the Free Software Foundation; version 2 of the License, or | 
|  | 8 | (at your option) any later version. | 
|  | 9 |  | 
|  | 10 | This program is distributed in the hope that it will be useful, | 
|  | 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of | 
|  | 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the | 
|  | 13 | GNU General Public License for more details. | 
|  | 14 |  | 
|  | 15 | You should have received a copy of the GNU General Public License | 
|  | 16 | along with this program; if not, see <http://www.gnu.org/licenses/>.  */ | 
|  | 17 |  | 
|  | 18 | #ifndef _CHARMAP_H | 
|  | 19 | #define _CHARMAP_H | 
|  | 20 |  | 
|  | 21 | #include <obstack.h> | 
|  | 22 | #include <stdbool.h> | 
|  | 23 | #include <stdint.h> | 
|  | 24 |  | 
|  | 25 | #include "repertoire.h" | 
|  | 26 | #include "simple-hash.h" | 
|  | 27 |  | 
|  | 28 |  | 
|  | 29 | struct width_rule | 
|  | 30 | { | 
|  | 31 | struct charseq *from; | 
|  | 32 | struct charseq *to; | 
|  | 33 | unsigned int width; | 
|  | 34 | }; | 
|  | 35 |  | 
|  | 36 |  | 
|  | 37 | struct charmap_t | 
|  | 38 | { | 
|  | 39 | const char *code_set_name; | 
|  | 40 | const char *repertoiremap; | 
|  | 41 | int mb_cur_min; | 
|  | 42 | int mb_cur_max; | 
|  | 43 |  | 
|  | 44 | struct width_rule *width_rules; | 
|  | 45 | size_t nwidth_rules; | 
|  | 46 | size_t nwidth_rules_max; | 
|  | 47 | unsigned int width_default; | 
|  | 48 |  | 
|  | 49 | struct obstack mem_pool; | 
|  | 50 | hash_table char_table; | 
|  | 51 | hash_table byte_table; | 
|  | 52 | hash_table ucs4_table; | 
|  | 53 | }; | 
|  | 54 |  | 
|  | 55 |  | 
|  | 56 | /* This is the structure used for entries in the hash table.  It represents | 
|  | 57 | the sequence of bytes used for the coded character.  */ | 
|  | 58 | struct charseq | 
|  | 59 | { | 
|  | 60 | const char *name; | 
|  | 61 | uint32_t ucs4; | 
|  | 62 | int nbytes; | 
|  | 63 | unsigned char bytes[0]; | 
|  | 64 | }; | 
|  | 65 |  | 
|  | 66 |  | 
|  | 67 | /* True if the encoding is not ASCII compatible.  */ | 
|  | 68 | extern bool enc_not_ascii_compatible; | 
|  | 69 |  | 
|  | 70 |  | 
|  | 71 | /* Prototypes for charmap handling functions.  */ | 
|  | 72 | extern struct charmap_t *charmap_read (const char *filename, int verbose, | 
|  | 73 | int error_not_found, int be_quiet, | 
|  | 74 | int use_default); | 
|  | 75 |  | 
|  | 76 | /* Return the value stored under the given key in the hashing table.  */ | 
|  | 77 | extern struct charseq *charmap_find_value (const struct charmap_t *charmap, | 
|  | 78 | const char *name, size_t len); | 
|  | 79 |  | 
|  | 80 | /* Return symbol for given multibyte sequence.  */ | 
|  | 81 | extern struct charseq *charmap_find_symbol (const struct charmap_t *charmap, | 
|  | 82 | const char *name, size_t len); | 
|  | 83 |  | 
|  | 84 | #endif /* charmap.h */ |