<divclass="fragment"><divclass="line"><aname="l00001"></a><spanclass="lineno"> 1</span> <spanclass="comment">// Copyright (c) 2012 The Chromium Authors. All rights reserved.</span></div><divclass="line"><aname="l00002"></a><spanclass="lineno"> 2</span> <spanclass="comment">// Use of this source code is governed by a BSD-style license that can be</span></div><divclass="line"><aname="l00003"></a><spanclass="lineno"> 3</span> <spanclass="comment">// found in the LICENSE file.</span></div><divclass="line"><aname="l00004"></a><spanclass="lineno"> 4</span> </div><divclass="line"><aname="l00005"></a><spanclass="lineno"> 5</span> <spanclass="preprocessor">#include "packager/media/base/bit_reader.h"</span></div><divclass="line"><aname="l00006"></a><spanclass="lineno"> 6</span> </div><divclass="line"><aname="l00007"></a><spanclass="lineno"> 7</span> <spanclass="preprocessor">#include <algorithm></span></div><divclass="line"><aname="l00008"></a><spanclass="lineno"> 8</span> </div><divclass="line"><aname="l00009"></a><spanclass="lineno"> 9</span> <spanclass="keyword">namespace </span><aclass="code"href="../../d8/daf/namespaceshaka.html">shaka</a> {</div><divclass="line"><aname="l00010"></a><spanclass="lineno"> 10</span> <spanclass="keyword">namespace </span>media {</div><divclass="line"><aname="l00011"></a><spanclass="lineno"> 11</span> </div><divclass="line"><aname="l00012"></a><spanclass="lineno"><aclass="line"href="../../d6/da9/classshaka_1_1media_1_1BitReader.html#a264dbe3e94ba76214c1af75ab3877945"> 12</a></span> <aclass="code"href="../../d6/da9/classshaka_1_1media_1_1BitReader.html#a264dbe3e94ba76214c1af75ab3877945">BitReader::BitReader</a>(<spanclass="keyword">const</span> uint8_t* data, <spanclass="keywordtype">size_t</span> size)</div><divclass="line"><aname="l00013"></a><spanclass="lineno"> 13</span>  : data_(data),</div><divclass="line"><aname="l00014"></a><spanclass="lineno"> 14</span>  initial_size_(size),</div><divclass="line"><aname="l00015"></a><spanclass="lineno"> 15</span>  bytes_left_(size),</div><divclass="line"><aname="l00016"></a><spanclass="lineno"> 16</span>  num_remaining_bits_in_curr_byte_(0) {</div><divclass="line"><aname="l00017"></a><spanclass="lineno"> 17</span>  DCHECK(data_ != NULL && bytes_left_ > 0);</div><divclass="line"><aname="l00018"></a><spanclass="lineno"> 18</span> </div><divclass="line"><aname="l00019"></a><spanclass="lineno"> 19</span>  UpdateCurrByte();</div><divclass="line"><aname="l00020"></a><spanclass="lineno"> 20</span> }</div><divclass="line"><aname="l00021"></a><spanclass="lineno"> 21</span> </div><divclass="line"><aname="l00022"></a><spanclass="lineno"> 22</span> BitReader::~BitReader() {}</div><divclass="line"><aname="l00023"></a><spanclass="lineno"> 23</span> </div><divclass="line"><aname="l00024"></a><spanclass="lineno"><aclass="line"href="../../d6/da9/classshaka_1_1media_1_1BitReader.html#a4ab20ef220c76072eaecb982aba0541d"> 24</a></span> <spanclass="keywordtype">bool</span><aclass="code"href="../../d6/da9/classshaka_1_1media_1_1BitReader.html#a4ab20ef220c76072eaecb982aba0541d">BitReader::SkipBits</a>(<spanclass="keywordtype">size_t</span> num_bits) {</div><divclass="line"><aname="l00025"></a><spanclass="lineno"> 25</span> <spanclass="comment">// Skip any bits in the current byte waiting to be processed, then</span></div><divclass="line"><aname="l00026"></a><spanclass="lineno"> 26</span> <spanclass="comment">// process full bytes until less than 8 bits remaining.</span></div><divclass="line"><aname="l00027"></a><spanclass="lineno"> 27</span> <spanclass="keywordflow">if</span> (num_bits > num_remaining_bits_in_curr_byte_) {</div><divclass="line"><aname="l00028"></a><spanclass="lineno"> 28</span>  num_bits -= num_