Lines Matching defs:nodes
277 TrellisNode **nodes = nodep_buf; // nodes[] is always sorted by .ssd
284 nodes[0] = node_buf + frontier;
285 nodes[0]->ssd = 0;
286 nodes[0]->path = 0;
287 nodes[0]->step = c->step_index;
288 nodes[0]->sample1 = c->sample1;
289 nodes[0]->sample2 = c->sample2;
293 nodes[0]->sample1 = c->prev_sample;
295 nodes[0]->step = c->idelta;
298 nodes[0]->step = 127;
299 nodes[0]->sample1 = 0;
301 nodes[0]->step = c->step;
302 nodes[0]->sample1 = c->predictor;
312 for (j = 0; j < frontier && nodes[j]; j++) {
316 const int step = nodes[j]->step;
319 const int predictor = ((nodes[j]->sample1 * c->coeff1) +
320 (nodes[j]->sample2 * c->coeff2)) / 64;
335 ssd = nodes[j]->ssd + d*(unsigned)d;\
340 if (ssd < nodes[j]->ssd)\
345 * Since nodes in the previous generation are iterated
359 /* Try to replace one of the leaf nodes with the new \
377 u->sample2 = nodes[j]->sample1;\
380 paths[u->path].prev = nodes[j]->path;\
398 const int predictor = nodes[j]->sample1;\
424 u = nodes;
425 nodes = nodes_next;
435 if (nodes[0]->ssd > (1 << 28)) {
436 for (j = 1; j < frontier && nodes[j]; j++)
437 nodes[j]->ssd -= nodes[0]->ssd;
438 nodes[0]->ssd = 0;
443 p = &paths[nodes[0]->path];
450 // other nodes might use paths that don't coincide with the frozen one.
451 // checking which nodes do so is too slow, so just kill them all.
453 memset(nodes + 1, 0, (frontier - 1) * sizeof(TrellisNode*));
457 p = &paths[nodes[0]->path];
463 c->predictor = nodes[0]->sample1;
464 c->sample1 = nodes[0]->sample1;
465 c->sample2 = nodes[0]->sample2;
466 c->step_index = nodes[0]->step;
467 c->step = nodes[0]->step;
468 c->idelta = nodes[0]->step;