📄 ebcot_lite_decode_passes.c
字号:
get_symbol(state,A,C,word,avail,symbol,csp);
val ^= (symbol << (IMPLEMENTATION_PRECISION-1));
ctxt |= SELF_SIG;
cp[-row_gap-2+1] |= FAR_SIG;
cp[-row_gap-1+1] |= BR_SIG;
cp[-row_gap+1+1] |= BL_SIG;
cp[-row_gap+2+1] |= FAR_SIG;
cp[row_gap-2+1] |= FAR_SIG;
cp[row_gap-1+1] |= TR_SIG;
cp[row_gap+1+1] |= TL_SIG;
cp[row_gap+2+1] |= FAR_SIG;
cp[-2+1] |= FAR_SIG;
cp[2+1] |= FAR_SIG;
if (val)
{ /* Negative sample. */
cp[-1+1] |= CR_SIG | H_NVE_SIG;
cp[1+1] |= CL_SIG | H_NVE_SIG;
cp[-row_gap+1] |= BC_SIG | V_NVE_SIG;
cp[row_gap+1] |= TC_SIG | V_NVE_SIG;
}
else
{ /* Positive sample. */
cp[-1+1] |= CR_SIG | H_PVE_SIG;
cp[1+1] |= CL_SIG | H_PVE_SIG;
cp[-row_gap+1] |= BC_SIG | V_PVE_SIG;
cp[row_gap+1] |= TC_SIG | V_PVE_SIG;
}
val |= lsb + (lsb>>1);
dp[1] = val;
}
cp[1] = ctxt;
}
}
}
state->A=A; state->C=C; state->word=word; state->available_bits=avail;
}
/*****************************************************************************/
/* STATIC reverse_zero_refinement_pass_func */
/*****************************************************************************/
static void
reverse_zero_refinement_pass_func(block_master_ptr master)
/* This function is identical to `zero_refinement_pass_func', except that it
passes through the list of significant subblocks and the samples within
each subblock in reverse order, from bottom right to top left. */
{
register std_int *d_cp;
register std_int d_mask;
register int c;
register std_short *cp;
register ifc_int *dp;
register std_short ctxt, context_mask;
register ifc_int shift;
register arith_state_ptr state;
register std_int A, C, word;
register context_state_ptr csp;
std_short avail;
ifc_int val, symbol, lsb;
std_byte *zc_lut;
int rows, cols, row_gap, half_inter_row, r;
std_short *context;
ifc_int *data;
context_state_ptr csp_base;
code_subblock_ptr subblock, first_subblock;
shift = master->bit_idx - 1;
assert(shift > 0);
lsb = 1 << shift;
context_mask = master->context_mask;
d_mask = context_mask; d_mask <<= 16; d_mask |= context_mask;
data = master->sample_buffer;
context = master->context_buffer;
row_gap = master->row_gap;
assert(!(row_gap & 1));
state = &(master->coder_state);
A=state->A; C=state->C; word=state->word; avail=state->available_bits;
csp_base = state->contexts;
zc_lut = master->zc_lut;
first_subblock = master->first_subblock;
for (subblock=master->last_subblock; subblock >= first_subblock; subblock--)
if (subblock->significant)
{
rows = subblock->rows;
cols = subblock->cols;
half_inter_row = (row_gap-cols)>>1;
dp = data + subblock->offset + row_gap*(rows-1) + ((cols-1) & ~1);
cp = context + subblock->offset + row_gap*(rows-1) + ((cols-1) & ~1);
d_cp = (std_int *) cp;
for (r=rows; r > 0; r--, dp-=half_inter_row<<1, cp-=half_inter_row<<1,
d_cp-=half_inter_row)
for (c=cols; c > 0; c-=2, dp-=2, cp-=2, d_cp--)
{
if (((*d_cp) & d_mask) == 0)
continue;
ctxt = cp[1];
if ((ctxt & context_mask) &&
!(ctxt & (IS_REFINED | SELF_SIG | OUT_OF_BOUNDS)))
{
ctxt |= IS_REFINED;
csp = csp_base + (ZC_OFFSET + zc_lut[ctxt & ZC_MASK]);
get_symbol(state,A,C,word,avail,symbol,csp);
if (symbol)
{ /* New significant value; update contexts & code sign */
val = ebcot_sc_lut[(ctxt>>SIGN_POS)&0x00FF];
csp = csp_base + SC_OFFSET + (val & 0x000F);
val &= MIN_IFC_INT;
get_symbol(state,A,C,word,avail,symbol,csp);
val ^= (symbol << (IMPLEMENTATION_PRECISION-1));
ctxt |= SELF_SIG;
cp[-row_gap-2+1] |= FAR_SIG;
cp[-row_gap-1+1] |= BR_SIG;
cp[-row_gap+1+1] |= BL_SIG;
cp[-row_gap+2+1] |= FAR_SIG;
cp[row_gap-2+1] |= FAR_SIG;
cp[row_gap-1+1] |= TR_SIG;
cp[row_gap+1+1] |= TL_SIG;
cp[row_gap+2+1] |= FAR_SIG;
cp[-2+1] |= FAR_SIG;
cp[2+1] |= FAR_SIG;
if (val)
{ /* Negative sample. */
cp[-1+1] |= CR_SIG | H_NVE_SIG;
cp[1+1] |= CL_SIG | H_NVE_SIG;
cp[-row_gap+1] |= BC_SIG | V_NVE_SIG;
cp[row_gap+1] |= TC_SIG | V_NVE_SIG;
}
else
{ /* Positive sample. */
cp[-1+1] |= CR_SIG | H_PVE_SIG;
cp[1+1] |= CL_SIG | H_PVE_SIG;
cp[-row_gap+1] |= BC_SIG | V_PVE_SIG;
cp[row_gap+1] |= TC_SIG | V_PVE_SIG;
}
val |= lsb + (lsb>>1);
dp[1] = val;
}
cp[1] = ctxt;
}
ctxt = cp[0];
if ((ctxt & context_mask) &&
!(ctxt & (IS_REFINED | SELF_SIG | OUT_OF_BOUNDS)))
{
ctxt |= IS_REFINED;
csp = csp_base + (ZC_OFFSET + zc_lut[ctxt & ZC_MASK]);
get_symbol(state,A,C,word,avail,symbol,csp);
if (symbol)
{ /* New significant value; update contexts & code sign */
val = ebcot_sc_lut[(ctxt>>SIGN_POS)&0x00FF];
csp = csp_base + SC_OFFSET + (val & 0x000F);
val &= MIN_IFC_INT;
get_symbol(state,A,C,word,avail,symbol,csp);
val ^= (symbol << (IMPLEMENTATION_PRECISION-1));
ctxt |= SELF_SIG;
cp[-row_gap-2] |= FAR_SIG;
cp[-row_gap-1] |= BR_SIG;
cp[-row_gap+1] |= BL_SIG;
cp[-row_gap+2] |= FAR_SIG;
cp[row_gap-2] |= FAR_SIG;
cp[row_gap-1] |= TR_SIG;
cp[row_gap+1] |= TL_SIG;
cp[row_gap+2] |= FAR_SIG;
cp[-2] |= FAR_SIG;
cp[2] |= FAR_SIG;
if (val)
{ /* Negative sample. */
cp[-1] |= CR_SIG | H_NVE_SIG;
cp[1] |= CL_SIG | H_NVE_SIG;
cp[-row_gap] |= BC_SIG | V_NVE_SIG;
cp[row_gap] |= TC_SIG | V_NVE_SIG;
}
else
{ /* Positive sample. */
cp[-1] |= CR_SIG | H_PVE_SIG;
cp[1] |= CL_SIG | H_PVE_SIG;
cp[-row_gap] |= BC_SIG | V_PVE_SIG;
cp[row_gap] |= TC_SIG | V_PVE_SIG;
}
val |= lsb + (lsb>>1);
dp[0] = val;
}
cp[0] = ctxt;
}
}
}
state->A=A; state->C=C; state->word=word; state->available_bits=avail;
}
/*****************************************************************************/
/* STATIC mag_refinement_pass_func */
/*****************************************************************************/
static void
mag_refinement_pass_func(block_master_ptr master)
/* This function refines all samples which have already been found to be
significant. */
{
register std_int *d_cp;
register std_int d_mask;
register int c;
register std_short *cp;
register ifc_int *dp;
register std_short ctxt;
register arith_state_ptr state;
register std_int A, C, word;
register context_state_ptr csp;
std_short avail;
ifc_int val, symbol, half_lsb, shift;
int rows, cols, row_gap, half_inter_row, r;
std_short *context;
ifc_int *data;
context_state_ptr csp_base;
code_subblock_ptr subblock, last_subblock;
assert(master->bit_idx > 1);
shift = master->bit_idx - 1;
half_lsb = (1 << shift) >> 1;
data = master->sample_buffer;
context = master->context_buffer;
d_mask = SELF_SIG; d_mask <<= 16; d_mask |= SELF_SIG;
row_gap = master->row_gap;
assert(!(row_gap & 1));
state = &(master->coder_state);
A=state->A; C=state->C; word=state->word; avail=state->available_bits;
csp_base = state->contexts;
last_subblock = master->last_subblock;
for (subblock=master->first_subblock; subblock <= last_subblock; subblock++)
if (subblock->significant)
{
rows = subblock->rows;
cols = subblock->cols;
half_inter_row = (row_gap-cols)>>1;
dp = data + subblock->offset;
cp = context + subblock->offset;
d_cp = (std_int *) cp;
for (r=rows; r > 0; r--, dp+=half_inter_row<<1, cp+=half_inter_row<<1,
d_cp+=half_inter_row)
for (c=cols; c > 0; c-=2, dp+=2, cp+=2, d_cp++)
{
if (!((*d_cp) & d_mask))
continue;
ctxt = cp[0];
if ((ctxt & SELF_SIG) && !(ctxt & (IS_REFINED | OUT_OF_BOUNDS)))
{
val = dp[0];
symbol = (val & MAX_IFC_INT) >> shift;
csp = csp_base + MAG_OFFSET;
if (symbol < 4)
{
if (ctxt & 0x00FF)
csp++;
}
else
csp += 2;
get_symbol(state,A,C,word,avail,symbol,csp);
val ^= ((1-symbol)<<shift);
val |= half_lsb;
dp[0] = val; /* Write new non-zero value back to buffer. */
}
ctxt = cp[1];
if ((ctxt & SELF_SIG) && !(ctxt & (IS_REFINED | OUT_OF_BOUNDS)))
{
val = dp[1];
symbol = (val & MAX_IFC_INT) >> shift;
csp = csp_base + MAG_OFFSET;
if (symbol < 4)
{
if (ctxt & 0x00FF)
csp++;
}
else
csp += 2;
get_symbol(state,A,C,word,avail,symbol,csp);
val ^= ((1-symbol)<<shift);
val |= half_lsb;
dp[1] = val; /* Write new non-zero value back to buffer. */
}
}
}
state->A=A; state->C=C; state->word=word; state->available_bits=avail;
}
/*****************************************************************************/
/* STATIC dummy_pass_func */
/*****************************************************************************/
static void
dummy_pass_func(block_master_ptr master)
/* This function may be installed into the `pass_funcs' array managed
by any subband in order to render one or more passes impotent. */
{
return;
}
/* ========================================================================= */
/* --------------------------- External Functions -------------------------- */
/* ========================================================================= */
/*****************************************************************************/
/* EXTERN ebcot_set_pass_funcs_and_masks */
/*****************************************************************************/
void
ebcot_set_pass_funcs_and_masks(band_info_ptr band, int band_idx)
{
int p;
band->pass_funcs[0] = first_pass_func; band->pass_masks[0] = 0;
for (p=1; p < PASSES_PER_BITPLANE; p++)
if (p == 1)
{
band->pass_funcs[p] = zero_refinement_pass_func;
if (band_idx == LL_BAND)
band->pass_masks[p] = 0x00FF;
else if (band_idx == HH_BAND)
band->pass_masks[p] = TL_SIG | TR_SIG | BL_SIG | BR_SIG;
else
band->pass_masks[p] = CL_SIG | CR_SIG;
}
else if (p == 2)
{
band->pass_funcs[p] = reverse_zero_refinement_pass_func;
band->pass_masks[p] = 0x00FF;
}
else if (p == 3)
{
band->pass_funcs[p] = mag_refinement_pass_func;
band->pass_masks[p] = 0; /* Mask is not used by mag refinement. */
}
else
{
band->pass_funcs[p] = dummy_pass_func;
band->pass_masks[p] = 0;
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -