Revision 1a68e7ed libavcodec/adpcm.c

View differences:

libavcodec/adpcm.c
420 420
                    u->sample1 = dec_sample;\
421 421
                    paths[u->path].nibble = nibble;\
422 422
                    paths[u->path].prev = nodes[j]->path;\
423
                    /* Sift the newly inserted node down in the heap to \
423
                    /* Sift the newly inserted node up in the heap to \
424 424
                     * restore the heap property. */\
425 425
                    while (pos > 0) {\
426 426
                        int parent = (pos - 1) >> 1;\

Also available in: Unified diff