| /* |
| * Copyright (c) 2010 The WebM project authors. All Rights Reserved. |
| * |
| * Use of this source code is governed by a BSD-style license |
| * that can be found in the LICENSE file in the root of the source |
| * tree. An additional intellectual property rights grant can be found |
| * in the file PATENTS. All contributing project authors may |
| * be found in the AUTHORS file in the root of the source tree. |
| */ |
| |
| #include <assert.h> |
| |
| #include "vp10/common/blockd.h" |
| #include "vp10/common/loopfilter.h" |
| #include "vp10/common/seg_common.h" |
| #include "vp10/common/quant_common.h" |
| |
| static const int seg_feature_data_signed[SEG_LVL_MAX] = { 1, 1, 0, 0 }; |
| |
| static const int seg_feature_data_max[SEG_LVL_MAX] = { |
| MAXQ, MAX_LOOP_FILTER, 3, 0 }; |
| |
| // These functions provide access to new segment level features. |
| // Eventually these function may be "optimized out" but for the moment, |
| // the coding mechanism is still subject to change so these provide a |
| // convenient single point of change. |
| |
| void vp10_clearall_segfeatures(struct segmentation *seg) { |
| vp10_zero(seg->feature_data); |
| vp10_zero(seg->feature_mask); |
| } |
| |
| void vp10_enable_segfeature(struct segmentation *seg, int segment_id, |
| SEG_LVL_FEATURES feature_id) { |
| seg->feature_mask[segment_id] |= 1 << feature_id; |
| } |
| |
| int vp10_seg_feature_data_max(SEG_LVL_FEATURES feature_id) { |
| return seg_feature_data_max[feature_id]; |
| } |
| |
| int vp10_is_segfeature_signed(SEG_LVL_FEATURES feature_id) { |
| return seg_feature_data_signed[feature_id]; |
| } |
| |
| void vp10_set_segdata(struct segmentation *seg, int segment_id, |
| SEG_LVL_FEATURES feature_id, int seg_data) { |
| assert(seg_data <= seg_feature_data_max[feature_id]); |
| if (seg_data < 0) { |
| assert(seg_feature_data_signed[feature_id]); |
| assert(-seg_data <= seg_feature_data_max[feature_id]); |
| } |
| |
| seg->feature_data[segment_id][feature_id] = seg_data; |
| } |
| |
| const vpx_tree_index vp10_segment_tree[TREE_SIZE(MAX_SEGMENTS)] = { |
| 2, 4, 6, 8, 10, 12, |
| 0, -1, -2, -3, -4, -5, -6, -7 |
| }; |
| |
| |
| // TBD? Functions to read and write segment data with range / validity checking |