The JUCE cross-platform C++ framework, with DISTRHO/KXStudio specific changes
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.

885 lines
29KB

  1. /* libFLAC - Free Lossless Audio Codec library
  2. * Copyright (C) 2000-2009 Josh Coalson
  3. * Copyright (C) 2011-2016 Xiph.Org Foundation
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. *
  9. * - Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. *
  12. * - Redistributions in binary form must reproduce the above copyright
  13. * notice, this list of conditions and the following disclaimer in the
  14. * documentation and/or other materials provided with the distribution.
  15. *
  16. * - Neither the name of the Xiph.org Foundation nor the names of its
  17. * contributors may be used to endorse or promote products derived from
  18. * this software without specific prior written permission.
  19. *
  20. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  21. * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  22. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  23. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR
  24. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  25. * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  26. * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
  27. * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
  28. * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
  29. * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  30. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  31. */
  32. #ifdef HAVE_CONFIG_H
  33. # include <config.h>
  34. #endif
  35. #include <stdlib.h>
  36. #include <string.h>
  37. #include "include/private/bitwriter.h"
  38. #include "include/private/crc.h"
  39. #include "../assert.h"
  40. #include "../alloc.h"
  41. #include "../compat.h"
  42. #include "../endswap.h"
  43. /* Things should be fastest when this matches the machine word size */
  44. /* WATCHOUT: if you change this you must also change the following #defines down to SWAP_BE_WORD_TO_HOST below to match */
  45. /* WATCHOUT: there are a few places where the code will not work unless bwword is >= 32 bits wide */
  46. #if (ENABLE_64_BIT_WORDS == 0)
  47. typedef FLAC__uint32 bwword;
  48. #define FLAC__BYTES_PER_WORD 4 /* sizeof bwword */
  49. #define FLAC__BITS_PER_WORD 32
  50. /* SWAP_BE_WORD_TO_HOST swaps bytes in a bwword (which is always big-endian) if necessary to match host byte order */
  51. #if WORDS_BIGENDIAN
  52. #define SWAP_BE_WORD_TO_HOST(x) (x)
  53. #else
  54. #define SWAP_BE_WORD_TO_HOST(x) ENDSWAP_32(x)
  55. #endif
  56. #else
  57. typedef FLAC__uint64 bwword;
  58. #define FLAC__BYTES_PER_WORD 8 /* sizeof bwword */
  59. #define FLAC__BITS_PER_WORD 64
  60. /* SWAP_BE_WORD_TO_HOST swaps bytes in a bwword (which is always big-endian) if necessary to match host byte order */
  61. #if WORDS_BIGENDIAN
  62. #define SWAP_BE_WORD_TO_HOST(x) (x)
  63. #else
  64. #define SWAP_BE_WORD_TO_HOST(x) ENDSWAP_64(x)
  65. #endif
  66. #endif
  67. /*
  68. * The default capacity here doesn't matter too much. The buffer always grows
  69. * to hold whatever is written to it. Usually the encoder will stop adding at
  70. * a frame or metadata block, then write that out and clear the buffer for the
  71. * next one.
  72. */
  73. static const uint32_t FLAC__BITWRITER_DEFAULT_CAPACITY = 32768u / sizeof(bwword); /* size in words */
  74. /* When growing, increment 4K at a time */
  75. static const uint32_t FLAC__BITWRITER_DEFAULT_INCREMENT = 4096u / sizeof(bwword); /* size in words */
  76. #define FLAC__WORDS_TO_BITS(words) ((words) * FLAC__BITS_PER_WORD)
  77. #define FLAC__TOTAL_BITS(bw) (FLAC__WORDS_TO_BITS((bw)->words) + (bw)->bits)
  78. struct FLAC__BitWriter {
  79. bwword *buffer;
  80. bwword accum; /* accumulator; bits are right-justified; when full, accum is appended to buffer */
  81. uint32_t capacity; /* capacity of buffer in words */
  82. uint32_t words; /* # of complete words in buffer */
  83. uint32_t bits; /* # of used bits in accum */
  84. };
  85. /* * WATCHOUT: The current implementation only grows the buffer. */
  86. #ifndef __SUNPRO_C
  87. static
  88. #endif
  89. FLAC__bool bitwriter_grow_(FLAC__BitWriter *bw, uint32_t bits_to_add)
  90. {
  91. uint32_t new_capacity;
  92. bwword *new_buffer;
  93. FLAC__ASSERT(0 != bw);
  94. FLAC__ASSERT(0 != bw->buffer);
  95. /* calculate total words needed to store 'bits_to_add' additional bits */
  96. new_capacity = bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD);
  97. /* it's possible (due to pessimism in the growth estimation that
  98. * leads to this call) that we don't actually need to grow
  99. */
  100. if(bw->capacity >= new_capacity)
  101. return true;
  102. /* round up capacity increase to the nearest FLAC__BITWRITER_DEFAULT_INCREMENT */
  103. if((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT)
  104. new_capacity += FLAC__BITWRITER_DEFAULT_INCREMENT - ((new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT);
  105. /* make sure we got everything right */
  106. FLAC__ASSERT(0 == (new_capacity - bw->capacity) % FLAC__BITWRITER_DEFAULT_INCREMENT);
  107. FLAC__ASSERT(new_capacity > bw->capacity);
  108. FLAC__ASSERT(new_capacity >= bw->words + ((bw->bits + bits_to_add + FLAC__BITS_PER_WORD - 1) / FLAC__BITS_PER_WORD));
  109. new_buffer = (bwword*) safe_realloc_mul_2op_(bw->buffer, sizeof(bwword), /*times*/new_capacity);
  110. if(new_buffer == 0)
  111. return false;
  112. bw->buffer = new_buffer;
  113. bw->capacity = new_capacity;
  114. return true;
  115. }
  116. /***********************************************************************
  117. *
  118. * Class constructor/destructor
  119. *
  120. ***********************************************************************/
  121. FLAC__BitWriter *FLAC__bitwriter_new(void)
  122. {
  123. FLAC__BitWriter *bw = (FLAC__BitWriter*) calloc(1, sizeof(FLAC__BitWriter));
  124. /* note that calloc() sets all members to 0 for us */
  125. return bw;
  126. }
  127. void FLAC__bitwriter_delete(FLAC__BitWriter *bw)
  128. {
  129. FLAC__ASSERT(0 != bw);
  130. FLAC__bitwriter_free(bw);
  131. free(bw);
  132. }
  133. /***********************************************************************
  134. *
  135. * Public class methods
  136. *
  137. ***********************************************************************/
  138. FLAC__bool FLAC__bitwriter_init(FLAC__BitWriter *bw)
  139. {
  140. FLAC__ASSERT(0 != bw);
  141. bw->words = bw->bits = 0;
  142. bw->capacity = FLAC__BITWRITER_DEFAULT_CAPACITY;
  143. bw->buffer = (bwword*) malloc(sizeof(bwword) * bw->capacity);
  144. if(bw->buffer == 0)
  145. return false;
  146. return true;
  147. }
  148. void FLAC__bitwriter_free(FLAC__BitWriter *bw)
  149. {
  150. FLAC__ASSERT(0 != bw);
  151. if(0 != bw->buffer)
  152. free(bw->buffer);
  153. bw->buffer = 0;
  154. bw->capacity = 0;
  155. bw->words = bw->bits = 0;
  156. }
  157. void FLAC__bitwriter_clear(FLAC__BitWriter *bw)
  158. {
  159. bw->words = bw->bits = 0;
  160. }
  161. void FLAC__bitwriter_dump(const FLAC__BitWriter *bw, FILE *out)
  162. {
  163. uint32_t i, j;
  164. if(bw == 0) {
  165. fprintf(out, "bitwriter is NULL\n");
  166. }
  167. else {
  168. fprintf(out, "bitwriter: capacity=%u words=%u bits=%u total_bits=%u\n", bw->capacity, bw->words, bw->bits, FLAC__TOTAL_BITS(bw));
  169. for(i = 0; i < bw->words; i++) {
  170. fprintf(out, "%08X: ", i);
  171. for(j = 0; j < FLAC__BITS_PER_WORD; j++)
  172. fprintf(out, "%01d", bw->buffer[i] & ((bwword)1 << (FLAC__BITS_PER_WORD-j-1)) ? 1:0);
  173. fprintf(out, "\n");
  174. }
  175. if(bw->bits > 0) {
  176. fprintf(out, "%08X: ", i);
  177. for(j = 0; j < bw->bits; j++)
  178. fprintf(out, "%01d", bw->accum & ((bwword)1 << (bw->bits-j-1)) ? 1:0);
  179. fprintf(out, "\n");
  180. }
  181. }
  182. }
  183. FLAC__bool FLAC__bitwriter_get_write_crc16(FLAC__BitWriter *bw, FLAC__uint16 *crc)
  184. {
  185. const FLAC__byte *buffer;
  186. size_t bytes;
  187. FLAC__ASSERT((bw->bits & 7) == 0); /* assert that we're byte-aligned */
  188. if(!FLAC__bitwriter_get_buffer(bw, &buffer, &bytes))
  189. return false;
  190. *crc = (FLAC__uint16)FLAC__crc16(buffer, bytes);
  191. FLAC__bitwriter_release_buffer(bw);
  192. return true;
  193. }
  194. FLAC__bool FLAC__bitwriter_get_write_crc8(FLAC__BitWriter *bw, FLAC__byte *crc)
  195. {
  196. const FLAC__byte *buffer;
  197. size_t bytes;
  198. FLAC__ASSERT((bw->bits & 7) == 0); /* assert that we're byte-aligned */
  199. if(!FLAC__bitwriter_get_buffer(bw, &buffer, &bytes))
  200. return false;
  201. *crc = FLAC__crc8(buffer, bytes);
  202. FLAC__bitwriter_release_buffer(bw);
  203. return true;
  204. }
  205. FLAC__bool FLAC__bitwriter_is_byte_aligned(const FLAC__BitWriter *bw)
  206. {
  207. return ((bw->bits & 7) == 0);
  208. }
  209. uint32_t FLAC__bitwriter_get_input_bits_unconsumed(const FLAC__BitWriter *bw)
  210. {
  211. return FLAC__TOTAL_BITS(bw);
  212. }
  213. FLAC__bool FLAC__bitwriter_get_buffer(FLAC__BitWriter *bw, const FLAC__byte **buffer, size_t *bytes)
  214. {
  215. FLAC__ASSERT((bw->bits & 7) == 0);
  216. /* double protection */
  217. if(bw->bits & 7)
  218. return false;
  219. /* if we have bits in the accumulator we have to flush those to the buffer first */
  220. if(bw->bits) {
  221. FLAC__ASSERT(bw->words <= bw->capacity);
  222. if(bw->words == bw->capacity && !bitwriter_grow_(bw, FLAC__BITS_PER_WORD))
  223. return false;
  224. /* append bits as complete word to buffer, but don't change bw->accum or bw->bits */
  225. bw->buffer[bw->words] = SWAP_BE_WORD_TO_HOST(bw->accum << (FLAC__BITS_PER_WORD-bw->bits));
  226. }
  227. /* now we can just return what we have */
  228. *buffer = (FLAC__byte*)bw->buffer;
  229. *bytes = (FLAC__BYTES_PER_WORD * bw->words) + (bw->bits >> 3);
  230. return true;
  231. }
  232. void FLAC__bitwriter_release_buffer(FLAC__BitWriter *bw)
  233. {
  234. /* nothing to do. in the future, strict checking of a 'writer-is-in-
  235. * get-mode' flag could be added everywhere and then cleared here
  236. */
  237. (void)bw;
  238. }
  239. inline FLAC__bool FLAC__bitwriter_write_zeroes(FLAC__BitWriter *bw, uint32_t bits)
  240. {
  241. uint32_t n;
  242. FLAC__ASSERT(0 != bw);
  243. FLAC__ASSERT(0 != bw->buffer);
  244. if(bits == 0)
  245. return true;
  246. /* slightly pessimistic size check but faster than "<= bw->words + (bw->bits+bits+FLAC__BITS_PER_WORD-1)/FLAC__BITS_PER_WORD" */
  247. if(bw->capacity <= bw->words + bits && !bitwriter_grow_(bw, bits))
  248. return false;
  249. /* first part gets to word alignment */
  250. if(bw->bits) {
  251. n = flac_min(FLAC__BITS_PER_WORD - bw->bits, bits);
  252. bw->accum <<= n;
  253. bits -= n;
  254. bw->bits += n;
  255. if(bw->bits == FLAC__BITS_PER_WORD) {
  256. bw->buffer[bw->words++] = SWAP_BE_WORD_TO_HOST(bw->accum);
  257. bw->bits = 0;
  258. }
  259. else
  260. return true;
  261. }
  262. /* do whole words */
  263. while(bits >= FLAC__BITS_PER_WORD) {
  264. bw->buffer[bw->words++] = 0;
  265. bits -= FLAC__BITS_PER_WORD;
  266. }
  267. /* do any leftovers */
  268. if(bits > 0) {
  269. bw->accum = 0;
  270. bw->bits = bits;
  271. }
  272. return true;
  273. }
  274. static inline FLAC__bool FLAC__bitwriter_write_raw_uint32_nocheck(FLAC__BitWriter *bw, FLAC__uint32 val, uint32_t bits)
  275. {
  276. uint32_t left;
  277. /* WATCHOUT: code does not work with <32bit words; we can make things much faster with this assertion */
  278. FLAC__ASSERT(FLAC__BITS_PER_WORD >= 32);
  279. if(bw == 0 || bw->buffer == 0)
  280. return false;
  281. if (bits > 32)
  282. return false;
  283. if(bits == 0)
  284. return true;
  285. FLAC__ASSERT((bits == 32) || (val>>bits == 0));
  286. /* slightly pessimistic size check but faster than "<= bw->words + (bw->bits+bits+FLAC__BITS_PER_WORD-1)/FLAC__BITS_PER_WORD" */
  287. if(bw->capacity <= bw->words + bits && !bitwriter_grow_(bw, bits))
  288. return false;
  289. left = FLAC__BITS_PER_WORD - bw->bits;
  290. if(bits < left) {
  291. bw->accum <<= bits;
  292. bw->accum |= val;
  293. bw->bits += bits;
  294. }
  295. else if(bw->bits) { /* WATCHOUT: if bw->bits == 0, left==FLAC__BITS_PER_WORD and bw->accum<<=left is a NOP instead of setting to 0 */
  296. bw->accum <<= left;
  297. bw->accum |= val >> (bw->bits = bits - left);
  298. bw->buffer[bw->words++] = SWAP_BE_WORD_TO_HOST(bw->accum);
  299. bw->accum = val; /* unused top bits can contain garbage */
  300. }
  301. else { /* at this point bits == FLAC__BITS_PER_WORD == 32 and bw->bits == 0 */
  302. bw->buffer[bw->words++] = SWAP_BE_WORD_TO_HOST((bwword)val);
  303. }
  304. return true;
  305. }
  306. inline FLAC__bool FLAC__bitwriter_write_raw_uint32(FLAC__BitWriter *bw, FLAC__uint32 val, uint32_t bits)
  307. {
  308. /* check that unused bits are unset */
  309. if((bits < 32) && (val>>bits != 0))
  310. return false;
  311. return FLAC__bitwriter_write_raw_uint32_nocheck(bw, val, bits);
  312. }
  313. inline FLAC__bool FLAC__bitwriter_write_raw_int32(FLAC__BitWriter *bw, FLAC__int32 val, uint32_t bits)
  314. {
  315. /* zero-out unused bits */
  316. if(bits < 32)
  317. val &= (~(0xffffffff << bits));
  318. return FLAC__bitwriter_write_raw_uint32_nocheck(bw, (FLAC__uint32)val, bits);
  319. }
  320. inline FLAC__bool FLAC__bitwriter_write_raw_uint64(FLAC__BitWriter *bw, FLAC__uint64 val, uint32_t bits)
  321. {
  322. /* this could be a little faster but it's not used for much */
  323. if(bits > 32) {
  324. return
  325. FLAC__bitwriter_write_raw_uint32(bw, (FLAC__uint32)(val>>32), bits-32) &&
  326. FLAC__bitwriter_write_raw_uint32_nocheck(bw, (FLAC__uint32)val, 32);
  327. }
  328. else
  329. return FLAC__bitwriter_write_raw_uint32(bw, (FLAC__uint32)val, bits);
  330. }
  331. inline FLAC__bool FLAC__bitwriter_write_raw_uint32_little_endian(FLAC__BitWriter *bw, FLAC__uint32 val)
  332. {
  333. /* this doesn't need to be that fast as currently it is only used for vorbis comments */
  334. if(!FLAC__bitwriter_write_raw_uint32_nocheck(bw, val & 0xff, 8))
  335. return false;
  336. if(!FLAC__bitwriter_write_raw_uint32_nocheck(bw, (val>>8) & 0xff, 8))
  337. return false;
  338. if(!FLAC__bitwriter_write_raw_uint32_nocheck(bw, (val>>16) & 0xff, 8))
  339. return false;
  340. if(!FLAC__bitwriter_write_raw_uint32_nocheck(bw, val>>24, 8))
  341. return false;
  342. return true;
  343. }
  344. inline FLAC__bool FLAC__bitwriter_write_byte_block(FLAC__BitWriter *bw, const FLAC__byte vals[], uint32_t nvals)
  345. {
  346. uint32_t i;
  347. /* grow capacity upfront to prevent constant reallocation during writes */
  348. if(bw->capacity <= bw->words + nvals / (FLAC__BITS_PER_WORD / 8) + 1 && !bitwriter_grow_(bw, nvals * 8))
  349. return false;
  350. /* this could be faster but currently we don't need it to be since it's only used for writing metadata */
  351. for(i = 0; i < nvals; i++) {
  352. if(!FLAC__bitwriter_write_raw_uint32_nocheck(bw, (FLAC__uint32)(vals[i]), 8))
  353. return false;
  354. }
  355. return true;
  356. }
  357. FLAC__bool FLAC__bitwriter_write_unary_unsigned(FLAC__BitWriter *bw, uint32_t val)
  358. {
  359. if(val < 32)
  360. return FLAC__bitwriter_write_raw_uint32_nocheck(bw, 1, ++val);
  361. else
  362. return
  363. FLAC__bitwriter_write_zeroes(bw, val) &&
  364. FLAC__bitwriter_write_raw_uint32_nocheck(bw, 1, 1);
  365. }
  366. uint32_t FLAC__bitwriter_rice_bits(FLAC__int32 val, uint32_t parameter)
  367. {
  368. FLAC__uint32 uval;
  369. FLAC__ASSERT(parameter < 32);
  370. /* fold signed to uint32_t; actual formula is: negative(v)? -2v-1 : 2v */
  371. uval = val;
  372. uval <<= 1;
  373. uval ^= (val>>31);
  374. return 1 + parameter + (uval >> parameter);
  375. }
  376. #if 0 /* UNUSED */
  377. uint32_t FLAC__bitwriter_golomb_bits_signed(int val, uint32_t parameter)
  378. {
  379. uint32_t bits, msbs, uval;
  380. uint32_t k;
  381. FLAC__ASSERT(parameter > 0);
  382. /* fold signed to uint32_t */
  383. if(val < 0)
  384. uval = (uint32_t)(((-(++val)) << 1) + 1);
  385. else
  386. uval = (uint32_t)(val << 1);
  387. k = FLAC__bitmath_ilog2(parameter);
  388. if(parameter == 1u<<k) {
  389. FLAC__ASSERT(k <= 30);
  390. msbs = uval >> k;
  391. bits = 1 + k + msbs;
  392. }
  393. else {
  394. uint32_t q, r, d;
  395. d = (1 << (k+1)) - parameter;
  396. q = uval / parameter;
  397. r = uval - (q * parameter);
  398. bits = 1 + q + k;
  399. if(r >= d)
  400. bits++;
  401. }
  402. return bits;
  403. }
  404. uint32_t FLAC__bitwriter_golomb_bits_unsigned(uint32_t uval, uint32_t parameter)
  405. {
  406. uint32_t bits, msbs;
  407. uint32_t k;
  408. FLAC__ASSERT(parameter > 0);
  409. k = FLAC__bitmath_ilog2(parameter);
  410. if(parameter == 1u<<k) {
  411. FLAC__ASSERT(k <= 30);
  412. msbs = uval >> k;
  413. bits = 1 + k + msbs;
  414. }
  415. else {
  416. uint32_t q, r, d;
  417. d = (1 << (k+1)) - parameter;
  418. q = uval / parameter;
  419. r = uval - (q * parameter);
  420. bits = 1 + q + k;
  421. if(r >= d)
  422. bits++;
  423. }
  424. return bits;
  425. }
  426. #endif /* UNUSED */
  427. FLAC__bool FLAC__bitwriter_write_rice_signed(FLAC__BitWriter *bw, FLAC__int32 val, uint32_t parameter)
  428. {
  429. uint32_t total_bits, interesting_bits, msbs;
  430. FLAC__uint32 uval, pattern;
  431. FLAC__ASSERT(0 != bw);
  432. FLAC__ASSERT(0 != bw->buffer);
  433. FLAC__ASSERT(parameter < 32);
  434. /* fold signed to uint32_t; actual formula is: negative(v)? -2v-1 : 2v */
  435. uval = val;
  436. uval <<= 1;
  437. uval ^= (val>>31);
  438. msbs = uval >> parameter;
  439. interesting_bits = 1 + parameter;
  440. total_bits = interesting_bits + msbs;
  441. pattern = 1 << parameter; /* the unary end bit */
  442. pattern |= (uval & ((1<<parameter)-1)); /* the binary LSBs */
  443. if(total_bits <= 32)
  444. return FLAC__bitwriter_write_raw_uint32(bw, pattern, total_bits);
  445. else
  446. return
  447. FLAC__bitwriter_write_zeroes(bw, msbs) && /* write the unary MSBs */
  448. FLAC__bitwriter_write_raw_uint32(bw, pattern, interesting_bits); /* write the unary end bit and binary LSBs */
  449. }
  450. FLAC__bool FLAC__bitwriter_write_rice_signed_block(FLAC__BitWriter *bw, const FLAC__int32 *vals, uint32_t nvals, uint32_t parameter)
  451. {
  452. const FLAC__uint32 mask1 = (FLAC__uint32)0xffffffff << parameter; /* we val|=mask1 to set the stop bit above it... */
  453. const FLAC__uint32 mask2 = (FLAC__uint32)0xffffffff >> (31-parameter); /* ...then mask off the bits above the stop bit with val&=mask2 */
  454. FLAC__uint32 uval;
  455. uint32_t left;
  456. const uint32_t lsbits = 1 + parameter;
  457. uint32_t msbits, total_bits;
  458. FLAC__ASSERT(0 != bw);
  459. FLAC__ASSERT(0 != bw->buffer);
  460. FLAC__ASSERT(parameter < 31);
  461. /* WATCHOUT: code does not work with <32bit words; we can make things much faster with this assertion */
  462. FLAC__ASSERT(FLAC__BITS_PER_WORD >= 32);
  463. while(nvals) {
  464. /* fold signed to uint32_t; actual formula is: negative(v)? -2v-1 : 2v */
  465. uval = *vals;
  466. uval <<= 1;
  467. uval ^= (*vals>>31);
  468. msbits = uval >> parameter;
  469. total_bits = lsbits + msbits;
  470. if(bw->bits && bw->bits + total_bits < FLAC__BITS_PER_WORD) { /* i.e. if the whole thing fits in the current bwword */
  471. /* ^^^ if bw->bits is 0 then we may have filled the buffer and have no free bwword to work in */
  472. bw->bits += total_bits;
  473. uval |= mask1; /* set stop bit */
  474. uval &= mask2; /* mask off unused top bits */
  475. bw->accum <<= total_bits;
  476. bw->accum |= uval;
  477. }
  478. else {
  479. /* slightly pessimistic size check but faster than "<= bw->words + (bw->bits+msbits+lsbits+FLAC__BITS_PER_WORD-1)/FLAC__BITS_PER_WORD" */
  480. /* OPT: pessimism may cause flurry of false calls to grow_ which eat up all savings before it */
  481. if(bw->capacity <= bw->words + bw->bits + msbits + 1 /* lsbits always fit in 1 bwword */ && !bitwriter_grow_(bw, total_bits))
  482. return false;
  483. if(msbits) {
  484. /* first part gets to word alignment */
  485. if(bw->bits) {
  486. left = FLAC__BITS_PER_WORD - bw->bits;
  487. if(msbits < left) {
  488. bw->accum <<= msbits;
  489. bw->bits += msbits;
  490. goto break1;
  491. }
  492. else {
  493. bw->accum <<= left;
  494. msbits -= left;
  495. bw->buffer[bw->words++] = SWAP_BE_WORD_TO_HOST(bw->accum);
  496. bw->bits = 0;
  497. }
  498. }
  499. /* do whole words */
  500. while(msbits >= FLAC__BITS_PER_WORD) {
  501. bw->buffer[bw->words++] = 0;
  502. msbits -= FLAC__BITS_PER_WORD;
  503. }
  504. /* do any leftovers */
  505. if(msbits > 0) {
  506. bw->accum = 0;
  507. bw->bits = msbits;
  508. }
  509. }
  510. break1:
  511. uval |= mask1; /* set stop bit */
  512. uval &= mask2; /* mask off unused top bits */
  513. left = FLAC__BITS_PER_WORD - bw->bits;
  514. if(lsbits < left) {
  515. bw->accum <<= lsbits;
  516. bw->accum |= uval;
  517. bw->bits += lsbits;
  518. }
  519. else {
  520. /* if bw->bits == 0, left==FLAC__BITS_PER_WORD which will always
  521. * be > lsbits (because of previous assertions) so it would have
  522. * triggered the (lsbits<left) case above.
  523. */
  524. FLAC__ASSERT(bw->bits);
  525. FLAC__ASSERT(left < FLAC__BITS_PER_WORD);
  526. bw->accum <<= left;
  527. bw->accum |= uval >> (bw->bits = lsbits - left);
  528. bw->buffer[bw->words++] = SWAP_BE_WORD_TO_HOST(bw->accum);
  529. bw->accum = uval; /* unused top bits can contain garbage */
  530. }
  531. }
  532. vals++;
  533. nvals--;
  534. }
  535. return true;
  536. }
  537. #if 0 /* UNUSED */
  538. FLAC__bool FLAC__bitwriter_write_golomb_signed(FLAC__BitWriter *bw, int val, uint32_t parameter)
  539. {
  540. uint32_t total_bits, msbs, uval;
  541. uint32_t k;
  542. FLAC__ASSERT(0 != bw);
  543. FLAC__ASSERT(0 != bw->buffer);
  544. FLAC__ASSERT(parameter > 0);
  545. /* fold signed to uint32_t */
  546. if(val < 0)
  547. uval = (uint32_t)(((-(++val)) << 1) + 1);
  548. else
  549. uval = (uint32_t)(val << 1);
  550. k = FLAC__bitmath_ilog2(parameter);
  551. if(parameter == 1u<<k) {
  552. uint32_t pattern;
  553. FLAC__ASSERT(k <= 30);
  554. msbs = uval >> k;
  555. total_bits = 1 + k + msbs;
  556. pattern = 1 << k; /* the unary end bit */
  557. pattern |= (uval & ((1u<<k)-1)); /* the binary LSBs */
  558. if(total_bits <= 32) {
  559. if(!FLAC__bitwriter_write_raw_uint32(bw, pattern, total_bits))
  560. return false;
  561. }
  562. else {
  563. /* write the unary MSBs */
  564. if(!FLAC__bitwriter_write_zeroes(bw, msbs))
  565. return false;
  566. /* write the unary end bit and binary LSBs */
  567. if(!FLAC__bitwriter_write_raw_uint32(bw, pattern, k+1))
  568. return false;
  569. }
  570. }
  571. else {
  572. uint32_t q, r, d;
  573. d = (1 << (k+1)) - parameter;
  574. q = uval / parameter;
  575. r = uval - (q * parameter);
  576. /* write the unary MSBs */
  577. if(!FLAC__bitwriter_write_zeroes(bw, q))
  578. return false;
  579. /* write the unary end bit */
  580. if(!FLAC__bitwriter_write_raw_uint32(bw, 1, 1))
  581. return false;
  582. /* write the binary LSBs */
  583. if(r >= d) {
  584. if(!FLAC__bitwriter_write_raw_uint32(bw, r+d, k+1))
  585. return false;
  586. }
  587. else {
  588. if(!FLAC__bitwriter_write_raw_uint32(bw, r, k))
  589. return false;
  590. }
  591. }
  592. return true;
  593. }
  594. FLAC__bool FLAC__bitwriter_write_golomb_unsigned(FLAC__BitWriter *bw, uint32_t uval, uint32_t parameter)
  595. {
  596. uint32_t total_bits, msbs;
  597. uint32_t k;
  598. FLAC__ASSERT(0 != bw);
  599. FLAC__ASSERT(0 != bw->buffer);
  600. FLAC__ASSERT(parameter > 0);
  601. k = FLAC__bitmath_ilog2(parameter);
  602. if(parameter == 1u<<k) {
  603. uint32_t pattern;
  604. FLAC__ASSERT(k <= 30);
  605. msbs = uval >> k;
  606. total_bits = 1 + k + msbs;
  607. pattern = 1 << k; /* the unary end bit */
  608. pattern |= (uval & ((1u<<k)-1)); /* the binary LSBs */
  609. if(total_bits <= 32) {
  610. if(!FLAC__bitwriter_write_raw_uint32(bw, pattern, total_bits))
  611. return false;
  612. }
  613. else {
  614. /* write the unary MSBs */
  615. if(!FLAC__bitwriter_write_zeroes(bw, msbs))
  616. return false;
  617. /* write the unary end bit and binary LSBs */
  618. if(!FLAC__bitwriter_write_raw_uint32(bw, pattern, k+1))
  619. return false;
  620. }
  621. }
  622. else {
  623. uint32_t q, r, d;
  624. d = (1 << (k+1)) - parameter;
  625. q = uval / parameter;
  626. r = uval - (q * parameter);
  627. /* write the unary MSBs */
  628. if(!FLAC__bitwriter_write_zeroes(bw, q))
  629. return false;
  630. /* write the unary end bit */
  631. if(!FLAC__bitwriter_write_raw_uint32(bw, 1, 1))
  632. return false;
  633. /* write the binary LSBs */
  634. if(r >= d) {
  635. if(!FLAC__bitwriter_write_raw_uint32(bw, r+d, k+1))
  636. return false;
  637. }
  638. else {
  639. if(!FLAC__bitwriter_write_raw_uint32(bw, r, k))
  640. return false;
  641. }
  642. }
  643. return true;
  644. }
  645. #endif /* UNUSED */
  646. FLAC__bool FLAC__bitwriter_write_utf8_uint32(FLAC__BitWriter *bw, FLAC__uint32 val)
  647. {
  648. FLAC__bool ok = 1;
  649. FLAC__ASSERT(0 != bw);
  650. FLAC__ASSERT(0 != bw->buffer);
  651. if((val & 0x80000000) != 0) /* this version only handles 31 bits */
  652. return false;
  653. if(val < 0x80) {
  654. return FLAC__bitwriter_write_raw_uint32_nocheck(bw, val, 8);
  655. }
  656. else if(val < 0x800) {
  657. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0xC0 | (val>>6), 8);
  658. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (val&0x3F), 8);
  659. }
  660. else if(val < 0x10000) {
  661. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0xE0 | (val>>12), 8);
  662. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | ((val>>6)&0x3F), 8);
  663. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (val&0x3F), 8);
  664. }
  665. else if(val < 0x200000) {
  666. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0xF0 | (val>>18), 8);
  667. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | ((val>>12)&0x3F), 8);
  668. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | ((val>>6)&0x3F), 8);
  669. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (val&0x3F), 8);
  670. }
  671. else if(val < 0x4000000) {
  672. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0xF8 | (val>>24), 8);
  673. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | ((val>>18)&0x3F), 8);
  674. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | ((val>>12)&0x3F), 8);
  675. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | ((val>>6)&0x3F), 8);
  676. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (val&0x3F), 8);
  677. }
  678. else {
  679. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0xFC | (val>>30), 8);
  680. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | ((val>>24)&0x3F), 8);
  681. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | ((val>>18)&0x3F), 8);
  682. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | ((val>>12)&0x3F), 8);
  683. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | ((val>>6)&0x3F), 8);
  684. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (val&0x3F), 8);
  685. }
  686. return ok;
  687. }
  688. FLAC__bool FLAC__bitwriter_write_utf8_uint64(FLAC__BitWriter *bw, FLAC__uint64 val)
  689. {
  690. FLAC__bool ok = 1;
  691. FLAC__ASSERT(0 != bw);
  692. FLAC__ASSERT(0 != bw->buffer);
  693. if((val & FLAC__U64L(0xFFFFFFF000000000)) != 0) /* this version only handles 36 bits */
  694. return false;
  695. if(val < 0x80) {
  696. return FLAC__bitwriter_write_raw_uint32_nocheck(bw, (FLAC__uint32)val, 8);
  697. }
  698. else if(val < 0x800) {
  699. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0xC0 | (FLAC__uint32)(val>>6), 8);
  700. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)(val&0x3F), 8);
  701. }
  702. else if(val < 0x10000) {
  703. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0xE0 | (FLAC__uint32)(val>>12), 8);
  704. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>6)&0x3F), 8);
  705. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)(val&0x3F), 8);
  706. }
  707. else if(val < 0x200000) {
  708. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0xF0 | (FLAC__uint32)(val>>18), 8);
  709. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>12)&0x3F), 8);
  710. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>6)&0x3F), 8);
  711. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)(val&0x3F), 8);
  712. }
  713. else if(val < 0x4000000) {
  714. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0xF8 | (FLAC__uint32)(val>>24), 8);
  715. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>18)&0x3F), 8);
  716. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>12)&0x3F), 8);
  717. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>6)&0x3F), 8);
  718. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)(val&0x3F), 8);
  719. }
  720. else if(val < 0x80000000) {
  721. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0xFC | (FLAC__uint32)(val>>30), 8);
  722. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>24)&0x3F), 8);
  723. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>18)&0x3F), 8);
  724. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>12)&0x3F), 8);
  725. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>6)&0x3F), 8);
  726. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)(val&0x3F), 8);
  727. }
  728. else {
  729. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0xFE, 8);
  730. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>30)&0x3F), 8);
  731. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>24)&0x3F), 8);
  732. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>18)&0x3F), 8);
  733. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>12)&0x3F), 8);
  734. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)((val>>6)&0x3F), 8);
  735. ok &= FLAC__bitwriter_write_raw_uint32_nocheck(bw, 0x80 | (FLAC__uint32)(val&0x3F), 8);
  736. }
  737. return ok;
  738. }
  739. FLAC__bool FLAC__bitwriter_zero_pad_to_byte_boundary(FLAC__BitWriter *bw)
  740. {
  741. /* 0-pad to byte boundary */
  742. if(bw->bits & 7u)
  743. return FLAC__bitwriter_write_zeroes(bw, 8 - (bw->bits & 7u));
  744. else
  745. return true;
  746. }
  747. /* These functions are declared inline in this file but are also callable as
  748. * externs from elsewhere.
  749. * According to the C99 spec, section 6.7.4, simply providing a function
  750. * prototype in a header file without 'inline' and making the function inline
  751. * in this file should be sufficient.
  752. * Unfortunately, the Microsoft VS compiler doesn't pick them up externally. To
  753. * fix that we add extern declarations here.
  754. */
  755. extern FLAC__bool FLAC__bitwriter_write_zeroes(FLAC__BitWriter *bw, uint32_t bits);
  756. extern FLAC__bool FLAC__bitwriter_write_raw_uint32(FLAC__BitWriter *bw, FLAC__uint32 val, uint32_t bits);
  757. extern FLAC__bool FLAC__bitwriter_write_raw_int32(FLAC__BitWriter *bw, FLAC__int32 val, uint32_t bits);
  758. extern FLAC__bool FLAC__bitwriter_write_raw_uint64(FLAC__BitWriter *bw, FLAC__uint64 val, uint32_t bits);
  759. extern FLAC__bool FLAC__bitwriter_write_raw_uint32_little_endian(FLAC__BitWriter *bw, FLAC__uint32 val);
  760. extern FLAC__bool FLAC__bitwriter_write_byte_block(FLAC__BitWriter *bw, const FLAC__byte vals[], uint32_t nvals);