Lines Matching defs:nodes
169 struct TrellisNode **nodes[2];
175 nodes[i] = c->nodep_buf[i];
178 nodes[i][0] = c->node_buf[i] + frontier;
179 nodes[i][0]->ssd = 0;
180 nodes[i][0]->path = 0;
181 nodes[i][0]->state = c->band[i];
196 for (j = 0; j < frontier && nodes[0][j]; j++) {
203 struct TrellisNode *cur_node = nodes[0][j];
232 /* Try to replace one of the leaf nodes with the new \
259 for (j = 0; j < frontier && nodes[1][j]; j++) {
261 struct TrellisNode *cur_node = nodes[1][j];
283 FFSWAP(struct TrellisNode**, nodes[j], nodes_next[j]);
285 if (nodes[j][0]->ssd > (1 << 16)) {
286 for (k = 1; k < frontier && nodes[j][k]; k++)
287 nodes[j][k]->ssd -= nodes[j][0]->ssd;
288 nodes[j][0]->ssd = 0;
293 p[0] = &c->paths[0][nodes[0][0]->path];
294 p[1] = &c->paths[1][nodes[1][0]->path];
302 memset(nodes[0] + 1, 0, (frontier - 1)*sizeof(**nodes));
303 memset(nodes[1] + 1, 0, (frontier - 1)*sizeof(**nodes));
307 p[0] = &c->paths[0][nodes[0][0]->path];
308 p[1] = &c->paths[1][nodes[1][0]->path];
314 c->band[0] = nodes[0][0]->state;
315 c->band[1] = nodes[1][0]->state;