Lines Matching defs:nodes
174 struct TrellisNode **nodes[2];
180 nodes[i] = c->nodep_buf[i];
183 nodes[i][0] = c->node_buf[i] + frontier;
184 nodes[i][0]->ssd = 0;
185 nodes[i][0]->path = 0;
186 nodes[i][0]->state = c->band[i];
201 for (j = 0; j < frontier && nodes[0][j]; j++) {
208 struct TrellisNode *cur_node = nodes[0][j];
237 /* Try to replace one of the leaf nodes with the new \
264 for (j = 0; j < frontier && nodes[1][j]; j++) {
266 struct TrellisNode *cur_node = nodes[1][j];
287 FFSWAP(struct TrellisNode**, nodes[j], nodes_next[j]);
289 if (nodes[j][0]->ssd > (1 << 16)) {
290 for (k = 1; k < frontier && nodes[j][k]; k++)
291 nodes[j][k]->ssd -= nodes[j][0]->ssd;
292 nodes[j][0]->ssd = 0;
297 p[0] = &c->paths[0][nodes[0][0]->path];
298 p[1] = &c->paths[1][nodes[1][0]->path];
306 memset(nodes[0] + 1, 0, (frontier - 1)*sizeof(**nodes));
307 memset(nodes[1] + 1, 0, (frontier - 1)*sizeof(**nodes));
311 p[0] = &c->paths[0][nodes[0][0]->path];
312 p[1] = &c->paths[1][nodes[1][0]->path];
318 c->band[0] = nodes[0][0]->state;
319 c->band[1] = nodes[1][0]->state;