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