rockbox - My Rockbox tree

path: root/www/internals/rec_main_bottom_t.jpg

diff options

author	Jonas Häggqvist <rasher@rasher.dk>	2005-09-05 11:40:06 +0000
committer	Jonas Häggqvist <rasher@rasher.dk>	2005-09-05 11:40:06 +0000
commit	faa4404da9ab451ca7898ae76af3825e70d84726 (patch)
tree	48a6185c0233f6693587c727c8228a1e23a39f4b /www/internals/rec_main_bottom_t.jpg
parent	9352ac86680a2507b657c141029d831447f1bed8 (diff)
download	rockbox-faa4404da9ab451ca7898ae76af3825e70d84726.zip rockbox-faa4404da9ab451ca7898ae76af3825e70d84726.tar.gz rockbox-faa4404da9ab451ca7898ae76af3825e70d84726.tar.bz2 rockbox-faa4404da9ab451ca7898ae76af3825e70d84726.tar.xz

Updated hebrew Language.

git-svn-id: svn://svn.rockbox.org/rockbox/trunk@7473 a1c6a512-1295-4272-9138-f99709370657

Diffstat (limited to 'www/internals/rec_main_bottom_t.jpg')

0 files changed, 0 insertions, 0 deletions

113'>113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764

/*
  Copyright (c) 2005-2009, The Musepack Development Team
  All rights reserved.

  Redistribution and use in source and binary forms, with or without
  modification, are permitted provided that the following conditions are
  met:

  * Redistributions of source code must retain the above copyright
  notice, this list of conditions and the following disclaimer.

  * Redistributions in binary form must reproduce the above
  copyright notice, this list of conditions and the following
  disclaimer in the documentation and/or other materials provided
  with the distribution.

  * Neither the name of the The Musepack Development Team nor the
  names of its contributors may be used to endorse or promote
  products derived from this software without specific prior
  written permission.

  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/// \file mpc_decoder.c
/// Core decoding routines and logic.

#include <string.h>
#include <codecs.h>
#include "mpcdec.h"
#include "minimax.h"
#include "decoder.h"
#include "huffman.h"
#include "internal.h"
#include "mpcdec_math.h"
#include "requant.h"
#include "mpc_bits_reader.h"

//SV7 tables
extern const mpc_lut_data   mpc_HuffQ [7] [2];
extern const mpc_lut_data   mpc_HuffHdr;
extern const mpc_huffman    mpc_table_HuffSCFI [ 4];
extern const mpc_lut_data   mpc_HuffDSCF;

//SV8 tables
extern const mpc_can_data mpc_can_Bands;
extern const mpc_can_data mpc_can_SCFI[2];
extern const mpc_can_data mpc_can_DSCF[2];
extern const mpc_can_data mpc_can_Res [2];
extern const mpc_can_data mpc_can_Q [8][2];
extern const mpc_can_data mpc_can_Q1;
extern const mpc_can_data mpc_can_Q9up;

//Decoder globals (g_Y_L and g_Y_R do not fit into iram for all targets)
static mpc_decoder g_mpc_decoder                 IBSS_ATTR;
static MPC_SAMPLE_FORMAT g_V_L[MPC_V_MEM + 960 ] IBSS_ATTR                __attribute__((aligned(16)));
static MPC_SAMPLE_FORMAT g_Y_L[MPC_FRAME_LENGTH] IBSS_ATTR_MPC_LARGE_IRAM __attribute__((aligned(16)));
static MPC_SAMPLE_FORMAT g_V_R[MPC_V_MEM + 960 ] IBSS_ATTR                __attribute__((aligned(16)));
static MPC_SAMPLE_FORMAT g_Y_R[MPC_FRAME_LENGTH] IBSS_ATTR_MPC_LARGE_IRAM __attribute__((aligned(16)));

//SV7 globals (decoding results for bundled quantizers (3- and 5-step))
static const mpc_int32_t g_sv7_idx30[] ICONST_ATTR = 
{-1, 0, 1,-1, 0, 1,-1, 0, 1,-1, 0, 1,-1, 0, 1,-1, 0, 1,-1, 0, 1,-1, 0, 1,-1, 0, 1};
static const mpc_int32_t g_sv7_idx31[] ICONST_ATTR = 
{-1,-1,-1, 0, 0, 0, 1, 1, 1,-1,-1,-1, 0, 0, 0, 1, 1, 1,-1,-1,-1, 0, 0, 0, 1, 1, 1};
static const mpc_int32_t g_sv7_idx32[] ICONST_ATTR = 
{-1,-1,-1,-1,-1,-1,-1,-1,-1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1};
static const mpc_int32_t g_sv7_idx50[] ICONST_ATTR = 
{-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2};
static const mpc_int32_t g_sv7_idx51[] ICONST_ATTR = 
{-2,-2,-2,-2,-2,-1,-1,-1,-1,-1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2};

//SV8 globals (decoding results for bundled quantizers (3- and 5-step))
static const mpc_int8_t g_sv8_idx50[125] ICONST_ATTR = 
{-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2, 
 -2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,
 -2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,
 -2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,
 -2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2,-2,-1, 0, 1, 2};
static const mpc_int8_t g_sv8_idx51[125] ICONST_ATTR = 
{-2,-2,-2,-2,-2,-1,-1,-1,-1,-1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2,
 -2,-2,-2,-2,-2,-1,-1,-1,-1,-1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2,
 -2,-2,-2,-2,-2,-1,-1,-1,-1,-1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2,
 -2,-2,-2,-2,-2,-1,-1,-1,-1,-1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2,
 -2,-2,-2,-2,-2,-1,-1,-1,-1,-1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2};
static const mpc_int8_t g_sv8_idx52[125] ICONST_ATTR = 
{-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,
 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
  2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2};
static const mpc_int8_t g_sv8_HuffQ2_var[125] ICONST_ATTR =
{ 6, 5, 4, 5, 6, 5, 4, 3, 4, 5, 4, 3, 2, 3, 4, 5, 4, 3, 4, 5, 6, 5, 4, 5, 6,
  5, 4, 3, 4, 5, 4, 3, 2, 3, 4, 3, 2, 1, 2, 3, 4, 3, 2, 3, 4, 5, 4, 3, 4, 5, 
  4, 3, 2, 3, 4, 3, 2, 1, 2, 3, 2, 1, 0, 1, 2, 3, 2, 1, 2, 3, 4, 3, 2, 3, 4, 
  5, 4, 3, 4, 5, 4, 3, 2, 3, 4, 3, 2, 1, 2, 3, 4, 3, 2, 3, 4, 5, 4, 3, 4, 5, 
  6, 5, 4, 5, 6, 5, 4, 3, 4, 5, 4, 3, 2, 3, 4, 5, 4, 3, 4, 5, 6, 5, 4, 5, 6};

//------------------------------------------------------------------------------
// types
//------------------------------------------------------------------------------
enum
{
    MEMSIZE   = MPC_DECODER_MEMSIZE, // overall buffer size
    MEMSIZE2  = (MEMSIZE/2),         // size of one buffer
    MEMMASK   = (MEMSIZE-1)
};

//------------------------------------------------------------------------------
// forward declarations
//------------------------------------------------------------------------------
void mpc_decoder_requantisierung   (mpc_decoder *d) 
                                    ICODE_ATTR_MPC_LARGE_IRAM;
void mpc_decoder_read_bitstream_sv7(mpc_decoder * d, mpc_bits_reader * r) 
                                    ICODE_ATTR_MPC_LARGE_IRAM;
void mpc_decoder_read_bitstream_sv8(mpc_decoder * d, mpc_bits_reader * r,
                                    mpc_bool_t is_key_frame);

//------------------------------------------------------------------------------
// macros
//------------------------------------------------------------------------------
#define REQUANT_M1_S1_SAMPLES(IDX) \
    *(YL+=IDX) = (templ = MPC_MULTIPLY_FLOAT_INT(facL,*L++))+(tempr = MPC_MULTIPLY_FLOAT_INT(facR,*R++)); \
    *(YR+=IDX) = templ - tempr;

#define REQUANT_M1_S1(SUBFRAME) \
    facL = MPC_MULTIPLY_SCF( Cc[d->Res_L[Band]] , d->SCF_Index_L[Band][SUBFRAME] & 0xFF); \
    facR = MPC_MULTIPLY_SCF( Cc[d->Res_R[Band]] , d->SCF_Index_R[Band][SUBFRAME] & 0xFF); \
    for (n = 0; n < 12; n+=4, YL += 32, YR += 32) { \
        REQUANT_M1_S1_SAMPLES( 0); \
        REQUANT_M1_S1_SAMPLES(32); \
        REQUANT_M1_S1_SAMPLES(32); \
        REQUANT_M1_S1_SAMPLES(32); \
    }

#define REQUANT_M1_S0_SAMPLES(IDX) \
    *(YR+=IDX) = *(YL+=IDX) = MPC_MULTIPLY_FLOAT_INT(facL,*L++);

#define REQUANT_M1_S0(SUBFRAME) \
    facL = MPC_MULTIPLY_SCF( Cc[d->Res_L[Band]] , d->SCF_Index_L[Band][SUBFRAME] & 0xFF); \
    for (n = 0; n < 12; n+=4, YL += 32, YR += 32) { \
        REQUANT_M1_S0_SAMPLES( 0); \
        REQUANT_M1_S0_SAMPLES(32); \
        REQUANT_M1_S0_SAMPLES(32); \
        REQUANT_M1_S0_SAMPLES(32); \
    }

#define REQUANT_M0_S1_SAMPLES(IDX) \
    *(YR+=IDX) = -(*(YL+=IDX) = MPC_MULTIPLY_FLOAT_INT(facR,*R++));

#define REQUANT_M0_S1(SUBFRAME) \
    facR = MPC_MULTIPLY_SCF( Cc[d->Res_R[Band]] , d->SCF_Index_R[Band][SUBFRAME] & 0xFF); \
    for (n = 0; n < 12; n+=4, YL += 32, YR += 32) { \
        REQUANT_M0_S1_SAMPLES( 0); \
        REQUANT_M0_S1_SAMPLES(32); \
        REQUANT_M0_S1_SAMPLES(32); \
        REQUANT_M0_S1_SAMPLES(32); \
    }

#define REQUANT_L1_R1_SAMPLES(IDX) \
    *(YL+=IDX) = MPC_MULTIPLY_FLOAT_INT(facL,*L++); \
    *(YR+=IDX) = MPC_MULTIPLY_FLOAT_INT(facR,*R++);

#define REQUANT_L1_R1(SUBFRAME) \
    facL = MPC_MULTIPLY_SCF( Cc[d->Res_L[Band]] , d->SCF_Index_L[Band][SUBFRAME] & 0xFF); \
    facR = MPC_MULTIPLY_SCF( Cc[d->Res_R[Band]] , d->SCF_Index_R[Band][SUBFRAME] & 0xFF); \
    for (n = 0; n < 12; n+=4, YL += 32, YR += 32) { \
        REQUANT_L1_R1_SAMPLES( 0); \
        REQUANT_L1_R1_SAMPLES(32); \
        REQUANT_L1_R1_SAMPLES(32); \
        REQUANT_L1_R1_SAMPLES(32); \
    }

#define REQUANT_L1_R0_SAMPLES(IDX) \
    *(YL+=IDX) = MPC_MULTIPLY_FLOAT_INT(facL,*L++); \
    *(YR+=IDX) = 0;

#define REQUANT_L1_R0(SUBFRAME) \
    facL = MPC_MULTIPLY_SCF( Cc[d->Res_L[Band]] , d->SCF_Index_L[Band][SUBFRAME] & 0xFF); \
    for (n = 0; n < 12; n+=4, YL += 32, YR += 32) { \
        REQUANT_L1_R0_SAMPLES( 0); \
        REQUANT_L1_R0_SAMPLES(32); \
        REQUANT_L1_R0_SAMPLES(32); \
        REQUANT_L1_R0_SAMPLES(32); \
    }

#define REQUANT_L0_R1_SAMPLES(IDX) \
    *(YL+=IDX) = 0; \
    *(YR+=IDX) = MPC_MULTIPLY_FLOAT_INT(facR,*R++);

#define REQUANT_L0_R1(SUBFRAME) \
    facR = MPC_MULTIPLY_SCF( Cc[d->Res_R[Band]] , d->SCF_Index_R[Band][SUBFRAME] & 0xFF); \
    for (n = 0; n < 12; n+=4, YL += 32, YR += 32) { \
        REQUANT_L0_R1_SAMPLES( 0); \
        REQUANT_L0_R1_SAMPLES(32); \
        REQUANT_L0_R1_SAMPLES(32); \
        REQUANT_L0_R1_SAMPLES(32); \
    }

#define REQUANT_SILENCE_SAMPLES(IDX) \
    *(YR+=IDX) = *(YL+=IDX) = 0;

#define REQUANT_SILENCE \
    for (n = 0; n < 36; n+=4, YL += 32, YR += 32) { \
        REQUANT_SILENCE_SAMPLES( 0); \
        REQUANT_SILENCE_SAMPLES(32); \
        REQUANT_SILENCE_SAMPLES(32); \
        REQUANT_SILENCE_SAMPLES(32); \
    }

/**
 * set the scf indexes for seeking use
 * needed only for sv7 seeking
 * @param d
 */
