1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
/* Table for builtin transformation mapping.
Copyright (C) 1997, 1998 Free Software Foundation, Inc.
This file is part of the GNU C Library.
Contributed by Ulrich Drepper <drepper@cygnus.com>, 1997.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public License as
published by the Free Software Foundation; either version 2 of the
License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with the GNU C Library; see the file COPYING.LIB. If not,
write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */
#include <limits.h>
#include <string.h>
#include <gconv_int.h>
#include <assert.h>
static struct builtin_map
{
const char *name;
gconv_fct fct;
gconv_init_fct init;
gconv_end_fct end;
int min_needed_from;
int max_needed_from;
int min_needed_to;
int max_needed_to;
} map[] =
{
#define BUILTIN_TRANSFORMATION(From, ConstPfx, ConstLen, To, Cost, Name, \
Fct, Init, End, MinF, MaxF, MinT, MaxT) \
{ \
name: Name, \
fct: Fct, \
init: Init, \
end: End, \
\
min_needed_from: MinF, \
max_needed_from: MaxF, \
min_needed_to: MinT, \
max_needed_to: MaxT \
},
#define BUILTIN_ALIAS(From, To)
#include <gconv_builtin.h>
};
void
internal_function
__gconv_get_builtin_trans (const char *name, struct gconv_step *step)
{
size_t cnt;
for (cnt = 0; cnt < sizeof (map) / sizeof (map[0]); ++cnt)
if (strcmp (name, map[cnt].name) == 0)
break;
assert (cnt < sizeof (map) / sizeof (map[0]));
step->fct = map[cnt].fct;
step->init_fct = map[cnt].init;
step->end_fct = map[cnt].end;
step->counter = INT_MAX;
step->shlib_handle = NULL;
step->min_needed_from = map[cnt].min_needed_from;
step->max_needed_from = map[cnt].max_needed_from;
step->min_needed_to = map[cnt].min_needed_to;
step->max_needed_to = map[cnt].max_needed_to;
}
|
