Searched refs:__max_needed_to (Results 1 – 15 of 15) sorted by relevance
118 step->__max_needed_to = MIN_NEEDED_TO; in gconv_init()125 step->__max_needed_to = MIN_NEEDED_FROM; in gconv_init()
164 step->__max_needed_to = MIN_NEEDED_TO; in gconv_init()171 step->__max_needed_to = MIN_NEEDED_FROM; in gconv_init()
166 step->__max_needed_to = MIN_NEEDED_TO; in gconv_init()173 step->__max_needed_to = MAX_NEEDED_FROM; in gconv_init()
222 step->__max_needed_to = MAX_NEEDED_TO; in gconv_init()229 step->__max_needed_to = MAX_NEEDED_FROM; in gconv_init()
183 step->__max_needed_to = FROM_LOOP_MAX_NEEDED_TO; in gconv_init()190 step->__max_needed_to = TO_LOOP_MAX_NEEDED_TO; in gconv_init()
168 step->__max_needed_to = MIN_NEEDED_TO; in gconv_init()175 step->__max_needed_to = MIN_NEEDED_FROM; in gconv_init()
45 .__max_needed_to = 4,64 .__max_needed_to = 1,
106 int __max_needed_to; member
81 step->__max_needed_to = map[cnt].max_needed_to; in __gconv_get_builtin_trans()
125 size = (GCONV_NCHAR_GOAL * steps[cnt].__max_needed_to); in __gconv_open()
334 step->__max_needed_to = FROM_LOOP_MAX_NEEDED_TO; in gconv_init()347 step->__max_needed_to = TO_LOOP_MAX_NEEDED_TO; in gconv_init()
134 step->__max_needed_to = MIN_NEEDED_TO; in gconv_init()141 step->__max_needed_to = MIN_NEEDED_FROM; in gconv_init()
140 step->__max_needed_to = MIN_NEEDED_TO; in gconv_init()147 step->__max_needed_to = MIN_NEEDED_FROM; in gconv_init()
2369 @itemx int __max_needed_to;2375 The @code{__min_needed_to} and @code{__max_needed_to} values serve the2549 @itemx __max_needed_to2620 step->__max_needed_to = MAX_NEEDED_TO;2627 step->__max_needed_to = MAX_NEEDED_FROM + 2;2661 sets. Therefore the @code{__max_needed_to} element for this direction