| commit | 49ca22aad074e8c4ac4fac71ffd37f09b1c82fab | [log] [tgz] |
|---|---|---|
| author | Nathan E. Egge <negge@dgql.org> | Mon Mar 07 02:23:54 2016 |
| committer | Yaowu Xu <yaowu@google.com> | Mon Mar 07 19:10:32 2016 |
| tree | 23816399d130d86592753da60905847e8470a07a | |
| parent | 85187243d419244626e7d6fc4f33fa31befd8fd2 [diff] |
Use the Daala implementation of OD_ILOG(). The Daala implementation of OD_ILOG(x) computes the number of bits necessary to represent the unsigned integer x in two's compliment. We adjust the computation in od_dering.c to better approximate the log base 2 and match the previous OD_ILOG() definition. This commit makes no change to the bitstream. Change-Id: Ib75c2f47dca7027b3cfc40b110f2d493f9690c9c