1 /* Find matching transformation algorithms and initialize steps.
2 Copyright (C) 1997, 1998, 1999, 2000 Free Software Foundation, Inc.
3 This file is part of the GNU C Library.
4 Contributed by Ulrich Drepper <drepper@cygnus.com>, 1997.
6 The GNU C Library is free software; you can redistribute it and/or
7 modify it under the terms of the GNU Library General Public License as
8 published by the Free Software Foundation; either version 2 of the
9 License, or (at your option) any later version.
11 The GNU C Library is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 Library General Public License for more details.
16 You should have received a copy of the GNU Library General Public
17 License along with the GNU C Library; see the file COPYING.LIB. If not,
18 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
25 #include <gconv_int.h>
30 __gconv_open (const char *toset
, const char *fromset
, __gconv_t
*handle
,
33 struct __gconv_step
*steps
;
35 __gconv_t result
= NULL
;
39 res
= __gconv_find_transform (toset
, fromset
, &steps
, &nsteps
, flags
);
40 if (res
== __GCONV_OK
)
42 /* Allocate room for handle. */
43 result
= (__gconv_t
) malloc (sizeof (struct __gconv_info
)
45 * sizeof (struct __gconv_step_data
)));
50 /* Remember the list of steps. */
51 result
->__steps
= steps
;
52 result
->__nsteps
= nsteps
;
54 /* Clear the array for the step data. */
55 memset (result
->__data
, '\0',
56 nsteps
* sizeof (struct __gconv_step_data
));
58 /* Call all initialization functions for the transformation
59 step implementations. */
60 for (cnt
= 0; cnt
< nsteps
- 1; ++cnt
)
64 /* If this is the last step we must not allocate an
66 result
->__data
[cnt
].__is_last
= 0;
68 /* Reset the counter. */
69 result
->__data
[cnt
].__invocation_counter
= 0;
71 /* It's a regular use. */
72 result
->__data
[cnt
].__internal_use
= 0;
74 /* We use the `mbstate_t' member in DATA. */
75 result
->__data
[cnt
].__statep
= &result
->__data
[cnt
].__state
;
77 /* Allocate the buffer. */
78 size
= (GCONV_NCHAR_GOAL
* steps
[cnt
].__max_needed_to
);
80 result
->__data
[cnt
].__outbuf
= (char *) malloc (size
);
81 if (result
->__data
[cnt
].__outbuf
== NULL
)
86 result
->__data
[cnt
].__outbufend
=
87 result
->__data
[cnt
].__outbuf
+ size
;
90 /* Now handle the last entry. */
91 result
->__data
[cnt
].__is_last
= 1;
92 result
->__data
[cnt
].__invocation_counter
= 0;
93 result
->__data
[cnt
].__internal_use
= 0;
94 result
->__data
[cnt
].__statep
= &result
->__data
[cnt
].__state
;
97 if (res
!= __GCONV_OK
)
99 /* Something went wrong. Free all the resources. */
105 free (result
->__data
[cnt
].__outbuf
);
111 __gconv_close_transform (steps
, nsteps
);
113 __set_errno (serrno
);