310 /* uncompress a compressed symbol. When this function is called, the best table
638 	int i, best, bestprofit;  in find_best_token()  local
641 	best = 0;  in find_best_token()
645 			best = i;  in find_best_token()
649 	return best;  in find_best_token()
652 /* this is the core of the algorithm: calculate the "best" table */
655 	int i, best;  in optimize_result()  local
665 			/* find the token with the best profit value */  in optimize_result()
666 			best = find_best_token();  in optimize_result()
667 			if (token_profit[best] == 0)  in optimize_result()
670 			/* place it in the "best" table */  in optimize_result()
672 			best_table[i][0] = best & 0xFF;  in optimize_result()
673 			best_table[i][1] = (best >> 8) & 0xFF;  in optimize_result()