TrellisNode 288 libavcodec/adpcm.c TrellisNode node_buf[2][frontier]; TrellisNode 289 libavcodec/adpcm.c TrellisNode *nodep_buf[2][frontier]; TrellisNode 290 libavcodec/adpcm.c TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd TrellisNode 291 libavcodec/adpcm.c TrellisNode **nodes_next = nodep_buf[1]; TrellisNode 318 libavcodec/adpcm.c TrellisNode *t = node_buf[i&1]; TrellisNode 319 libavcodec/adpcm.c TrellisNode **u; TrellisNode 321 libavcodec/adpcm.c memset(nodes_next, 0, frontier*sizeof(TrellisNode*)); TrellisNode 354 libavcodec/adpcm.c TrellisNode *u = nodes_next[frontier-1];\ TrellisNode 366 libavcodec/adpcm.c memmove(&nodes_next[k+1], &nodes_next[k], (frontier-k-1)*sizeof(TrellisNode*));\ TrellisNode 418 libavcodec/adpcm.c memset(nodes+1, 0, (frontier-1)*sizeof(TrellisNode*));