void mpc_decoder_reset_scf(mpc_decoder * d, int value)
{
    memset(d->SCF_Index_L, value, sizeof d->SCF_Index_L );
    memset(d->SCF_Index_R, value, sizeof d->SCF_Index_R );
}

static void mpc_decoder_setup(mpc_decoder *d)
{
#if defined(CPU_COLDFIRE)
    coldfire_set_macsr(EMAC_FRACTIONAL | EMAC_SATURATE);
#endif

    memset(d, 0, sizeof *d);

    d->__r1 = 1;
    d->__r2 = 1;
    d->V_L = g_V_L;
    d->V_R = g_V_R;
    d->Y_L = g_Y_L;
    d->Y_R = g_Y_R;

    memset(d->V_L, 0, sizeof(g_V_L));
    memset(d->V_R, 0, sizeof(g_V_R));
    memset(d->Y_L, 0, sizeof(g_Y_L));
    memset(d->Y_R, 0, sizeof(g_Y_R));

    mpc_decoder_init_quant(d, 1.0f);
}

static void mpc_decoder_set_streaminfo(mpc_decoder *d, mpc_streaminfo *si)
{
    d->stream_version     = si->stream_version;
    d->ms                 = si->ms;
    d->max_band           = si->max_band;
    d->channels           = si->channels;
    d->samples_to_skip    = MPC_DECODER_SYNTH_DELAY + si->beg_silence;

    if (si->stream_version == 7 && si->is_true_gapless)
        d->samples = ((si->samples + MPC_FRAME_LENGTH - 1) / MPC_FRAME_LENGTH) * MPC_FRAME_LENGTH;
    else
        d->samples = si->samples;
}

