mirror of
https://gitlab.winehq.org/wine/wine-gecko.git
synced 2024-09-13 09:24:08 -07:00
f2b6a8b7fe
--HG-- rename : modules/libfishsound/AUTHORS => media/libfishsound/AUTHORS rename : modules/libfishsound/COPYING => media/libfishsound/COPYING rename : modules/libfishsound/ChangeLog => media/libfishsound/ChangeLog rename : modules/libfishsound/Makefile.in => media/libfishsound/Makefile.in rename : modules/libfishsound/README => media/libfishsound/README rename : modules/libfishsound/README_MOZILLA => media/libfishsound/README_MOZILLA rename : modules/libfishsound/include/Makefile.in => media/libfishsound/include/Makefile.in rename : modules/libfishsound/include/fishsound/Makefile.in => media/libfishsound/include/fishsound/Makefile.in rename : modules/libfishsound/include/fishsound/comments.h => media/libfishsound/include/fishsound/comments.h rename : modules/libfishsound/include/fishsound/config.h => media/libfishsound/include/fishsound/config.h rename : modules/libfishsound/include/fishsound/constants.h => media/libfishsound/include/fishsound/constants.h rename : modules/libfishsound/include/fishsound/decode.h => media/libfishsound/include/fishsound/decode.h rename : modules/libfishsound/include/fishsound/deprecated.h => media/libfishsound/include/fishsound/deprecated.h rename : modules/libfishsound/include/fishsound/encode.h => media/libfishsound/include/fishsound/encode.h rename : modules/libfishsound/include/fishsound/fishsound.h => media/libfishsound/include/fishsound/fishsound.h rename : modules/libfishsound/src/Makefile.in => media/libfishsound/src/Makefile.in rename : modules/libfishsound/src/libfishsound/Makefile.in => media/libfishsound/src/libfishsound/Makefile.in rename : modules/libfishsound/src/libfishsound/config.h => media/libfishsound/src/libfishsound/config.h rename : modules/libfishsound/src/libfishsound/convert.h => media/libfishsound/src/libfishsound/convert.h rename : modules/libfishsound/src/libfishsound/convert_c.h => media/libfishsound/src/libfishsound/convert_c.h rename : modules/libfishsound/src/libfishsound/convert_oil.h => media/libfishsound/src/libfishsound/convert_oil.h rename : modules/libfishsound/src/libfishsound/fishsound.c => media/libfishsound/src/libfishsound/fishsound.c rename : modules/libfishsound/src/libfishsound/fishsound_comments.c => media/libfishsound/src/libfishsound/fishsound_comments.c rename : modules/libfishsound/src/libfishsound/fishsound_decode.c => media/libfishsound/src/libfishsound/fishsound_decode.c rename : modules/libfishsound/src/libfishsound/fishsound_encode.c => media/libfishsound/src/libfishsound/fishsound_encode.c rename : modules/libfishsound/src/libfishsound/fishsound_flac.c => media/libfishsound/src/libfishsound/fishsound_flac.c rename : modules/libfishsound/src/libfishsound/fishsound_speex.c => media/libfishsound/src/libfishsound/fishsound_speex.c rename : modules/libfishsound/src/libfishsound/fishsound_vorbis.c => media/libfishsound/src/libfishsound/fishsound_vorbis.c rename : modules/libfishsound/src/libfishsound/fs_compat.h => media/libfishsound/src/libfishsound/fs_compat.h rename : modules/libfishsound/src/libfishsound/fs_vector.c => media/libfishsound/src/libfishsound/fs_vector.c rename : modules/libfishsound/src/libfishsound/fs_vector.h => media/libfishsound/src/libfishsound/fs_vector.h rename : modules/libfishsound/src/libfishsound/private.h => media/libfishsound/src/libfishsound/private.h rename : modules/libfishsound/update.sh => media/libfishsound/update.sh rename : modules/libogg/AUTHORS => media/libogg/AUTHORS rename : modules/libogg/CHANGES => media/libogg/CHANGES rename : modules/libogg/COPYING => media/libogg/COPYING rename : modules/libogg/Makefile.in => media/libogg/Makefile.in rename : modules/libogg/README => media/libogg/README rename : modules/libogg/README_MOZILLA => media/libogg/README_MOZILLA rename : modules/libogg/include/Makefile.in => media/libogg/include/Makefile.in rename : modules/libogg/include/ogg/Makefile.in => media/libogg/include/ogg/Makefile.in rename : modules/libogg/include/ogg/config_types.h => media/libogg/include/ogg/config_types.h rename : modules/libogg/include/ogg/ogg.h => media/libogg/include/ogg/ogg.h rename : modules/libogg/include/ogg/os_types.h => media/libogg/include/ogg/os_types.h rename : modules/libogg/src/Makefile.in => media/libogg/src/Makefile.in rename : modules/libogg/src/bitwise.c => media/libogg/src/bitwise.c rename : modules/libogg/src/framing.c => media/libogg/src/framing.c rename : modules/libogg/src/ogg_bitwise.c => media/libogg/src/ogg_bitwise.c rename : modules/libogg/src/ogg_framing.c => media/libogg/src/ogg_framing.c rename : modules/libogg/update.sh => media/libogg/update.sh rename : modules/liboggplay/Makefile.in => media/liboggplay/Makefile.in rename : modules/liboggplay/README => media/liboggplay/README rename : modules/liboggplay/README_MOZILLA => media/liboggplay/README_MOZILLA rename : modules/liboggplay/include/Makefile.in => media/liboggplay/include/Makefile.in rename : modules/liboggplay/include/oggplay/Makefile.in => media/liboggplay/include/oggplay/Makefile.in rename : modules/liboggplay/include/oggplay/config_win32.h => media/liboggplay/include/oggplay/config_win32.h rename : modules/liboggplay/include/oggplay/oggplay.h => media/liboggplay/include/oggplay/oggplay.h rename : modules/liboggplay/include/oggplay/oggplay_callback_info.h => media/liboggplay/include/oggplay/oggplay_callback_info.h rename : modules/liboggplay/include/oggplay/oggplay_enums.h => media/liboggplay/include/oggplay/oggplay_enums.h rename : modules/liboggplay/include/oggplay/oggplay_query.h => media/liboggplay/include/oggplay/oggplay_query.h rename : modules/liboggplay/include/oggplay/oggplay_reader.h => media/liboggplay/include/oggplay/oggplay_reader.h rename : modules/liboggplay/include/oggplay/oggplay_seek.h => media/liboggplay/include/oggplay/oggplay_seek.h rename : modules/liboggplay/include/oggplay/oggplay_tools.h => media/liboggplay/include/oggplay/oggplay_tools.h rename : modules/liboggplay/src/Makefile.in => media/liboggplay/src/Makefile.in rename : modules/liboggplay/src/liboggplay/Makefile.in => media/liboggplay/src/liboggplay/Makefile.in rename : modules/liboggplay/src/liboggplay/config.h => media/liboggplay/src/liboggplay/config.h rename : modules/liboggplay/src/liboggplay/oggplay.c => media/liboggplay/src/liboggplay/oggplay.c rename : modules/liboggplay/src/liboggplay/oggplay_buffer.c => media/liboggplay/src/liboggplay/oggplay_buffer.c rename : modules/liboggplay/src/liboggplay/oggplay_buffer.h => media/liboggplay/src/liboggplay/oggplay_buffer.h rename : modules/liboggplay/src/liboggplay/oggplay_callback.c => media/liboggplay/src/liboggplay/oggplay_callback.c rename : modules/liboggplay/src/liboggplay/oggplay_callback.h => media/liboggplay/src/liboggplay/oggplay_callback.h rename : modules/liboggplay/src/liboggplay/oggplay_callback_info.c => media/liboggplay/src/liboggplay/oggplay_callback_info.c rename : modules/liboggplay/src/liboggplay/oggplay_data.c => media/liboggplay/src/liboggplay/oggplay_data.c rename : modules/liboggplay/src/liboggplay/oggplay_data.h => media/liboggplay/src/liboggplay/oggplay_data.h rename : modules/liboggplay/src/liboggplay/oggplay_file_reader.c => media/liboggplay/src/liboggplay/oggplay_file_reader.c rename : modules/liboggplay/src/liboggplay/oggplay_file_reader.h => media/liboggplay/src/liboggplay/oggplay_file_reader.h rename : modules/liboggplay/src/liboggplay/oggplay_private.h => media/liboggplay/src/liboggplay/oggplay_private.h rename : modules/liboggplay/src/liboggplay/oggplay_query.c => media/liboggplay/src/liboggplay/oggplay_query.c rename : modules/liboggplay/src/liboggplay/oggplay_seek.c => media/liboggplay/src/liboggplay/oggplay_seek.c rename : modules/liboggplay/src/liboggplay/oggplay_tcp_reader.c => media/liboggplay/src/liboggplay/oggplay_tcp_reader.c rename : modules/liboggplay/src/liboggplay/oggplay_tcp_reader.h => media/liboggplay/src/liboggplay/oggplay_tcp_reader.h rename : modules/liboggplay/src/liboggplay/oggplay_tools.c => media/liboggplay/src/liboggplay/oggplay_tools.c rename : modules/liboggplay/src/liboggplay/oggplay_yuv2rgb.c => media/liboggplay/src/liboggplay/oggplay_yuv2rgb.c rename : modules/liboggplay/src/liboggplay/std_semaphore.h => media/liboggplay/src/liboggplay/std_semaphore.h rename : modules/liboggplay/update.sh => media/liboggplay/update.sh rename : modules/liboggplay_audio/Makefile.in => media/liboggplay_audio/Makefile.in rename : modules/liboggplay_audio/README_MOZILLA => media/liboggplay_audio/README_MOZILLA rename : modules/liboggplay_audio/sydney_audio.h => media/liboggplay_audio/sydney_audio.h rename : modules/liboggplay_audio/sydney_audio_alsa.c => media/liboggplay_audio/sydney_audio_alsa.c rename : modules/liboggplay_audio/sydney_audio_mac.c => media/liboggplay_audio/sydney_audio_mac.c rename : modules/liboggplay_audio/sydney_audio_oss.c => media/liboggplay_audio/sydney_audio_oss.c rename : modules/liboggplay_audio/sydney_audio_waveapi.c => media/liboggplay_audio/sydney_audio_waveapi.c rename : modules/liboggplay_audio/update.sh => media/liboggplay_audio/update.sh rename : modules/liboggz/AUTHORS => media/liboggz/AUTHORS rename : modules/liboggz/COPYING => media/liboggz/COPYING rename : modules/liboggz/ChangeLog => media/liboggz/ChangeLog rename : modules/liboggz/Makefile.in => media/liboggz/Makefile.in rename : modules/liboggz/README => media/liboggz/README rename : modules/liboggz/README_MOZILLA => media/liboggz/README_MOZILLA rename : modules/liboggz/include/Makefile.in => media/liboggz/include/Makefile.in rename : modules/liboggz/include/oggz/Makefile.in => media/liboggz/include/oggz/Makefile.in rename : modules/liboggz/include/oggz/config.h => media/liboggz/include/oggz/config.h rename : modules/liboggz/include/oggz/config_win32.h => media/liboggz/include/oggz/config_win32.h rename : modules/liboggz/include/oggz/oggz.h => media/liboggz/include/oggz/oggz.h rename : modules/liboggz/include/oggz/oggz_comments.h => media/liboggz/include/oggz/oggz_comments.h rename : modules/liboggz/include/oggz/oggz_constants.h => media/liboggz/include/oggz/oggz_constants.h rename : modules/liboggz/include/oggz/oggz_deprecated.h => media/liboggz/include/oggz/oggz_deprecated.h rename : modules/liboggz/include/oggz/oggz_io.h => media/liboggz/include/oggz/oggz_io.h rename : modules/liboggz/include/oggz/oggz_off_t.h => media/liboggz/include/oggz/oggz_off_t.h rename : modules/liboggz/include/oggz/oggz_off_t_generated.h => media/liboggz/include/oggz/oggz_off_t_generated.h rename : modules/liboggz/include/oggz/oggz_read.h => media/liboggz/include/oggz/oggz_read.h rename : modules/liboggz/include/oggz/oggz_seek.h => media/liboggz/include/oggz/oggz_seek.h rename : modules/liboggz/include/oggz/oggz_stream.h => media/liboggz/include/oggz/oggz_stream.h rename : modules/liboggz/include/oggz/oggz_table.h => media/liboggz/include/oggz/oggz_table.h rename : modules/liboggz/include/oggz/oggz_write.h => media/liboggz/include/oggz/oggz_write.h rename : modules/liboggz/src/Makefile.in => media/liboggz/src/Makefile.in rename : modules/liboggz/src/liboggz/Makefile.in => media/liboggz/src/liboggz/Makefile.in rename : modules/liboggz/src/liboggz/metric_internal.c => media/liboggz/src/liboggz/metric_internal.c rename : modules/liboggz/src/liboggz/oggz.c => media/liboggz/src/liboggz/oggz.c rename : modules/liboggz/src/liboggz/oggz_auto.c => media/liboggz/src/liboggz/oggz_auto.c rename : modules/liboggz/src/liboggz/oggz_auto.h => media/liboggz/src/liboggz/oggz_auto.h rename : modules/liboggz/src/liboggz/oggz_byteorder.h => media/liboggz/src/liboggz/oggz_byteorder.h rename : modules/liboggz/src/liboggz/oggz_comments.c => media/liboggz/src/liboggz/oggz_comments.c rename : modules/liboggz/src/liboggz/oggz_compat.h => media/liboggz/src/liboggz/oggz_compat.h rename : modules/liboggz/src/liboggz/oggz_dlist.c => media/liboggz/src/liboggz/oggz_dlist.c rename : modules/liboggz/src/liboggz/oggz_dlist.h => media/liboggz/src/liboggz/oggz_dlist.h rename : modules/liboggz/src/liboggz/oggz_io.c => media/liboggz/src/liboggz/oggz_io.c rename : modules/liboggz/src/liboggz/oggz_macros.h => media/liboggz/src/liboggz/oggz_macros.h rename : modules/liboggz/src/liboggz/oggz_private.h => media/liboggz/src/liboggz/oggz_private.h rename : modules/liboggz/src/liboggz/oggz_read.c => media/liboggz/src/liboggz/oggz_read.c rename : modules/liboggz/src/liboggz/oggz_seek.c => media/liboggz/src/liboggz/oggz_seek.c rename : modules/liboggz/src/liboggz/oggz_stream.c => media/liboggz/src/liboggz/oggz_stream.c rename : modules/liboggz/src/liboggz/oggz_stream.h => media/liboggz/src/liboggz/oggz_stream.h rename : modules/liboggz/src/liboggz/oggz_stream_private.h => media/liboggz/src/liboggz/oggz_stream_private.h rename : modules/liboggz/src/liboggz/oggz_table.c => media/liboggz/src/liboggz/oggz_table.c rename : modules/liboggz/src/liboggz/oggz_vector.c => media/liboggz/src/liboggz/oggz_vector.c rename : modules/liboggz/src/liboggz/oggz_vector.h => media/liboggz/src/liboggz/oggz_vector.h rename : modules/liboggz/src/liboggz/oggz_write.c => media/liboggz/src/liboggz/oggz_write.c rename : modules/liboggz/update.sh => media/liboggz/update.sh rename : modules/libtheora/AUTHORS => media/libtheora/AUTHORS rename : modules/libtheora/CHANGES => media/libtheora/CHANGES rename : modules/libtheora/COPYING => media/libtheora/COPYING rename : modules/libtheora/LICENSE => media/libtheora/LICENSE rename : modules/libtheora/Makefile.in => media/libtheora/Makefile.in rename : modules/libtheora/README => media/libtheora/README rename : modules/libtheora/README_MOZILLA => media/libtheora/README_MOZILLA rename : modules/libtheora/changeset_r15144.diff => media/libtheora/changeset_r15144.diff rename : modules/libtheora/include/Makefile.in => media/libtheora/include/Makefile.in rename : modules/libtheora/include/theora/Makefile.in => media/libtheora/include/theora/Makefile.in rename : modules/libtheora/include/theora/codec.h => media/libtheora/include/theora/codec.h rename : modules/libtheora/include/theora/config.h => media/libtheora/include/theora/config.h rename : modules/libtheora/include/theora/theora.h => media/libtheora/include/theora/theora.h rename : modules/libtheora/include/theora/theoradec.h => media/libtheora/include/theora/theoradec.h rename : modules/libtheora/lib/Makefile.in => media/libtheora/lib/Makefile.in rename : modules/libtheora/lib/config.h => media/libtheora/lib/config.h rename : modules/libtheora/lib/cpu.c => media/libtheora/lib/cpu.c rename : modules/libtheora/lib/cpu.h => media/libtheora/lib/cpu.h rename : modules/libtheora/lib/dec/apiwrapper.c => media/libtheora/lib/dec/apiwrapper.c rename : modules/libtheora/lib/dec/apiwrapper.h => media/libtheora/lib/dec/apiwrapper.h rename : modules/libtheora/lib/dec/bitwise.c => media/libtheora/lib/dec/bitwise.c rename : modules/libtheora/lib/dec/bitwise.h => media/libtheora/lib/dec/bitwise.h rename : modules/libtheora/lib/dec/dct.h => media/libtheora/lib/dec/dct.h rename : modules/libtheora/lib/dec/decapiwrapper.c => media/libtheora/lib/dec/decapiwrapper.c rename : modules/libtheora/lib/dec/decinfo.c => media/libtheora/lib/dec/decinfo.c rename : modules/libtheora/lib/dec/decint.h => media/libtheora/lib/dec/decint.h rename : modules/libtheora/lib/dec/decode.c => media/libtheora/lib/dec/decode.c rename : modules/libtheora/lib/dec/dequant.c => media/libtheora/lib/dec/dequant.c rename : modules/libtheora/lib/dec/dequant.h => media/libtheora/lib/dec/dequant.h rename : modules/libtheora/lib/dec/enquant.h => media/libtheora/lib/dec/enquant.h rename : modules/libtheora/lib/dec/fragment.c => media/libtheora/lib/dec/fragment.c rename : modules/libtheora/lib/dec/huffdec.c => media/libtheora/lib/dec/huffdec.c rename : modules/libtheora/lib/dec/huffdec.h => media/libtheora/lib/dec/huffdec.h rename : modules/libtheora/lib/dec/huffman.h => media/libtheora/lib/dec/huffman.h rename : modules/libtheora/lib/dec/idct.c => media/libtheora/lib/dec/idct.c rename : modules/libtheora/lib/dec/idct.h => media/libtheora/lib/dec/idct.h rename : modules/libtheora/lib/dec/info.c => media/libtheora/lib/dec/info.c rename : modules/libtheora/lib/dec/internal.c => media/libtheora/lib/dec/internal.c rename : modules/libtheora/lib/dec/ocintrin.h => media/libtheora/lib/dec/ocintrin.h rename : modules/libtheora/lib/dec/quant.c => media/libtheora/lib/dec/quant.c rename : modules/libtheora/lib/dec/quant.h => media/libtheora/lib/dec/quant.h rename : modules/libtheora/lib/dec/state.c => media/libtheora/lib/dec/state.c rename : modules/libtheora/lib/dec/x86/mmxfrag.c => media/libtheora/lib/dec/x86/mmxfrag.c rename : modules/libtheora/lib/dec/x86/mmxidct.c => media/libtheora/lib/dec/x86/mmxidct.c rename : modules/libtheora/lib/dec/x86/mmxstate.c => media/libtheora/lib/dec/x86/mmxstate.c rename : modules/libtheora/lib/dec/x86/x86int.h => media/libtheora/lib/dec/x86/x86int.h rename : modules/libtheora/lib/dec/x86/x86state.c => media/libtheora/lib/dec/x86/x86state.c rename : modules/libtheora/lib/internal.h => media/libtheora/lib/internal.h rename : modules/libtheora/update.sh => media/libtheora/update.sh rename : modules/libvorbis/AUTHORS => media/libvorbis/AUTHORS rename : modules/libvorbis/COPYING => media/libvorbis/COPYING rename : modules/libvorbis/Makefile.in => media/libvorbis/Makefile.in rename : modules/libvorbis/README => media/libvorbis/README rename : modules/libvorbis/README_MOZILLA => media/libvorbis/README_MOZILLA rename : modules/libvorbis/include/Makefile.in => media/libvorbis/include/Makefile.in rename : modules/libvorbis/include/vorbis/Makefile.in => media/libvorbis/include/vorbis/Makefile.in rename : modules/libvorbis/include/vorbis/codec.h => media/libvorbis/include/vorbis/codec.h rename : modules/libvorbis/lib/Makefile.in => media/libvorbis/lib/Makefile.in rename : modules/libvorbis/lib/backends.h => media/libvorbis/lib/backends.h rename : modules/libvorbis/lib/bitrate.h => media/libvorbis/lib/bitrate.h rename : modules/libvorbis/lib/codebook.h => media/libvorbis/lib/codebook.h rename : modules/libvorbis/lib/codec_internal.h => media/libvorbis/lib/codec_internal.h rename : modules/libvorbis/lib/envelope.h => media/libvorbis/lib/envelope.h rename : modules/libvorbis/lib/highlevel.h => media/libvorbis/lib/highlevel.h rename : modules/libvorbis/lib/lookup.h => media/libvorbis/lib/lookup.h rename : modules/libvorbis/lib/lookup_data.h => media/libvorbis/lib/lookup_data.h rename : modules/libvorbis/lib/lpc.h => media/libvorbis/lib/lpc.h rename : modules/libvorbis/lib/lsp.h => media/libvorbis/lib/lsp.h rename : modules/libvorbis/lib/masking.h => media/libvorbis/lib/masking.h rename : modules/libvorbis/lib/mdct.h => media/libvorbis/lib/mdct.h rename : modules/libvorbis/lib/misc.h => media/libvorbis/lib/misc.h rename : modules/libvorbis/lib/os.h => media/libvorbis/lib/os.h rename : modules/libvorbis/lib/psy.h => media/libvorbis/lib/psy.h rename : modules/libvorbis/lib/registry.h => media/libvorbis/lib/registry.h rename : modules/libvorbis/lib/scales.h => media/libvorbis/lib/scales.h rename : modules/libvorbis/lib/smallft.h => media/libvorbis/lib/smallft.h rename : modules/libvorbis/lib/vorbis_analysis.c => media/libvorbis/lib/vorbis_analysis.c rename : modules/libvorbis/lib/vorbis_bitrate.c => media/libvorbis/lib/vorbis_bitrate.c rename : modules/libvorbis/lib/vorbis_block.c => media/libvorbis/lib/vorbis_block.c rename : modules/libvorbis/lib/vorbis_codebook.c => media/libvorbis/lib/vorbis_codebook.c rename : modules/libvorbis/lib/vorbis_envelope.c => media/libvorbis/lib/vorbis_envelope.c rename : modules/libvorbis/lib/vorbis_floor0.c => media/libvorbis/lib/vorbis_floor0.c rename : modules/libvorbis/lib/vorbis_floor1.c => media/libvorbis/lib/vorbis_floor1.c rename : modules/libvorbis/lib/vorbis_info.c => media/libvorbis/lib/vorbis_info.c rename : modules/libvorbis/lib/vorbis_lookup.c => media/libvorbis/lib/vorbis_lookup.c rename : modules/libvorbis/lib/vorbis_lpc.c => media/libvorbis/lib/vorbis_lpc.c rename : modules/libvorbis/lib/vorbis_lsp.c => media/libvorbis/lib/vorbis_lsp.c rename : modules/libvorbis/lib/vorbis_mapping0.c => media/libvorbis/lib/vorbis_mapping0.c rename : modules/libvorbis/lib/vorbis_mdct.c => media/libvorbis/lib/vorbis_mdct.c rename : modules/libvorbis/lib/vorbis_psy.c => media/libvorbis/lib/vorbis_psy.c rename : modules/libvorbis/lib/vorbis_registry.c => media/libvorbis/lib/vorbis_registry.c rename : modules/libvorbis/lib/vorbis_res0.c => media/libvorbis/lib/vorbis_res0.c rename : modules/libvorbis/lib/vorbis_sharedbook.c => media/libvorbis/lib/vorbis_sharedbook.c rename : modules/libvorbis/lib/vorbis_smallft.c => media/libvorbis/lib/vorbis_smallft.c rename : modules/libvorbis/lib/vorbis_synthesis.c => media/libvorbis/lib/vorbis_synthesis.c rename : modules/libvorbis/lib/vorbis_window.c => media/libvorbis/lib/vorbis_window.c rename : modules/libvorbis/lib/window.h => media/libvorbis/lib/window.h rename : modules/libvorbis/todo.txt => media/libvorbis/todo.txt rename : modules/libvorbis/update.sh => media/libvorbis/update.sh
736 lines
19 KiB
C
736 lines
19 KiB
C
/********************************************************************
|
|
* *
|
|
* THIS FILE IS PART OF THE OggVorbis SOFTWARE CODEC SOURCE CODE. *
|
|
* USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS *
|
|
* GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE *
|
|
* IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. *
|
|
* *
|
|
* THE OggVorbis SOURCE CODE IS (C) COPYRIGHT 1994-2007 *
|
|
* by the Xiph.Org Foundation http://www.xiph.org/ *
|
|
* *
|
|
********************************************************************
|
|
|
|
function: basic shared codebook operations
|
|
last mod: $Id: sharedbook.c 13293 2007-07-24 00:09:47Z xiphmont $
|
|
|
|
********************************************************************/
|
|
|
|
#include <stdlib.h>
|
|
#include <math.h>
|
|
#include <string.h>
|
|
#include <ogg/ogg.h>
|
|
#include "os.h"
|
|
#include "misc.h"
|
|
#include "vorbis/codec.h"
|
|
#include "codebook.h"
|
|
#include "scales.h"
|
|
|
|
/**** pack/unpack helpers ******************************************/
|
|
int _ilog(unsigned int v){
|
|
int ret=0;
|
|
while(v){
|
|
ret++;
|
|
v>>=1;
|
|
}
|
|
return(ret);
|
|
}
|
|
|
|
/* 32 bit float (not IEEE; nonnormalized mantissa +
|
|
biased exponent) : neeeeeee eeemmmmm mmmmmmmm mmmmmmmm
|
|
Why not IEEE? It's just not that important here. */
|
|
|
|
#define VQ_FEXP 10
|
|
#define VQ_FMAN 21
|
|
#define VQ_FEXP_BIAS 768 /* bias toward values smaller than 1. */
|
|
|
|
/* doesn't currently guard under/overflow */
|
|
long _float32_pack(float val){
|
|
int sign=0;
|
|
long exp;
|
|
long mant;
|
|
if(val<0){
|
|
sign=0x80000000;
|
|
val= -val;
|
|
}
|
|
exp= floor(log(val)/log(2.f));
|
|
mant=rint(ldexp(val,(VQ_FMAN-1)-exp));
|
|
exp=(exp+VQ_FEXP_BIAS)<<VQ_FMAN;
|
|
|
|
return(sign|exp|mant);
|
|
}
|
|
|
|
float _float32_unpack(long val){
|
|
double mant=val&0x1fffff;
|
|
int sign=val&0x80000000;
|
|
long exp =(val&0x7fe00000L)>>VQ_FMAN;
|
|
if(sign)mant= -mant;
|
|
return(ldexp(mant,exp-(VQ_FMAN-1)-VQ_FEXP_BIAS));
|
|
}
|
|
|
|
/* given a list of word lengths, generate a list of codewords. Works
|
|
for length ordered or unordered, always assigns the lowest valued
|
|
codewords first. Extended to handle unused entries (length 0) */
|
|
ogg_uint32_t *_make_words(long *l,long n,long sparsecount){
|
|
long i,j,count=0;
|
|
ogg_uint32_t marker[33];
|
|
ogg_uint32_t *r=_ogg_malloc((sparsecount?sparsecount:n)*sizeof(*r));
|
|
memset(marker,0,sizeof(marker));
|
|
|
|
for(i=0;i<n;i++){
|
|
long length=l[i];
|
|
if(length>0){
|
|
ogg_uint32_t entry=marker[length];
|
|
|
|
/* when we claim a node for an entry, we also claim the nodes
|
|
below it (pruning off the imagined tree that may have dangled
|
|
from it) as well as blocking the use of any nodes directly
|
|
above for leaves */
|
|
|
|
/* update ourself */
|
|
if(length<32 && (entry>>length)){
|
|
/* error condition; the lengths must specify an overpopulated tree */
|
|
_ogg_free(r);
|
|
return(NULL);
|
|
}
|
|
r[count++]=entry;
|
|
|
|
/* Look to see if the next shorter marker points to the node
|
|
above. if so, update it and repeat. */
|
|
{
|
|
for(j=length;j>0;j--){
|
|
|
|
if(marker[j]&1){
|
|
/* have to jump branches */
|
|
if(j==1)
|
|
marker[1]++;
|
|
else
|
|
marker[j]=marker[j-1]<<1;
|
|
break; /* invariant says next upper marker would already
|
|
have been moved if it was on the same path */
|
|
}
|
|
marker[j]++;
|
|
}
|
|
}
|
|
|
|
/* prune the tree; the implicit invariant says all the longer
|
|
markers were dangling from our just-taken node. Dangle them
|
|
from our *new* node. */
|
|
for(j=length+1;j<33;j++)
|
|
if((marker[j]>>1) == entry){
|
|
entry=marker[j];
|
|
marker[j]=marker[j-1]<<1;
|
|
}else
|
|
break;
|
|
}else
|
|
if(sparsecount==0)count++;
|
|
}
|
|
|
|
/* bitreverse the words because our bitwise packer/unpacker is LSb
|
|
endian */
|
|
for(i=0,count=0;i<n;i++){
|
|
ogg_uint32_t temp=0;
|
|
for(j=0;j<l[i];j++){
|
|
temp<<=1;
|
|
temp|=(r[count]>>j)&1;
|
|
}
|
|
|
|
if(sparsecount){
|
|
if(l[i])
|
|
r[count++]=temp;
|
|
}else
|
|
r[count++]=temp;
|
|
}
|
|
|
|
return(r);
|
|
}
|
|
|
|
/* there might be a straightforward one-line way to do the below
|
|
that's portable and totally safe against roundoff, but I haven't
|
|
thought of it. Therefore, we opt on the side of caution */
|
|
long _book_maptype1_quantvals(const static_codebook *b){
|
|
long vals=floor(pow((float)b->entries,1.f/b->dim));
|
|
|
|
/* the above *should* be reliable, but we'll not assume that FP is
|
|
ever reliable when bitstream sync is at stake; verify via integer
|
|
means that vals really is the greatest value of dim for which
|
|
vals^b->bim <= b->entries */
|
|
/* treat the above as an initial guess */
|
|
while(1){
|
|
long acc=1;
|
|
long acc1=1;
|
|
int i;
|
|
for(i=0;i<b->dim;i++){
|
|
acc*=vals;
|
|
acc1*=vals+1;
|
|
}
|
|
if(acc<=b->entries && acc1>b->entries){
|
|
return(vals);
|
|
}else{
|
|
if(acc>b->entries){
|
|
vals--;
|
|
}else{
|
|
vals++;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
/* unpack the quantized list of values for encode/decode ***********/
|
|
/* we need to deal with two map types: in map type 1, the values are
|
|
generated algorithmically (each column of the vector counts through
|
|
the values in the quant vector). in map type 2, all the values came
|
|
in in an explicit list. Both value lists must be unpacked */
|
|
float *_book_unquantize(const static_codebook *b,int n,int *sparsemap){
|
|
long j,k,count=0;
|
|
if(b->maptype==1 || b->maptype==2){
|
|
int quantvals;
|
|
float mindel=_float32_unpack(b->q_min);
|
|
float delta=_float32_unpack(b->q_delta);
|
|
float *r=_ogg_calloc(n*b->dim,sizeof(*r));
|
|
|
|
/* maptype 1 and 2 both use a quantized value vector, but
|
|
different sizes */
|
|
switch(b->maptype){
|
|
case 1:
|
|
/* most of the time, entries%dimensions == 0, but we need to be
|
|
well defined. We define that the possible vales at each
|
|
scalar is values == entries/dim. If entries%dim != 0, we'll
|
|
have 'too few' values (values*dim<entries), which means that
|
|
we'll have 'left over' entries; left over entries use zeroed
|
|
values (and are wasted). So don't generate codebooks like
|
|
that */
|
|
quantvals=_book_maptype1_quantvals(b);
|
|
for(j=0;j<b->entries;j++){
|
|
if((sparsemap && b->lengthlist[j]) || !sparsemap){
|
|
float last=0.f;
|
|
int indexdiv=1;
|
|
for(k=0;k<b->dim;k++){
|
|
int index= (j/indexdiv)%quantvals;
|
|
float val=b->quantlist[index];
|
|
val=fabs(val)*delta+mindel+last;
|
|
if(b->q_sequencep)last=val;
|
|
if(sparsemap)
|
|
r[sparsemap[count]*b->dim+k]=val;
|
|
else
|
|
r[count*b->dim+k]=val;
|
|
indexdiv*=quantvals;
|
|
}
|
|
count++;
|
|
}
|
|
|
|
}
|
|
break;
|
|
case 2:
|
|
for(j=0;j<b->entries;j++){
|
|
if((sparsemap && b->lengthlist[j]) || !sparsemap){
|
|
float last=0.f;
|
|
|
|
for(k=0;k<b->dim;k++){
|
|
float val=b->quantlist[j*b->dim+k];
|
|
val=fabs(val)*delta+mindel+last;
|
|
if(b->q_sequencep)last=val;
|
|
if(sparsemap)
|
|
r[sparsemap[count]*b->dim+k]=val;
|
|
else
|
|
r[count*b->dim+k]=val;
|
|
}
|
|
count++;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
|
|
return(r);
|
|
}
|
|
return(NULL);
|
|
}
|
|
|
|
void vorbis_staticbook_clear(static_codebook *b){
|
|
if(b->allocedp){
|
|
if(b->quantlist)_ogg_free(b->quantlist);
|
|
if(b->lengthlist)_ogg_free(b->lengthlist);
|
|
if(b->nearest_tree){
|
|
_ogg_free(b->nearest_tree->ptr0);
|
|
_ogg_free(b->nearest_tree->ptr1);
|
|
_ogg_free(b->nearest_tree->p);
|
|
_ogg_free(b->nearest_tree->q);
|
|
memset(b->nearest_tree,0,sizeof(*b->nearest_tree));
|
|
_ogg_free(b->nearest_tree);
|
|
}
|
|
if(b->thresh_tree){
|
|
_ogg_free(b->thresh_tree->quantthresh);
|
|
_ogg_free(b->thresh_tree->quantmap);
|
|
memset(b->thresh_tree,0,sizeof(*b->thresh_tree));
|
|
_ogg_free(b->thresh_tree);
|
|
}
|
|
|
|
memset(b,0,sizeof(*b));
|
|
}
|
|
}
|
|
|
|
void vorbis_staticbook_destroy(static_codebook *b){
|
|
if(b->allocedp){
|
|
vorbis_staticbook_clear(b);
|
|
_ogg_free(b);
|
|
}
|
|
}
|
|
|
|
void vorbis_book_clear(codebook *b){
|
|
/* static book is not cleared; we're likely called on the lookup and
|
|
the static codebook belongs to the info struct */
|
|
if(b->valuelist)_ogg_free(b->valuelist);
|
|
if(b->codelist)_ogg_free(b->codelist);
|
|
|
|
if(b->dec_index)_ogg_free(b->dec_index);
|
|
if(b->dec_codelengths)_ogg_free(b->dec_codelengths);
|
|
if(b->dec_firsttable)_ogg_free(b->dec_firsttable);
|
|
|
|
memset(b,0,sizeof(*b));
|
|
}
|
|
|
|
int vorbis_book_init_encode(codebook *c,const static_codebook *s){
|
|
|
|
memset(c,0,sizeof(*c));
|
|
c->c=s;
|
|
c->entries=s->entries;
|
|
c->used_entries=s->entries;
|
|
c->dim=s->dim;
|
|
c->codelist=_make_words(s->lengthlist,s->entries,0);
|
|
c->valuelist=_book_unquantize(s,s->entries,NULL);
|
|
|
|
return(0);
|
|
}
|
|
|
|
static ogg_uint32_t bitreverse(ogg_uint32_t x){
|
|
x= ((x>>16)&0x0000ffffUL) | ((x<<16)&0xffff0000UL);
|
|
x= ((x>> 8)&0x00ff00ffUL) | ((x<< 8)&0xff00ff00UL);
|
|
x= ((x>> 4)&0x0f0f0f0fUL) | ((x<< 4)&0xf0f0f0f0UL);
|
|
x= ((x>> 2)&0x33333333UL) | ((x<< 2)&0xccccccccUL);
|
|
return((x>> 1)&0x55555555UL) | ((x<< 1)&0xaaaaaaaaUL);
|
|
}
|
|
|
|
static int sort32a(const void *a,const void *b){
|
|
return ( **(ogg_uint32_t **)a>**(ogg_uint32_t **)b)-
|
|
( **(ogg_uint32_t **)a<**(ogg_uint32_t **)b);
|
|
}
|
|
|
|
/* decode codebook arrangement is more heavily optimized than encode */
|
|
int vorbis_book_init_decode(codebook *c,const static_codebook *s){
|
|
int i,j,n=0,tabn;
|
|
int *sortindex;
|
|
memset(c,0,sizeof(*c));
|
|
|
|
/* count actually used entries */
|
|
for(i=0;i<s->entries;i++)
|
|
if(s->lengthlist[i]>0)
|
|
n++;
|
|
|
|
c->entries=s->entries;
|
|
c->used_entries=n;
|
|
c->dim=s->dim;
|
|
|
|
if(n>0){
|
|
|
|
/* two different remappings go on here.
|
|
|
|
First, we collapse the likely sparse codebook down only to
|
|
actually represented values/words. This collapsing needs to be
|
|
indexed as map-valueless books are used to encode original entry
|
|
positions as integers.
|
|
|
|
Second, we reorder all vectors, including the entry index above,
|
|
by sorted bitreversed codeword to allow treeless decode. */
|
|
|
|
/* perform sort */
|
|
ogg_uint32_t *codes=_make_words(s->lengthlist,s->entries,c->used_entries);
|
|
ogg_uint32_t **codep=alloca(sizeof(*codep)*n);
|
|
|
|
if(codes==NULL)goto err_out;
|
|
|
|
for(i=0;i<n;i++){
|
|
codes[i]=bitreverse(codes[i]);
|
|
codep[i]=codes+i;
|
|
}
|
|
|
|
qsort(codep,n,sizeof(*codep),sort32a);
|
|
|
|
sortindex=alloca(n*sizeof(*sortindex));
|
|
c->codelist=_ogg_malloc(n*sizeof(*c->codelist));
|
|
/* the index is a reverse index */
|
|
for(i=0;i<n;i++){
|
|
int position=codep[i]-codes;
|
|
sortindex[position]=i;
|
|
}
|
|
|
|
for(i=0;i<n;i++)
|
|
c->codelist[sortindex[i]]=codes[i];
|
|
_ogg_free(codes);
|
|
|
|
|
|
c->valuelist=_book_unquantize(s,n,sortindex);
|
|
c->dec_index=_ogg_malloc(n*sizeof(*c->dec_index));
|
|
|
|
for(n=0,i=0;i<s->entries;i++)
|
|
if(s->lengthlist[i]>0)
|
|
c->dec_index[sortindex[n++]]=i;
|
|
|
|
c->dec_codelengths=_ogg_malloc(n*sizeof(*c->dec_codelengths));
|
|
for(n=0,i=0;i<s->entries;i++)
|
|
if(s->lengthlist[i]>0)
|
|
c->dec_codelengths[sortindex[n++]]=s->lengthlist[i];
|
|
|
|
c->dec_firsttablen=_ilog(c->used_entries)-4; /* this is magic */
|
|
if(c->dec_firsttablen<5)c->dec_firsttablen=5;
|
|
if(c->dec_firsttablen>8)c->dec_firsttablen=8;
|
|
|
|
tabn=1<<c->dec_firsttablen;
|
|
c->dec_firsttable=_ogg_calloc(tabn,sizeof(*c->dec_firsttable));
|
|
c->dec_maxlength=0;
|
|
|
|
for(i=0;i<n;i++){
|
|
if(c->dec_maxlength<c->dec_codelengths[i])
|
|
c->dec_maxlength=c->dec_codelengths[i];
|
|
if(c->dec_codelengths[i]<=c->dec_firsttablen){
|
|
ogg_uint32_t orig=bitreverse(c->codelist[i]);
|
|
for(j=0;j<(1<<(c->dec_firsttablen-c->dec_codelengths[i]));j++)
|
|
c->dec_firsttable[orig|(j<<c->dec_codelengths[i])]=i+1;
|
|
}
|
|
}
|
|
|
|
/* now fill in 'unused' entries in the firsttable with hi/lo search
|
|
hints for the non-direct-hits */
|
|
{
|
|
ogg_uint32_t mask=0xfffffffeUL<<(31-c->dec_firsttablen);
|
|
long lo=0,hi=0;
|
|
|
|
for(i=0;i<tabn;i++){
|
|
ogg_uint32_t word=i<<(32-c->dec_firsttablen);
|
|
if(c->dec_firsttable[bitreverse(word)]==0){
|
|
while((lo+1)<n && c->codelist[lo+1]<=word)lo++;
|
|
while( hi<n && word>=(c->codelist[hi]&mask))hi++;
|
|
|
|
/* we only actually have 15 bits per hint to play with here.
|
|
In order to overflow gracefully (nothing breaks, efficiency
|
|
just drops), encode as the difference from the extremes. */
|
|
{
|
|
unsigned long loval=lo;
|
|
unsigned long hival=n-hi;
|
|
|
|
if(loval>0x7fff)loval=0x7fff;
|
|
if(hival>0x7fff)hival=0x7fff;
|
|
c->dec_firsttable[bitreverse(word)]=
|
|
0x80000000UL | (loval<<15) | hival;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return(0);
|
|
err_out:
|
|
vorbis_book_clear(c);
|
|
return(-1);
|
|
}
|
|
|
|
static float _dist(int el,float *ref, float *b,int step){
|
|
int i;
|
|
float acc=0.f;
|
|
for(i=0;i<el;i++){
|
|
float val=(ref[i]-b[i*step]);
|
|
acc+=val*val;
|
|
}
|
|
return(acc);
|
|
}
|
|
|
|
int _best(codebook *book, float *a, int step){
|
|
encode_aux_threshmatch *tt=book->c->thresh_tree;
|
|
|
|
#if 0
|
|
encode_aux_nearestmatch *nt=book->c->nearest_tree;
|
|
encode_aux_pigeonhole *pt=book->c->pigeon_tree;
|
|
#endif
|
|
int dim=book->dim;
|
|
int k,o;
|
|
/*int savebest=-1;
|
|
float saverr;*/
|
|
|
|
/* do we have a threshhold encode hint? */
|
|
if(tt){
|
|
int index=0,i;
|
|
/* find the quant val of each scalar */
|
|
for(k=0,o=step*(dim-1);k<dim;k++,o-=step){
|
|
|
|
i=tt->threshvals>>1;
|
|
if(a[o]<tt->quantthresh[i]){
|
|
|
|
for(;i>0;i--)
|
|
if(a[o]>=tt->quantthresh[i-1])
|
|
break;
|
|
|
|
}else{
|
|
|
|
for(i++;i<tt->threshvals-1;i++)
|
|
if(a[o]<tt->quantthresh[i])break;
|
|
|
|
}
|
|
|
|
index=(index*tt->quantvals)+tt->quantmap[i];
|
|
}
|
|
/* regular lattices are easy :-) */
|
|
if(book->c->lengthlist[index]>0) /* is this unused? If so, we'll
|
|
use a decision tree after all
|
|
and fall through*/
|
|
return(index);
|
|
}
|
|
|
|
#if 0
|
|
/* do we have a pigeonhole encode hint? */
|
|
if(pt){
|
|
const static_codebook *c=book->c;
|
|
int i,besti=-1;
|
|
float best=0.f;
|
|
int entry=0;
|
|
|
|
/* dealing with sequentialness is a pain in the ass */
|
|
if(c->q_sequencep){
|
|
int pv;
|
|
long mul=1;
|
|
float qlast=0;
|
|
for(k=0,o=0;k<dim;k++,o+=step){
|
|
pv=(int)((a[o]-qlast-pt->min)/pt->del);
|
|
if(pv<0 || pv>=pt->mapentries)break;
|
|
entry+=pt->pigeonmap[pv]*mul;
|
|
mul*=pt->quantvals;
|
|
qlast+=pv*pt->del+pt->min;
|
|
}
|
|
}else{
|
|
for(k=0,o=step*(dim-1);k<dim;k++,o-=step){
|
|
int pv=(int)((a[o]-pt->min)/pt->del);
|
|
if(pv<0 || pv>=pt->mapentries)break;
|
|
entry=entry*pt->quantvals+pt->pigeonmap[pv];
|
|
}
|
|
}
|
|
|
|
/* must be within the pigeonholable range; if we quant outside (or
|
|
in an entry that we define no list for), brute force it */
|
|
if(k==dim && pt->fitlength[entry]){
|
|
/* search the abbreviated list */
|
|
long *list=pt->fitlist+pt->fitmap[entry];
|
|
for(i=0;i<pt->fitlength[entry];i++){
|
|
float this=_dist(dim,book->valuelist+list[i]*dim,a,step);
|
|
if(besti==-1 || this<best){
|
|
best=this;
|
|
besti=list[i];
|
|
}
|
|
}
|
|
|
|
return(besti);
|
|
}
|
|
}
|
|
|
|
if(nt){
|
|
/* optimized using the decision tree */
|
|
while(1){
|
|
float c=0.f;
|
|
float *p=book->valuelist+nt->p[ptr];
|
|
float *q=book->valuelist+nt->q[ptr];
|
|
|
|
for(k=0,o=0;k<dim;k++,o+=step)
|
|
c+=(p[k]-q[k])*(a[o]-(p[k]+q[k])*.5);
|
|
|
|
if(c>0.f) /* in A */
|
|
ptr= -nt->ptr0[ptr];
|
|
else /* in B */
|
|
ptr= -nt->ptr1[ptr];
|
|
if(ptr<=0)break;
|
|
}
|
|
return(-ptr);
|
|
}
|
|
#endif
|
|
|
|
/* brute force it! */
|
|
{
|
|
const static_codebook *c=book->c;
|
|
int i,besti=-1;
|
|
float best=0.f;
|
|
float *e=book->valuelist;
|
|
for(i=0;i<book->entries;i++){
|
|
if(c->lengthlist[i]>0){
|
|
float this=_dist(dim,e,a,step);
|
|
if(besti==-1 || this<best){
|
|
best=this;
|
|
besti=i;
|
|
}
|
|
}
|
|
e+=dim;
|
|
}
|
|
|
|
/*if(savebest!=-1 && savebest!=besti){
|
|
fprintf(stderr,"brute force/pigeonhole disagreement:\n"
|
|
"original:");
|
|
for(i=0;i<dim*step;i+=step)fprintf(stderr,"%g,",a[i]);
|
|
fprintf(stderr,"\n"
|
|
"pigeonhole (entry %d, err %g):",savebest,saverr);
|
|
for(i=0;i<dim;i++)fprintf(stderr,"%g,",
|
|
(book->valuelist+savebest*dim)[i]);
|
|
fprintf(stderr,"\n"
|
|
"bruteforce (entry %d, err %g):",besti,best);
|
|
for(i=0;i<dim;i++)fprintf(stderr,"%g,",
|
|
(book->valuelist+besti*dim)[i]);
|
|
fprintf(stderr,"\n");
|
|
}*/
|
|
return(besti);
|
|
}
|
|
}
|
|
|
|
long vorbis_book_codeword(codebook *book,int entry){
|
|
if(book->c) /* only use with encode; decode optimizations are
|
|
allowed to break this */
|
|
return book->codelist[entry];
|
|
return -1;
|
|
}
|
|
|
|
long vorbis_book_codelen(codebook *book,int entry){
|
|
if(book->c) /* only use with encode; decode optimizations are
|
|
allowed to break this */
|
|
return book->c->lengthlist[entry];
|
|
return -1;
|
|
}
|
|
|
|
#ifdef _V_SELFTEST
|
|
|
|
/* Unit tests of the dequantizer; this stuff will be OK
|
|
cross-platform, I simply want to be sure that special mapping cases
|
|
actually work properly; a bug could go unnoticed for a while */
|
|
|
|
#include <stdio.h>
|
|
|
|
/* cases:
|
|
|
|
no mapping
|
|
full, explicit mapping
|
|
algorithmic mapping
|
|
|
|
nonsequential
|
|
sequential
|
|
*/
|
|
|
|
static long full_quantlist1[]={0,1,2,3, 4,5,6,7, 8,3,6,1};
|
|
static long partial_quantlist1[]={0,7,2};
|
|
|
|
/* no mapping */
|
|
static_codebook test1={
|
|
4,16,
|
|
NULL,
|
|
0,
|
|
0,0,0,0,
|
|
NULL,
|
|
NULL,NULL
|
|
};
|
|
static float *test1_result=NULL;
|
|
|
|
/* linear, full mapping, nonsequential */
|
|
static_codebook test2={
|
|
4,3,
|
|
NULL,
|
|
2,
|
|
-533200896,1611661312,4,0,
|
|
full_quantlist1,
|
|
NULL,NULL
|
|
};
|
|
static float test2_result[]={-3,-2,-1,0, 1,2,3,4, 5,0,3,-2};
|
|
|
|
/* linear, full mapping, sequential */
|
|
static_codebook test3={
|
|
4,3,
|
|
NULL,
|
|
2,
|
|
-533200896,1611661312,4,1,
|
|
full_quantlist1,
|
|
NULL,NULL
|
|
};
|
|
static float test3_result[]={-3,-5,-6,-6, 1,3,6,10, 5,5,8,6};
|
|
|
|
/* linear, algorithmic mapping, nonsequential */
|
|
static_codebook test4={
|
|
3,27,
|
|
NULL,
|
|
1,
|
|
-533200896,1611661312,4,0,
|
|
partial_quantlist1,
|
|
NULL,NULL
|
|
};
|
|
static float test4_result[]={-3,-3,-3, 4,-3,-3, -1,-3,-3,
|
|
-3, 4,-3, 4, 4,-3, -1, 4,-3,
|
|
-3,-1,-3, 4,-1,-3, -1,-1,-3,
|
|
-3,-3, 4, 4,-3, 4, -1,-3, 4,
|
|
-3, 4, 4, 4, 4, 4, -1, 4, 4,
|
|
-3,-1, 4, 4,-1, 4, -1,-1, 4,
|
|
-3,-3,-1, 4,-3,-1, -1,-3,-1,
|
|
-3, 4,-1, 4, 4,-1, -1, 4,-1,
|
|
-3,-1,-1, 4,-1,-1, -1,-1,-1};
|
|
|
|
/* linear, algorithmic mapping, sequential */
|
|
static_codebook test5={
|
|
3,27,
|
|
NULL,
|
|
1,
|
|
-533200896,1611661312,4,1,
|
|
partial_quantlist1,
|
|
NULL,NULL
|
|
};
|
|
static float test5_result[]={-3,-6,-9, 4, 1,-2, -1,-4,-7,
|
|
-3, 1,-2, 4, 8, 5, -1, 3, 0,
|
|
-3,-4,-7, 4, 3, 0, -1,-2,-5,
|
|
-3,-6,-2, 4, 1, 5, -1,-4, 0,
|
|
-3, 1, 5, 4, 8,12, -1, 3, 7,
|
|
-3,-4, 0, 4, 3, 7, -1,-2, 2,
|
|
-3,-6,-7, 4, 1, 0, -1,-4,-5,
|
|
-3, 1, 0, 4, 8, 7, -1, 3, 2,
|
|
-3,-4,-5, 4, 3, 2, -1,-2,-3};
|
|
|
|
void run_test(static_codebook *b,float *comp){
|
|
float *out=_book_unquantize(b,b->entries,NULL);
|
|
int i;
|
|
|
|
if(comp){
|
|
if(!out){
|
|
fprintf(stderr,"_book_unquantize incorrectly returned NULL\n");
|
|
exit(1);
|
|
}
|
|
|
|
for(i=0;i<b->entries*b->dim;i++)
|
|
if(fabs(out[i]-comp[i])>.0001){
|
|
fprintf(stderr,"disagreement in unquantized and reference data:\n"
|
|
"position %d, %g != %g\n",i,out[i],comp[i]);
|
|
exit(1);
|
|
}
|
|
|
|
}else{
|
|
if(out){
|
|
fprintf(stderr,"_book_unquantize returned a value array: \n"
|
|
" correct result should have been NULL\n");
|
|
exit(1);
|
|
}
|
|
}
|
|
}
|
|
|
|
int main(){
|
|
/* run the nine dequant tests, and compare to the hand-rolled results */
|
|
fprintf(stderr,"Dequant test 1... ");
|
|
run_test(&test1,test1_result);
|
|
fprintf(stderr,"OK\nDequant test 2... ");
|
|
run_test(&test2,test2_result);
|
|
fprintf(stderr,"OK\nDequant test 3... ");
|
|
run_test(&test3,test3_result);
|
|
fprintf(stderr,"OK\nDequant test 4... ");
|
|
run_test(&test4,test4_result);
|
|
fprintf(stderr,"OK\nDequant test 5... ");
|
|
run_test(&test5,test5_result);
|
|
fprintf(stderr,"OK\n\n");
|
|
|
|
return(0);
|
|
}
|
|
|
|
#endif
|