| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (c) 2010 The WebM project authors. All Rights Reserved. | 2 * Copyright (c) 2010 The WebM project authors. All Rights Reserved. |
| 3 * | 3 * |
| 4 * Use of this source code is governed by a BSD-style license | 4 * Use of this source code is governed by a BSD-style license |
| 5 * that can be found in the LICENSE file in the root of the source | 5 * that can be found in the LICENSE file in the root of the source |
| 6 * tree. An additional intellectual property rights grant can be found | 6 * tree. An additional intellectual property rights grant can be found |
| 7 * in the file PATENTS. All contributing project authors may | 7 * in the file PATENTS. All contributing project authors may |
| 8 * be found in the AUTHORS file in the root of the source tree. | 8 * be found in the AUTHORS file in the root of the source tree. |
| 9 */ | 9 */ |
| 10 | 10 |
| 11 #include <assert.h> | 11 #include <assert.h> |
| 12 | 12 |
| 13 #include "vp9/common/vp9_blockd.h" | 13 #include "vp9/common/vp9_blockd.h" |
| 14 #include "vp9/common/vp9_loopfilter.h" | 14 #include "vp9/common/vp9_loopfilter.h" |
| 15 #include "vp9/common/vp9_seg_common.h" | 15 #include "vp9/common/vp9_seg_common.h" |
| 16 #include "vp9/common/vp9_quant_common.h" | 16 #include "vp9/common/vp9_quant_common.h" |
| 17 | 17 |
| 18 static const int seg_feature_data_signed[SEG_LVL_MAX] = { 1, 1, 0, 0 }; | 18 static const int seg_feature_data_signed[SEG_LVL_MAX] = { 1, 1, 0, 0 }; |
| 19 | 19 |
| 20 static const int seg_feature_data_max[SEG_LVL_MAX] = { | 20 static const int seg_feature_data_max[SEG_LVL_MAX] = { |
| 21 MAXQ, MAX_LOOP_FILTER, 3, 0 }; | 21 MAXQ, MAX_LOOP_FILTER, 3, 0 }; |
| 22 | 22 |
| 23 // These functions provide access to new segment level features. | 23 // These functions provide access to new segment level features. |
| 24 // Eventually these function may be "optimized out" but for the moment, | 24 // Eventually these function may be "optimized out" but for the moment, |
| 25 // the coding mechanism is still subject to change so these provide a | 25 // the coding mechanism is still subject to change so these provide a |
| 26 // convenient single point of change. | 26 // convenient single point of change. |
| 27 | 27 |
| 28 int vp9_segfeature_active(const struct segmentation *seg, int segment_id, | |
| 29 SEG_LVL_FEATURES feature_id) { | |
| 30 return seg->enabled && | |
| 31 (seg->feature_mask[segment_id] & (1 << feature_id)); | |
| 32 } | |
| 33 | |
| 34 void vp9_clearall_segfeatures(struct segmentation *seg) { | 28 void vp9_clearall_segfeatures(struct segmentation *seg) { |
| 35 vp9_zero(seg->feature_data); | 29 vp9_zero(seg->feature_data); |
| 36 vp9_zero(seg->feature_mask); | 30 vp9_zero(seg->feature_mask); |
| 37 } | 31 } |
| 38 | 32 |
| 39 void vp9_enable_segfeature(struct segmentation *seg, int segment_id, | 33 void vp9_enable_segfeature(struct segmentation *seg, int segment_id, |
| 40 SEG_LVL_FEATURES feature_id) { | 34 SEG_LVL_FEATURES feature_id) { |
| 41 seg->feature_mask[segment_id] |= 1 << feature_id; | 35 seg->feature_mask[segment_id] |= 1 << feature_id; |
| 42 } | 36 } |
| 43 | 37 |
| 44 int vp9_seg_feature_data_max(SEG_LVL_FEATURES feature_id) { | 38 int vp9_seg_feature_data_max(SEG_LVL_FEATURES feature_id) { |
| 45 return seg_feature_data_max[feature_id]; | 39 return seg_feature_data_max[feature_id]; |
| 46 } | 40 } |
| 47 | 41 |
| 48 int vp9_is_segfeature_signed(SEG_LVL_FEATURES feature_id) { | 42 int vp9_is_segfeature_signed(SEG_LVL_FEATURES feature_id) { |
| 49 return seg_feature_data_signed[feature_id]; | 43 return seg_feature_data_signed[feature_id]; |
| 50 } | 44 } |
| 51 | 45 |
| 52 void vp9_set_segdata(struct segmentation *seg, int segment_id, | 46 void vp9_set_segdata(struct segmentation *seg, int segment_id, |
| 53 SEG_LVL_FEATURES feature_id, int seg_data) { | 47 SEG_LVL_FEATURES feature_id, int seg_data) { |
| 54 assert(seg_data <= seg_feature_data_max[feature_id]); | 48 assert(seg_data <= seg_feature_data_max[feature_id]); |
| 55 if (seg_data < 0) { | 49 if (seg_data < 0) { |
| 56 assert(seg_feature_data_signed[feature_id]); | 50 assert(seg_feature_data_signed[feature_id]); |
| 57 assert(-seg_data <= seg_feature_data_max[feature_id]); | 51 assert(-seg_data <= seg_feature_data_max[feature_id]); |
| 58 } | 52 } |
| 59 | 53 |
| 60 seg->feature_data[segment_id][feature_id] = seg_data; | 54 seg->feature_data[segment_id][feature_id] = seg_data; |
| 61 } | 55 } |
| 62 | 56 |
| 63 int vp9_get_segdata(const struct segmentation *seg, int segment_id, | |
| 64 SEG_LVL_FEATURES feature_id) { | |
| 65 return seg->feature_data[segment_id][feature_id]; | |
| 66 } | |
| 67 | |
| 68 | |
| 69 const vp9_tree_index vp9_segment_tree[TREE_SIZE(MAX_SEGMENTS)] = { | 57 const vp9_tree_index vp9_segment_tree[TREE_SIZE(MAX_SEGMENTS)] = { |
| 70 2, 4, 6, 8, 10, 12, | 58 2, 4, 6, 8, 10, 12, |
| 71 0, -1, -2, -3, -4, -5, -6, -7 | 59 0, -1, -2, -3, -4, -5, -6, -7 |
| 72 }; | 60 }; |
| 73 | 61 |
| 74 | 62 |
| 75 // TBD? Functions to read and write segment data with range / validity checking | 63 // TBD? Functions to read and write segment data with range / validity checking |
| OLD | NEW |