mpc_decoder * mpc_decoder_init(mpc_streaminfo *si)
{
    mpc_decoder* p_tmp = &g_mpc_decoder;

    if (p_tmp != 0) {
        mpc_decoder_setup(p_tmp);
        mpc_decoder_set_streaminfo(p_tmp, si);
        huff_init_lut(LUT_DEPTH);
    }

    return p_tmp;
}

/* rockbox: not used
void mpc_decoder_exit(mpc_decoder *d)
{
    (void)d;
}
*/

void mpc_decoder_decode_frame(mpc_decoder * d,
                              mpc_bits_reader * r,
                              mpc_frame_info * i)
{
    mpc_bits_reader r_sav = *r;
    mpc_int64_t samples_left;

    samples_left = d->samples - d->decoded_samples + MPC_DECODER_SYNTH_DELAY;

    if (samples_left <= 0 && d->samples != 0) {
        i->samples = 0;
        i->bits = -1;
        return;
    }

    if (d->stream_version == 8) {
        mpc_decoder_read_bitstream_sv8(d, r, i->is_key_frame);
    } else {
        mpc_decoder_read_bitstream_sv7(d, r);
    }

    if (d->samples_to_skip < MPC_FRAME_LENGTH + MPC_DECODER_SYNTH_DELAY) {
        mpc_decoder_requantisierung(d);
        mpc_decoder_synthese_filter_float(d, i->buffer, d->channels);
    }

    d->decoded_samples += MPC_FRAME_LENGTH;

    // reconstruct exact filelength
    if (d->decoded_samples - d->samples < MPC_FRAME_LENGTH && d->stream_version == 7) {
        int last_frame_samples = mpc_bits_read(r, 11);
        if (d->decoded_samples == d->samples) {
            if (last_frame_samples == 0) last_frame_samples = MPC_FRAME_LENGTH;
            d->samples += last_frame_samples - MPC_FRAME_LENGTH;
            samples_left += last_frame_samples - MPC_FRAME_LENGTH;
        }
    }

    i->samples = samples_left > MPC_FRAME_LENGTH ? MPC_FRAME_LENGTH : samples_left < 0 ? 0 : (mpc_uint32_t) samples_left;
    i->bits = (mpc_uint32_t) (((r->buff - r_sav.buff) << 3) + r_sav.count - r->count);

    if (d->samples_to_skip) {
        if (i->samples <= d->samples_to_skip) {
            d->samples_to_skip -= i->samples;
            i->samples = 0;
        } else {
            i->samples -= d->samples_to_skip;
            
            /* move valid samples to beginning for channel 0. noninterleaved! */
            memmove(i->buffer, 
                    i->buffer + d->samples_to_skip, 
                    i->samples * sizeof(MPC_SAMPLE_FORMAT));
            /* move valid samples to beginning for channel 1. noninterleaved! */
            memmove(i->buffer + MPC_FRAME_LENGTH, 
                    i->buffer + MPC_FRAME_LENGTH + d->samples_to_skip, 
                    i->samples * sizeof(MPC_SAMPLE_FORMAT));
                    
            d->samples_to_skip = 0;
        }
    }
}

