Lines Matching refs:step
204 __gconv_release_step (struct __gconv_step *step) in __gconv_release_step() argument
207 if (step->__shlib_handle != NULL && --step->__counter == 0) in __gconv_release_step()
210 __gconv_end_fct end_fct = step->__end_fct; in __gconv_release_step()
215 DL_CALL_FCT (end_fct, (step)); in __gconv_release_step()
219 __gconv_release_shlib (step->__shlib_handle); in __gconv_release_step()
220 step->__shlib_handle = NULL; in __gconv_release_step()
223 else if (step->__shlib_handle == NULL) in __gconv_release_step()
225 assert (step->__end_fct == NULL); in __gconv_release_step()
376 struct __gconv_step *step = &steps[cnt]; in increment_counter() local
378 if (step->__counter++ == 0) in increment_counter()
381 if (step->__modname != NULL) in increment_counter()
384 step->__shlib_handle = __gconv_find_shlib (step->__modname); in increment_counter()
385 if (step->__shlib_handle == NULL) in increment_counter()
389 --step->__counter; in increment_counter()
398 step->__fct = step->__shlib_handle->fct; in increment_counter()
399 step->__init_fct = step->__shlib_handle->init_fct; in increment_counter()
400 step->__end_fct = step->__shlib_handle->end_fct; in increment_counter()
403 step->__btowc_fct = NULL; in increment_counter()
406 __gconv_init_fct init_fct = step->__init_fct; in increment_counter()
411 DL_CALL_FCT (init_fct, (step)); in increment_counter()
414 PTR_MANGLE (step->__btowc_fct); in increment_counter()
527 struct derivation_step *step; in find_derivation() local
537 for (step = solution; step != NULL; step = step->next) in find_derivation()
538 if (strcmp (result_set, step->result_set) == 0) in find_derivation()
541 if (step == NULL) in find_derivation()
543 step = NEW_STEP (result_set, in find_derivation()
546 step->next = solution; in find_derivation()
547 solution = step; in find_derivation()
549 else if (step->cost_hi > cost_hi in find_derivation()
550 || (step->cost_hi == cost_hi in find_derivation()
551 && step->cost_lo > cost_lo)) in find_derivation()
555 step->code = runp; in find_derivation()
556 step->last = current; in find_derivation()
557 step->cost_hi = cost_hi; in find_derivation()
558 step->cost_lo = cost_lo; in find_derivation()
576 for (step = first; step != NULL; step = step->next) in find_derivation()
577 if (strcmp (result_set, step->result_set) == 0) in find_derivation()
580 if (step == NULL) in find_derivation()
587 else if (step->cost_hi > cost_hi in find_derivation()
588 || (step->cost_hi == cost_hi in find_derivation()
589 && step->cost_lo > cost_lo)) in find_derivation()
593 step->code = runp; in find_derivation()
594 step->last = current; in find_derivation()
597 for (step = first; step != NULL; in find_derivation()
598 step = step->next) in find_derivation()
600 if (step->code != NULL) in find_derivation()
605 hi = step->code->cost_hi; in find_derivation()
606 lo = step->code->cost_lo; in find_derivation()
608 for (back = step->last; back->code != NULL; in find_derivation()
615 step->cost_hi = hi; in find_derivation()
616 step->cost_lo = lo; in find_derivation()
621 for (step = solution; step != NULL; in find_derivation()
622 step = step->next) in find_derivation()
624 step->cost_hi = (step->code->cost_hi in find_derivation()
625 + step->last->cost_hi); in find_derivation()
626 step->cost_lo = (step->code->cost_lo in find_derivation()
627 + step->last->cost_lo); in find_derivation()
629 if (step->cost_hi < best_cost_hi in find_derivation()
630 || (step->cost_hi == best_cost_hi in find_derivation()
631 && step->cost_lo < best_cost_lo)) in find_derivation()
633 best_cost_hi = step->cost_hi; in find_derivation()
634 best_cost_lo = step->cost_lo; in find_derivation()