Lines Matching defs:ssd
271 uint32_t ssd;
290 TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd
298 nodes[0]->ssd = 0;
323 // higher j have higher ssd already, so they're unlikely to use a suboptimal next sample too
337 uint32_t ssd;\
340 ssd = nodes[j]->ssd + d*d;\
341 if(nodes_next[frontier-1] && ssd >= nodes_next[frontier-1]->ssd)\
348 assert(ssd >= nodes_next[k]->ssd);\
353 if(!nodes_next[k] || ssd < nodes_next[k]->ssd) {\
360 u->ssd = ssd;\
400 if(nodes[0]->ssd > (1<<28)) {
402 nodes[j]->ssd -= nodes[0]->ssd;
403 nodes[0]->ssd = 0;