92     int cur_node, i, j, pos = 0;  in build_vlc()  local
103     cur_node = 256;  in build_vlc()
108             int first_node = cur_node;  in build_vlc()
109             int second_node = cur_node;  in build_vlc()
112             nodes[cur_node].count = -1;  in build_vlc()
125             } while (new_node != cur_node);  in build_vlc()
127             if (first_node == cur_node)  in build_vlc()
138             nodes[cur_node].count = nd + st;  in build_vlc()
139             nodes[cur_node].sym = -1;  in build_vlc()
140             nodes[cur_node].l = first_node;  in build_vlc()
141             nodes[cur_node].r = second_node;  in build_vlc()
142             cur_node++;  in build_vlc()
145     } while (cur_node - 256 == j);  in build_vlc()
147     get_tree_codes(bits, lens, xlat, nodes, cur_node - 1, 0, 0, &pos);  in build_vlc()