Lines Matching refs:cur_node
89 int cur_node, i, j, pos = 0;
101 cur_node = s->nb_symbols;
106 int first_node = cur_node;
107 int second_node = cur_node;
110 nodes[cur_node].count = -1;
123 } while (new_node != cur_node);
125 if (first_node == cur_node)
136 nodes[cur_node].count = nd + st;
137 nodes[cur_node].sym = -1;
138 nodes[cur_node].n0 = cur_node;
139 nodes[cur_node].l = first_node;
140 nodes[cur_node].r = second_node;
141 cur_node++;
144 } while (cur_node - s->nb_symbols == j);
146 get_tree_codes(bits, lens, xlat, nodes, cur_node - 1, 0, 0, &pos);