void
mpc_decoder_requantisierung(mpc_decoder *d)
{
    mpc_int32_t     Band;
    mpc_int32_t     n;
    MPC_SAMPLE_FORMAT facL;
    MPC_SAMPLE_FORMAT facR;
    MPC_SAMPLE_FORMAT templ;
    MPC_SAMPLE_FORMAT tempr;
    MPC_SAMPLE_FORMAT* YL;
    MPC_SAMPLE_FORMAT* YR;
    mpc_int16_t*    L;
    mpc_int16_t*    R;
    const mpc_int32_t Last_Band = d->max_band;

#ifdef MPC_FIXED_POINT
#if MPC_FIXED_POINT_FRACTPART == 14
#define MPC_MULTIPLY_SCF(CcVal, SCF_idx) \
    MPC_MULTIPLY_EX(CcVal, d->SCF[SCF_idx], d->SCF_shift[SCF_idx])
#else

#error FIXME, Cc table is in 18.14 format

#endif
#else
#define MPC_MULTIPLY_SCF(CcVal, SCF_idx) \
    MPC_MULTIPLY(CcVal, d->SCF[SCF_idx])
#endif
    // requantization and scaling of subband-samples
    for ( Band = 0; Band <= Last_Band; Band++ ) {   // setting pointers
        YL = d->Y_L + Band;
        YR = d->Y_R + Band;
        L  = d->Q[Band].L;
        R  = d->Q[Band].R;
        /************************** MS-coded **************************/
        if ( d->MS_Flag [Band] ) {
            if ( d->Res_L [Band] ) {
                if ( d->Res_R [Band] ) {    // M!=0, S!=0
                    REQUANT_M1_S1(0);
                    REQUANT_M1_S1(1);
                    REQUANT_M1_S1(2);
                } else {                    // M!=0, S==0
                    REQUANT_M1_S0(0);
                    REQUANT_M1_S0(1);
                    REQUANT_M1_S0(2);
                }
            } else {
                if ( d->Res_R[Band] )       // M==0, S!=0
                {
                    REQUANT_M0_S1(0);
                    REQUANT_M0_S1(1);
                    REQUANT_M0_S1(2);
                } else {                    // M==0, S==0
                    REQUANT_SILENCE;
                }
            }
        }
        /************************** LR-coded **************************/
        else {
            if ( d->Res_L [Band] ) {
                if ( d->Res_R [Band] ) {    // L!=0, R!=0
                    REQUANT_L1_R1(0);
                    REQUANT_L1_R1(1);
                    REQUANT_L1_R1(2);
                } else {                    // L!=0, R==0
                    REQUANT_L1_R0(0);
                    REQUANT_L1_R0(1);
                    REQUANT_L1_R0(2);
                }
            }
            else {
                if ( d->Res_R [Band] ) {    // L==0, R!=0
                    REQUANT_L0_R1(0);
                    REQUANT_L0_R1(1);
                    REQUANT_L0_R1(2);
                } else {                    // L==0, R==0
                    REQUANT_SILENCE;
                }
            }
        }
    }
}

