Lines Matching defs:nodes
64 Node *nodes, int node,
69 s = nodes[node].sym;
78 get_tree_codes(bits, lens, xlat, nodes, nodes[node].l, pfx, pl,
81 get_tree_codes(bits, lens, xlat, nodes, nodes[node].r, pfx, pl,
88 Node nodes[512];
97 nodes[i].count = table[i];
98 nodes[i].sym = i;
99 nodes[i].l = i;
100 nodes[i].r = i;
112 nodes[cur_node].count = -1;
115 int val = nodes[new_node].count;
116 if (val && (val < nodes[first_node].count)) {
117 if (val >= nodes[second_node].count) {
130 nd = nodes[second_node].count;
131 st = nodes[first_node].count;
132 nodes[second_node].count = 0;
133 nodes[first_node].count = 0;
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;
147 get_tree_codes(bits, lens, xlat, nodes, cur_node - 1, 0, 0, &pos);