Lines Matching refs:nodes
60 Node *nodes, int node,
65 s = nodes[node].sym;
74 get_tree_codes(bits, lens, xlat, nodes, nodes[node].l, pfx, pl,
77 get_tree_codes(bits, lens, xlat, nodes, nodes[node].r, pfx, pl,
85 Node nodes[512];
94 nodes[i].count = s->prob[i];
95 nodes[i].sym = s->symb[i];
96 nodes[i].n0 = -2;
97 nodes[i].l = i;
98 nodes[i].r = i;
110 nodes[cur_node].count = -1;
113 int val = nodes[new_node].count;
114 if (val && (val < nodes[first_node].count)) {
115 if (val >= nodes[second_node].count) {
128 nd = nodes[second_node].count;
129 st = nodes[first_node].count;
130 nodes[second_node].count = 0;
131 nodes[first_node].count = 0;
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;
146 get_tree_codes(bits, lens, xlat, nodes, cur_node - 1, 0, 0, &pos);