void mpc_decoder_read_bitstream_sv7(mpc_decoder * d, mpc_bits_reader * r)
{
    mpc_int32_t n, idx, Max_used_Band = 0;

    /***************************** Header *****************************/

    // first subband
    d->Res_L[0] = mpc_bits_read(r, 4);
    d->Res_R[0] = mpc_bits_read(r, 4);
    if (!(d->Res_L[0] == 0 && d->Res_R[0] == 0)) {
        if (d->ms)
            d->MS_Flag[0] = mpc_bits_read(r, 1);
        Max_used_Band = 1;
    }

    // consecutive subbands
    for ( n = 1; n <= d->max_band; n++ ) {
        idx   = mpc_bits_huff_lut(r, & mpc_HuffHdr);
        d->Res_L[n] = (idx!=4) ? d->Res_L[n - 1] + idx : (int) mpc_bits_read(r, 4);

        idx   = mpc_bits_huff_lut(r, & mpc_HuffHdr);
        d->Res_R[n] = (idx!=4) ? d->Res_R[n - 1] + idx : (int) mpc_bits_read(r, 4);

        if (!(d->Res_L[n] == 0 && d->Res_R[n] == 0)) {
            if (d->ms)
                d->MS_Flag[n] = mpc_bits_read(r, 1);
            Max_used_Band = n + 1;
        }
    }

    /****************************** SCFI ******************************/
    for ( n = 0; n < Max_used_Band; n++ ) {
        if (d->Res_L[n])
            d->SCFI_L[n] = mpc_bits_huff_dec(r, mpc_table_HuffSCFI);
        if (d->Res_R[n])
            d->SCFI_R[n] = mpc_bits_huff_dec(r, mpc_table_HuffSCFI);
    }

    /**************************** SCF/DSCF ****************************/
    for ( n = 0; n < Max_used_Band; n++ ) {
        mpc_int32_t * SCF = d->SCF_Index_L[n];
        mpc_uint32_t Res  = d->Res_L[n], SCFI = d->SCFI_L[n];
        do {
            if (Res) {
                switch (SCFI) {
                    case 1:
                        idx  = mpc_bits_huff_lut(r, & mpc_HuffDSCF);
                        SCF[0] = (idx!=8) ? SCF[2] + idx : (int) mpc_bits_read(r, 6);
                        idx  = mpc_bits_huff_lut(r, & mpc_HuffDSCF);
                        SCF[1] = (idx!=8) ? SCF[0] + idx : (int) mpc_bits_read(r, 6);
                        SCF[2] = SCF[1];
                        break;
                    case 3:
                        idx  = mpc_bits_huff_lut(r, & mpc_HuffDSCF);
                        SCF[0] = (idx!=8) ? SCF[2] + idx : (int) mpc_bits_read(r, 6);
                        SCF[1] = SCF[0];
                        SCF[2] = SCF[1];
                        break;
                    case 2:
                        idx  = mpc_bits_huff_lut(r, & mpc_HuffDSCF);
                        SCF[0] = (idx!=8) ? SCF[2] + idx : (int) mpc_bits_read(r, 6);
                        SCF[1] = SCF[0];
                        idx  = mpc_bits_huff_lut(r, & mpc_HuffDSCF);
                        SCF[2] = (idx!=8) ? SCF[1] + idx : (int) mpc_bits_read(r, 6);
                        break;
                    case 0:
                        idx  = mpc_bits_huff_lut(r, & mpc_HuffDSCF);
                        SCF[0] = (idx!=8) ? SCF[2] + idx : (int) mpc_bits_read(r, 6);
                        idx  = mpc_bits_huff_lut(r, & mpc_HuffDSCF);
                        SCF[1] = (idx!=8) ? SCF[0] + idx : (int) mpc_bits_read(r, 6);
                        idx  = mpc_bits_huff_lut(r, & mpc_HuffDSCF);
                        SCF[2] = (idx!=8) ? SCF[1] + idx : (int) mpc_bits_read(r, 6);
                        break;
                    default:
                        return;
                }
                if (SCF[0] > 1024)
                    SCF[0] = 0x8080;
                if (SCF[1] > 1024)
                    SCF[1] = 0x8080;
                if (SCF[2] > 1024)
                    SCF[2] = 0x8080;
            }
            Res = d->Res_R[n];
            SCFI = d->SCFI_R[n];
        } while ( SCF == d->SCF_Index_L[n] && (SCF = d->SCF_Index_R[n]));
    }

//     if (d->seeking == TRUE)
//         return;

    /***************************** Samples ****************************/
    for ( n = 0; n < Max_used_Band; n++ ) {
        mpc_int16_t *q = d->Q[n].L, Res = d->Res_L[n];
        do {
            mpc_uint32_t nbit;
            mpc_int32_t k, dc;
            const mpc_lut_data *Table;
            switch (Res) {
                case  -2: case  -3: case  -4: case  -5: case  -6: case  -7: case  -8: case  -9:
                case -10: case -11: case -12: case -13: case -14: case -15: case -16: case -17: case 0:
                    break;
                case -1:
                    for (k=0; k<36; k++ ) {
                        mpc_uint32_t tmp = mpc_random_int(d);
                        q[k] = ((tmp >> 24) & 0xFF) + ((tmp >> 16) & 0xFF) + ((tmp >>  8) & 0xFF) + ((tmp >>  0) & 0xFF) - 510;
                    }
                    break;
                case 1:
                    Table = & mpc_HuffQ[0][mpc_bits_read(r, 1)];
                    for ( k = 0; k < 36; k += 3) {
                        idx = mpc_bits_huff_lut(r, Table);
                        q[k]     = g_sv7_idx30[idx];
                        q[k + 1] = g_sv7_idx31[idx];
                        q[k + 2] = g_sv7_idx32[idx];
                    }
                    break;
                case 2:
                    Table = & mpc_HuffQ[1][mpc_bits_read(r, 1)];
                    for ( k = 0; k < 36; k += 2) {
                        idx = mpc_bits_huff_lut(r, Table);
                        q[k]     = g_sv7_idx50[idx];
                        q[k + 1] = g_sv7_idx51[idx];
                    }
                    break;
                case 3:
                case 4:
                case 5:
                case 6:
                case 7:
                    Table = & mpc_HuffQ[Res - 1][mpc_bits_read(r, 1)];
                    for ( k = 0; k < 36; k++ )
                        q[k] = mpc_bits_huff_lut(r, Table);
                    break;
                case 8: case 9: case 10: case 11: case 12: case 13: case 14: case 15: case 16: case 17:
                    nbit = Res_bit[Res];
                    dc   = Dc[Res];
                    for ( k = 0; k < 36; k++ )
                        q[k] = (mpc_int32_t)mpc_bits_read(r, nbit) - dc;
                    break;
                default:
                    return;
            }

            Res = d->Res_R[n];
        } while (q == d->Q[n].L && (q = d->Q[n].R));
    }
}

