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.

54 lines
1.7KB

  1. /*
  2. * Copyright (c) 2007 Michael Niedermayer
  3. *
  4. * This file is part of Libav.
  5. *
  6. * Libav is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU Lesser General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2.1 of the License, or (at your option) any later version.
  10. *
  11. * Libav is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * Lesser General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU Lesser General Public
  17. * License along with Libav; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  19. */
  20. /* layer 3 "granule" */
  21. typedef struct GranuleDef {
  22. uint8_t scfsi;
  23. int part2_3_length;
  24. int big_values;
  25. int global_gain;
  26. int scalefac_compress;
  27. uint8_t block_type;
  28. uint8_t switch_point;
  29. int table_select[3];
  30. int subblock_gain[3];
  31. uint8_t scalefac_scale;
  32. uint8_t count1table_select;
  33. int region_size[3]; /* number of huffman codes in each region */
  34. int preflag;
  35. int short_start, long_end; /* long/short band indexes */
  36. uint8_t scale_factors[40];
  37. int32_t sb_hybrid[SBLIMIT * 18]; /* 576 samples */
  38. } GranuleDef;
  39. void ff_mp3_init(void);
  40. /**
  41. * Compute huffman coded region sizes.
  42. */
  43. void ff_init_short_region(MPADecodeContext *s, GranuleDef *g);
  44. /**
  45. * Compute huffman coded region sizes.
  46. */
  47. void ff_init_long_region(MPADecodeContext *s, GranuleDef *g, int ra1, int ra2);
  48. void ff_compute_band_indexes(MPADecodeContext *s, GranuleDef *g);