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.

103 lines
3.2KB

  1. /*
  2. * Alpha optimized DSP utils
  3. * Copyright (c) 2002 Falk Hueffner <falk@debian.org>
  4. *
  5. * This library is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU Lesser General Public
  7. * License as published by the Free Software Foundation; either
  8. * version 2 of the License, or (at your option) any later version.
  9. *
  10. * This library is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * Lesser General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU Lesser General Public
  16. * License along with this library; if not, write to the Free Software
  17. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  18. */
  19. #include "asm.h"
  20. #include "../dsputil.h"
  21. #include "../mpegvideo.h"
  22. extern void simple_idct_put_axp(uint8_t *dest, int line_size, DCTELEM *block);
  23. extern void simple_idct_add_axp(uint8_t *dest, int line_size, DCTELEM *block);
  24. static void dct_unquantize_h263_axp(MpegEncContext *s, DCTELEM *block,
  25. int n, int qscale)
  26. {
  27. int i, n_coeffs;
  28. uint64_t qmul, qadd;
  29. uint64_t correction;
  30. DCTELEM *orig_block = block;
  31. DCTELEM block0;
  32. qadd = WORD_VEC((qscale - 1) | 1);
  33. qmul = qscale << 1;
  34. /* This mask kills spill from negative subwords to the next subword. */
  35. correction = WORD_VEC((qmul - 1) + 1); /* multiplication / addition */
  36. if (s->mb_intra) {
  37. if (!s->h263_aic) {
  38. if (n < 4)
  39. block0 = block[0] * s->y_dc_scale;
  40. else
  41. block0 = block[0] * s->c_dc_scale;
  42. } else {
  43. qadd = 0;
  44. }
  45. n_coeffs = 63; // does not always use zigzag table
  46. } else {
  47. n_coeffs = s->intra_scantable.raster_end[s->block_last_index[n]];
  48. }
  49. for(i = 0; i <= n_coeffs; block += 4, i += 4) {
  50. uint64_t levels, negmask, zeros, add;
  51. levels = ldq(block);
  52. if (levels == 0)
  53. continue;
  54. #ifdef __alpha_max__
  55. /* I don't think the speed difference justifies runtime
  56. detection. */
  57. ASM_ACCEPT_MVI;
  58. negmask = maxsw4(levels, -1); /* negative -> ffff (-1) */
  59. negmask = minsw4(negmask, 0); /* positive -> 0000 (0) */
  60. #else
  61. negmask = cmpbge(WORD_VEC(0x7fff), levels);
  62. negmask &= (negmask >> 1) | (1 << 7);
  63. negmask = zap(-1, negmask);
  64. #endif
  65. zeros = cmpbge(0, levels);
  66. zeros &= zeros >> 1;
  67. /* zeros |= zeros << 1 is not needed since qadd <= 255, so
  68. zapping the lower byte suffices. */
  69. levels *= qmul;
  70. levels -= correction & (negmask << 16);
  71. /* Negate qadd for negative levels. */
  72. add = qadd ^ negmask;
  73. add += WORD_VEC(0x0001) & negmask;
  74. /* Set qadd to 0 for levels == 0. */
  75. add = zap(add, zeros);
  76. levels += add;
  77. stq(levels, block);
  78. }
  79. if (s->mb_intra && !s->h263_aic)
  80. orig_block[0] = block0;
  81. }
  82. void MPV_common_init_axp(MpegEncContext *s)
  83. {
  84. s->dct_unquantize_h263 = dct_unquantize_h263_axp;
  85. s->idct_put = simple_idct_put_axp;
  86. s->idct_add = simple_idct_add_axp;
  87. }