You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

78 lines
1.8KB

  1. /*
  2. * bitstream.c
  3. *
  4. * Copyright (C) Aaron Holtzman - Dec 1999
  5. *
  6. * This file is part of ac3dec, a free AC-3 audio decoder
  7. *
  8. * ac3dec is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License as published by
  10. * the Free Software Foundation; either version 2, or (at your option)
  11. * any later version.
  12. *
  13. * ac3dec is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with GNU Make; see the file COPYING. If not, write to
  20. * the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
  21. *
  22. */
  23. #include <inttypes.h>
  24. #include <stdlib.h>
  25. #include <stdio.h>
  26. #include "ac3.h"
  27. #include "ac3_internal.h"
  28. #include "bitstream.h"
  29. #define BUFFER_SIZE 4096
  30. static uint8_t *buffer_start;
  31. uint32_t bits_left;
  32. uint32_t current_word;
  33. void bitstream_set_ptr (uint8_t * buf)
  34. {
  35. buffer_start = buf;
  36. bits_left = 0;
  37. }
  38. static inline void
  39. bitstream_fill_current()
  40. {
  41. current_word = *((uint32_t*)buffer_start)++;
  42. current_word = swab32(current_word);
  43. }
  44. //
  45. // The fast paths for _get is in the
  46. // bitstream.h header file so it can be inlined.
  47. //
  48. // The "bottom half" of this routine is suffixed _bh
  49. //
  50. // -ah
  51. //
  52. uint32_t
  53. bitstream_get_bh(uint32_t num_bits)
  54. {
  55. uint32_t result;
  56. num_bits -= bits_left;
  57. result = (current_word << (32 - bits_left)) >> (32 - bits_left);
  58. bitstream_fill_current();
  59. if(num_bits != 0)
  60. result = (result << num_bits) | (current_word >> (32 - num_bits));
  61. bits_left = 32 - num_bits;
  62. return result;
  63. }