Lines Matching refs:nodes
361 TrellisNode **nodes = nodep_buf; // nodes[] is always sorted by .ssd
368 nodes[0] = node_buf + frontier;
369 nodes[0]->ssd = 0;
370 nodes[0]->path = 0;
371 nodes[0]->step = c->step_index;
372 nodes[0]->sample1 = c->sample1;
373 nodes[0]->sample2 = c->sample2;
378 nodes[0]->sample1 = c->prev_sample;
380 nodes[0]->step = c->idelta;
383 nodes[0]->step = 127;
384 nodes[0]->sample1 = 0;
386 nodes[0]->step = c->step;
387 nodes[0]->sample1 = c->predictor;
397 for (j = 0; j < frontier && nodes[j]; j++) {
401 const int step = nodes[j]->step;
404 const int predictor = ((nodes[j]->sample1 * c->coeff1) +
405 (nodes[j]->sample2 * c->coeff2)) / 64;
420 ssd = nodes[j]->ssd + d*(unsigned)d;\
425 if (ssd < nodes[j]->ssd)\
430 * Since nodes in the previous generation are iterated
444 /* Try to replace one of the leaf nodes with the new \
462 u->sample2 = nodes[j]->sample1;\
465 paths[u->path].prev = nodes[j]->path;\
484 const int predictor = nodes[j]->sample1;\
510 u = nodes;
511 nodes = nodes_next;
521 if (nodes[0]->ssd > (1 << 28)) {
522 for (j = 1; j < frontier && nodes[j]; j++)
523 nodes[j]->ssd -= nodes[0]->ssd;
524 nodes[0]->ssd = 0;
529 p = &paths[nodes[0]->path];
536 // other nodes might use paths that don't coincide with the frozen one.
537 // checking which nodes do so is too slow, so just kill them all.
539 memset(nodes + 1, 0, (frontier - 1) * sizeof(TrellisNode*));
543 p = &paths[nodes[0]->path];
549 c->predictor = nodes[0]->sample1;
550 c->sample1 = nodes[0]->sample1;
551 c->sample2 = nodes[0]->sample2;
552 c->step_index = nodes[0]->step;
553 c->step = nodes[0]->step;
554 c->idelta = nodes[0]->step;