Lines Matching defs:nodes
181 struct TrellisNode **nodes[2];
187 nodes[i] = c->nodep_buf[i];
190 nodes[i][0] = c->node_buf[i] + frontier;
191 nodes[i][0]->ssd = 0;
192 nodes[i][0]->path = 0;
193 nodes[i][0]->state = c->band[i];
208 for (j = 0; j < frontier && nodes[0][j]; j++) {
215 struct TrellisNode *cur_node = nodes[0][j];
244 /* Try to replace one of the leaf nodes with the new \
271 for (j = 0; j < frontier && nodes[1][j]; j++) {
273 struct TrellisNode *cur_node = nodes[1][j];
295 FFSWAP(struct TrellisNode**, nodes[j], nodes_next[j]);
297 if (nodes[j][0]->ssd > (1 << 16)) {
298 for (k = 1; k < frontier && nodes[j][k]; k++)
299 nodes[j][k]->ssd -= nodes[j][0]->ssd;
300 nodes[j][0]->ssd = 0;
305 p[0] = &c->paths[0][nodes[0][0]->path];
306 p[1] = &c->paths[1][nodes[1][0]->path];
314 memset(nodes[0] + 1, 0, (frontier - 1)*sizeof(**nodes));
315 memset(nodes[1] + 1, 0, (frontier - 1)*sizeof(**nodes));
319 p[0] = &c->paths[0][nodes[0][0]->path];
320 p[1] = &c->paths[1][nodes[1][0]->path];
326 c->band[0] = nodes[0][0]->state;
327 c->band[1] = nodes[1][0]->state;