| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | /* | ||
| 2 | * H.263 encoder header | ||
| 3 | * | ||
| 4 | * This file is part of FFmpeg. | ||
| 5 | * | ||
| 6 | * FFmpeg is free software; you can redistribute it and/or | ||
| 7 | * modify it under the terms of the GNU Lesser General Public | ||
| 8 | * License as published by the Free Software Foundation; either | ||
| 9 | * version 2.1 of the License, or (at your option) any later version. | ||
| 10 | * | ||
| 11 | * FFmpeg is distributed in the hope that it will be useful, | ||
| 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
| 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | ||
| 14 | * Lesser General Public License for more details. | ||
| 15 | * | ||
| 16 | * You should have received a copy of the GNU Lesser General Public | ||
| 17 | * License along with FFmpeg; if not, write to the Free Software | ||
| 18 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | ||
| 19 | */ | ||
| 20 | #ifndef AVCODEC_H263ENC_H | ||
| 21 | #define AVCODEC_H263ENC_H | ||
| 22 | |||
| 23 | #include <stdint.h> | ||
| 24 | #include "h263data.h" | ||
| 25 | #include "mpegvideoenc.h" | ||
| 26 | |||
| 27 | void ff_h263_encode_init(MpegEncContext *s); | ||
| 28 | void ff_h263_encode_picture_header(MpegEncContext *s); | ||
| 29 | void ff_h263_encode_gob_header(MpegEncContext * s, int mb_line); | ||
| 30 | void ff_h263_encode_mb(MpegEncContext *s, | ||
| 31 | int16_t block[6][64], | ||
| 32 | int motion_x, int motion_y); | ||
| 33 | void ff_h263_encode_mba(MpegEncContext *s); | ||
| 34 | |||
| 35 | void ff_clean_h263_qscales(MpegEncContext *s); | ||
| 36 | |||
| 37 | void ff_h263_encode_motion(PutBitContext *pb, int val, int f_code); | ||
| 38 | void ff_h263_update_mb(MpegEncContext *s); | ||
| 39 | |||
| 40 | 2638623 | static inline void ff_h263_encode_motion_vector(MpegEncContext * s, | |
| 41 | int x, int y, int f_code) | ||
| 42 | { | ||
| 43 | 2638623 | ff_h263_encode_motion(&s->pb, x, f_code); | |
| 44 | 2638623 | ff_h263_encode_motion(&s->pb, y, f_code); | |
| 45 | 2638623 | } | |
| 46 | |||
| 47 | 1195000 | static inline int get_p_cbp(MpegEncContext * s, | |
| 48 | int16_t block[6][64], | ||
| 49 | int motion_x, int motion_y){ | ||
| 50 | int cbp; | ||
| 51 | |||
| 52 |
1/2✗ Branch 0 not taken.
✓ Branch 1 taken 1195000 times.
|
1195000 | if (s->mpv_flags & FF_MPV_FLAG_CBP_RD) { |
| 53 | ✗ | int best_cbpy_score = INT_MAX; | |
| 54 | ✗ | int best_cbpc_score = INT_MAX; | |
| 55 | ✗ | int cbpc = (-1), cbpy = (-1); | |
| 56 | ✗ | const int offset = (s->mv_type == MV_TYPE_16X16 ? 0 : 16) + (s->dquant ? 8 : 0); | |
| 57 | ✗ | const int lambda = s->lambda2 >> (FF_LAMBDA_SHIFT - 6); | |
| 58 | |||
| 59 | ✗ | for (int i = 0; i < 4; i++) { | |
| 60 | ✗ | int score = ff_h263_inter_MCBPC_bits[i + offset] * lambda; | |
| 61 | ✗ | if (i & 1) score += s->coded_score[5]; | |
| 62 | ✗ | if (i & 2) score += s->coded_score[4]; | |
| 63 | |||
| 64 | ✗ | if (score < best_cbpc_score) { | |
| 65 | ✗ | best_cbpc_score = score; | |
| 66 | ✗ | cbpc = i; | |
| 67 | } | ||
| 68 | } | ||
| 69 | |||
| 70 | ✗ | for (int i = 0; i < 16; i++) { | |
| 71 | ✗ | int score= ff_h263_cbpy_tab[i ^ 0xF][1] * lambda; | |
| 72 | ✗ | if (i & 1) score += s->coded_score[3]; | |
| 73 | ✗ | if (i & 2) score += s->coded_score[2]; | |
| 74 | ✗ | if (i & 4) score += s->coded_score[1]; | |
| 75 | ✗ | if (i & 8) score += s->coded_score[0]; | |
| 76 | |||
| 77 | ✗ | if (score < best_cbpy_score) { | |
| 78 | ✗ | best_cbpy_score = score; | |
| 79 | ✗ | cbpy = i; | |
| 80 | } | ||
| 81 | } | ||
| 82 | ✗ | cbp = cbpc + 4 * cbpy; | |
| 83 | ✗ | if (!(motion_x | motion_y | s->dquant) && s->mv_type == MV_TYPE_16X16) { | |
| 84 | ✗ | if (best_cbpy_score + best_cbpc_score + 2 * lambda >= 0) | |
| 85 | ✗ | cbp= 0; | |
| 86 | } | ||
| 87 | |||
| 88 | ✗ | for (int i = 0; i < 6; i++) { | |
| 89 | ✗ | if (s->block_last_index[i] >= 0 && !((cbp >> (5 - i)) & 1)) { | |
| 90 | ✗ | s->block_last_index[i] = -1; | |
| 91 | ✗ | s->bdsp.clear_block(s->block[i]); | |
| 92 | } | ||
| 93 | } | ||
| 94 | } else { | ||
| 95 | 1195000 | cbp = 0; | |
| 96 |
2/2✓ Branch 0 taken 7170000 times.
✓ Branch 1 taken 1195000 times.
|
8365000 | for (int i = 0; i < 6; i++) { |
| 97 |
2/2✓ Branch 0 taken 3231088 times.
✓ Branch 1 taken 3938912 times.
|
7170000 | if (s->block_last_index[i] >= 0) |
| 98 | 3231088 | cbp |= 1 << (5 - i); | |
| 99 | } | ||
| 100 | } | ||
| 101 | 1195000 | return cbp; | |
| 102 | } | ||
| 103 | |||
| 104 | #endif | ||
| 105 |