void mpc_decoder_read_bitstream_sv8(mpc_decoder * d, mpc_bits_reader * r, mpc_bool_t is_key_frame)
{
    mpc_int32_t n, Max_used_Band;
    const mpc_can_data * Table, * Tables[2];

    /***************************** Header *****************************/

    if (is_key_frame == MPC_TRUE) {
        Max_used_Band = mpc_bits_log_dec(r, d->max_band + 1);
    } else {
        Max_used_Band = d->last_max_band + mpc_bits_can_dec(r, & mpc_can_Bands);
        if (Max_used_Band > 32) Max_used_Band -= 33;
    }
    d->last_max_band = Max_used_Band;

    if (Max_used_Band) {
        d->Res_L[Max_used_Band-1] = mpc_bits_can_dec(r, & mpc_can_Res[0]);
        d->Res_R[Max_used_Band-1] = mpc_bits_can_dec(r, & mpc_can_Res[0]);
        if (d->Res_L[Max_used_Band-1] > 15) d->Res_L[Max_used_Band-1] -= 17;
        if (d->Res_R[Max_used_Band-1] > 15) d->Res_R[Max_used_Band-1] -= 17;
        for ( n = Max_used_Band - 2; n >= 0; n--) {
            d->Res_L[n] = mpc_bits_can_dec(r, & mpc_can_Res[d->Res_L[n + 1] > 2]) + d->Res_L[n + 1];
            if (d->Res_L[n] > 15) d->Res_L[n] -= 17;
            d->Res_R[n] = mpc_bits_can_dec(r, & mpc_can_Res[d->Res_R[n + 1] > 2]) + d->Res_R[n + 1];
            if (d->Res_R[n] > 15) d->Res_R[n] -= 17;
        }

        if (d->ms) {
            int cnt = 0, tot = 0;
            mpc_uint32_t tmp = 0;
            for( n = 0; n < Max_used_Band; n++)
                if ( d->Res_L[n] != 0 || d->Res_R[n] != 0 )
                    tot++;
            cnt = mpc_bits_log_dec(r, tot);
            if (cnt != 0 && cnt != tot)
                tmp = mpc_bits_enum_dec(r, mini(cnt, tot-cnt), tot);
            if (cnt * 2 > tot) tmp = ~tmp;
            for( n = Max_used_Band - 1; n >= 0; n--)
                if ( d->Res_L[n] != 0 || d->Res_R[n] != 0 ) {
                    d->MS_Flag[n] = tmp & 1;
                    tmp >>= 1;
                }
        }
    }

    for( n = Max_used_Band; n <= d->max_band; n++)
        d->Res_L[n] = d->Res_R[n] = 0;

    /****************************** SCFI ******************************/
    if (is_key_frame == MPC_TRUE){
        for( n = 0; n < 32; n++)
            d->DSCF_Flag_L[n] = d->DSCF_Flag_R[n] = 1; // new block -> force key frame
    }

    Tables[0] = & mpc_can_SCFI[0];
    Tables[1] = & mpc_can_SCFI[1];
    for ( n = 0; n < Max_used_Band; n++ ) {
        int tmp = 0, cnt = -1;
        if (d->Res_L[n]) cnt++;
        if (d->Res_R[n]) cnt++;
        if (cnt >= 0) {
            tmp = mpc_bits_can_dec(r, Tables[cnt]);
            if (d->Res_L[n]) d->SCFI_L[n] = tmp >> (2 * cnt);
            if (d->Res_R[n]) d->SCFI_R[n] = tmp & 3;
        }
    }

    /**************************** SCF/DSCF ****************************/

    for ( n = 0; n < Max_used_Band; n++ ) {
        mpc_int32_t * SCF = d->SCF_Index_L[n];
        mpc_uint32_t Res = d->Res_L[n], SCFI = d->SCFI_L[n];
        mpc_bool_t * DSCF_Flag = &d->DSCF_Flag_L[n];

        do {
            if ( Res ) {
                int m;
                if (*DSCF_Flag == 1) {
                    SCF[0] = (mpc_int32_t)mpc_bits_read(r, 7) - 6;
                    *DSCF_Flag = 0;
                } else {
                    mpc_uint_t tmp = mpc_bits_can_dec(r, & mpc_can_DSCF[1]);
                    if (tmp == 64)
                        tmp += mpc_bits_read(r, 6);
                    SCF[0] = ((SCF[2] - 25 + tmp) & 127) - 6;
                }
                for( m = 0; m < 2; m++){
                    if (((SCFI << m) & 2) == 0) {
                        mpc_uint_t tmp = mpc_bits_can_dec(r, & mpc_can_DSCF[0]);
                        if (tmp == 31)
                            tmp = 64 + mpc_bits_read(r, 6);
                        SCF[m + 1] = ((SCF[m] - 25 + tmp) & 127) - 6;
                    } else
                        SCF[m + 1] = SCF[m];
                }
            }
            Res = d->Res_R[n];
            SCFI = d->SCFI_R[n];
            DSCF_Flag = &d->DSCF_Flag_R[n];
        } while ( SCF == d->SCF_Index_L[n] && (SCF = d->SCF_Index_R[n]));
    }

    /***************************** Samples ****************************/
    for ( n = 0; n < Max_used_Band; n++ ) {
        mpc_int16_t *q = d->Q[n].L, Res = d->Res_L[n];
        static const int thres[] = {0, 0, 3, 0, 0, 1, 3, 4, 8};
        do {
            mpc_uint32_t nbit;
            mpc_int32_t k = 0, idx = 1, dc;
            if (Res != 0) {
                if (Res == 2) {
                    Tables[0] = & mpc_can_Q [0][0];
                    Tables[1] = & mpc_can_Q [0][1];
                    idx = 2 * thres[Res];
                    for ( ; k < 36; k += 3) {
                        int tmp = mpc_bits_can_dec(r, Tables[idx > thres[Res]]);
                        q[k]     = g_sv8_idx50[tmp];
                        q[k + 1] = g_sv8_idx51[tmp];
                        q[k + 2] = g_sv8_idx52[tmp];
                        idx = (idx >> 1) + g_sv8_HuffQ2_var[tmp];
                    }
                } else if (Res == 1) {
                    Table = & mpc_can_Q1;
                    for( ; k < 36; ){
                        int kmax = k + 18;
                        mpc_uint_t cnt = mpc_bits_can_dec(r, Table);
                        idx = 0;
                        if (cnt > 0 && cnt < 18)
                            idx = mpc_bits_enum_dec(r, cnt <= 9 ? cnt : 18 - cnt, 18);
                        if (cnt > 9) idx = ~idx;
                        for ( ; k < kmax; k++) {
                            q[k] = 0;
                            if ( idx & (1 << 17) )
                                q[k] = (mpc_bits_read(r, 1) << 1) - 1;
                            idx <<= 1;
                        }
                    }
                } else if (Res == -1) {
                    for ( ; k<36; k++ ) {
                        mpc_uint32_t tmp = mpc_random_int(d);
                        q[k] = ((tmp >> 24) & 0xFF) + ((tmp >> 16) & 0xFF) + ((tmp >>  8) & 0xFF) + ((tmp >>  0) & 0xFF) - 510;
                    }
                } else if (Res <= 4) {
                    Table = & mpc_can_Q[1][Res - 3];
                    for ( ; k < 36; k += 2 ) {
                        union {
                            mpc_int8_t sym;
                            struct { mpc_int8_t s1:4, s2:4; };
                        } tmp;
                        tmp.sym = mpc_bits_can_dec(r, Table);
                        q[k]     = tmp.s1;
                        q[k + 1] = tmp.s2;
                    }
                } else if (Res <= 8) {
                    Tables[0] = & mpc_can_Q [Res - 3][0];
                    Tables[1] = & mpc_can_Q [Res - 3][1];
                    idx = 2 * thres[Res];
                    for ( ; k < 36; k++ ) {
                        q[k] = mpc_bits_can_dec(r, Tables[idx > thres[Res]]);
                        idx = (idx >> 1) + absi(q[k]);
                    }
                } else if (Res == 9) {
                    dc = Dc[Res];
                    for ( ; k < 36; k++ ) {
                        q[k] = (unsigned char) mpc_bits_can_dec(r, & mpc_can_Q9up);
                        q[k] -= dc;
                    }
                } else {
                    nbit = (Res - 9);
                    dc = Dc[Res];
                    for ( ; k < 36; k++ ) {
                        q[k] = (unsigned char) mpc_bits_can_dec(r, & mpc_can_Q9up);
                        q[k] = (q[k] << nbit) | mpc_bits_read(r, nbit);
                        q[k] -= dc;
                    }
                }
            }

            Res = d->Res_R[n];
        } while (q == d->Q[n].L && (q = d->Q[n].R));
    }
}


context:
space:
mode: