Lines Matching defs:nodes
272 TrellisNode **nodes = nodep_buf; // nodes[] is always sorted by .ssd
279 nodes[0] = node_buf + frontier;
280 nodes[0]->ssd = 0;
281 nodes[0]->path = 0;
282 nodes[0]->step = c->step_index;
283 nodes[0]->sample1 = c->sample1;
284 nodes[0]->sample2 = c->sample2;
288 nodes[0]->sample1 = c->prev_sample;
290 nodes[0]->step = c->idelta;
293 nodes[0]->step = 127;
294 nodes[0]->sample1 = 0;
296 nodes[0]->step = c->step;
297 nodes[0]->sample1 = c->predictor;
307 for (j = 0; j < frontier && nodes[j]; j++) {
311 const int step = nodes[j]->step;
314 const int predictor = ((nodes[j]->sample1 * c->coeff1) +
315 (nodes[j]->sample2 * c->coeff2)) / 64;
330 ssd = nodes[j]->ssd + d*d;\
335 if (ssd < nodes[j]->ssd)\
340 * Since nodes in the previous generation are iterated
354 /* Try to replace one of the leaf nodes with the new \
372 u->sample2 = nodes[j]->sample1;\
375 paths[u->path].prev = nodes[j]->path;\
393 const int predictor = nodes[j]->sample1;\
419 u = nodes;
420 nodes = nodes_next;
430 if (nodes[0]->ssd > (1 << 28)) {
431 for (j = 1; j < frontier && nodes[j]; j++)
432 nodes[j]->ssd -= nodes[0]->ssd;
433 nodes[0]->ssd = 0;
438 p = &paths[nodes[0]->path];
445 // other nodes might use paths that don't coincide with the frozen one.
446 // checking which nodes do so is too slow, so just kill them all.
448 memset(nodes + 1, 0, (frontier - 1) * sizeof(TrellisNode*));
452 p = &paths[nodes[0]->path];
458 c->predictor = nodes[0]->sample1;
459 c->sample1 = nodes[0]->sample1;
460 c->sample2 = nodes[0]->sample2;
461 c->step_index = nodes[0]->step;
462 c->step = nodes[0]->step;
463 c->idelta = nodes[0]->step;