media/libvpx/vp9/common/vp9_seg_common.c@ac0c01689b40 (annotated)
media/libvpx/vp9/common/vp9_seg_common.c
Thu, 15 Jan 2015 15:59:08 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Thu, 15 Jan 2015 15:59:08 +0100
- branch
- TOR_BUG_9701
- changeset 10
- ac0c01689b40
- permissions
- -rw-r--r--
Implement a real Private Browsing Mode condition by changing the API/ABI;
This solves Tor bug #9701, complying with disk avoidance documented in
https://www.torproject.org/projects/torbrowser/design/#disk-avoidance.
| michael@0 | 1 | /* |
| michael@0 | 2 | * Copyright (c) 2010 The WebM project authors. All Rights Reserved. |
| michael@0 | 3 | * |
| michael@0 | 4 | * Use of this source code is governed by a BSD-style license |
| michael@0 | 5 | * that can be found in the LICENSE file in the root of the source |
| michael@0 | 6 | * tree. An additional intellectual property rights grant can be found |
| michael@0 | 7 | * in the file PATENTS. All contributing project authors may |
| michael@0 | 8 | * be found in the AUTHORS file in the root of the source tree. |
| michael@0 | 9 | */ |
| michael@0 | 10 | |
| michael@0 | 11 | #include <assert.h> |
| michael@0 | 12 | |
| michael@0 | 13 | #include "vp9/common/vp9_blockd.h" |
| michael@0 | 14 | #include "vp9/common/vp9_loopfilter.h" |
| michael@0 | 15 | #include "vp9/common/vp9_seg_common.h" |
| michael@0 | 16 | #include "vp9/common/vp9_quant_common.h" |
| michael@0 | 17 | |
| michael@0 | 18 | static const int seg_feature_data_signed[SEG_LVL_MAX] = { 1, 1, 0, 0 }; |
| michael@0 | 19 | |
| michael@0 | 20 | static const int seg_feature_data_max[SEG_LVL_MAX] = { |
| michael@0 | 21 | MAXQ, MAX_LOOP_FILTER, 3, 0 }; |
| michael@0 | 22 | |
| michael@0 | 23 | // These functions provide access to new segment level features. |
| michael@0 | 24 | // Eventually these function may be "optimized out" but for the moment, |
| michael@0 | 25 | // the coding mechanism is still subject to change so these provide a |
| michael@0 | 26 | // convenient single point of change. |
| michael@0 | 27 | |
| michael@0 | 28 | int vp9_segfeature_active(const struct segmentation *seg, int segment_id, |
| michael@0 | 29 | SEG_LVL_FEATURES feature_id) { |
| michael@0 | 30 | return seg->enabled && |
| michael@0 | 31 | (seg->feature_mask[segment_id] & (1 << feature_id)); |
| michael@0 | 32 | } |
| michael@0 | 33 | |
| michael@0 | 34 | void vp9_clearall_segfeatures(struct segmentation *seg) { |
| michael@0 | 35 | vp9_zero(seg->feature_data); |
| michael@0 | 36 | vp9_zero(seg->feature_mask); |
| michael@0 | 37 | } |
| michael@0 | 38 | |
| michael@0 | 39 | void vp9_enable_segfeature(struct segmentation *seg, int segment_id, |
| michael@0 | 40 | SEG_LVL_FEATURES feature_id) { |
| michael@0 | 41 | seg->feature_mask[segment_id] |= 1 << feature_id; |
| michael@0 | 42 | } |
| michael@0 | 43 | |
| michael@0 | 44 | void vp9_disable_segfeature(struct segmentation *seg, int segment_id, |
| michael@0 | 45 | SEG_LVL_FEATURES feature_id) { |
| michael@0 | 46 | seg->feature_mask[segment_id] &= ~(1 << feature_id); |
| michael@0 | 47 | } |
| michael@0 | 48 | |
| michael@0 | 49 | int vp9_seg_feature_data_max(SEG_LVL_FEATURES feature_id) { |
| michael@0 | 50 | return seg_feature_data_max[feature_id]; |
| michael@0 | 51 | } |
| michael@0 | 52 | |
| michael@0 | 53 | int vp9_is_segfeature_signed(SEG_LVL_FEATURES feature_id) { |
| michael@0 | 54 | return seg_feature_data_signed[feature_id]; |
| michael@0 | 55 | } |
| michael@0 | 56 | |
| michael@0 | 57 | void vp9_clear_segdata(struct segmentation *seg, int segment_id, |
| michael@0 | 58 | SEG_LVL_FEATURES feature_id) { |
| michael@0 | 59 | seg->feature_data[segment_id][feature_id] = 0; |
| michael@0 | 60 | } |
| michael@0 | 61 | |
| michael@0 | 62 | void vp9_set_segdata(struct segmentation *seg, int segment_id, |
| michael@0 | 63 | SEG_LVL_FEATURES feature_id, int seg_data) { |
| michael@0 | 64 | assert(seg_data <= seg_feature_data_max[feature_id]); |
| michael@0 | 65 | if (seg_data < 0) { |
| michael@0 | 66 | assert(seg_feature_data_signed[feature_id]); |
| michael@0 | 67 | assert(-seg_data <= seg_feature_data_max[feature_id]); |
| michael@0 | 68 | } |
| michael@0 | 69 | |
| michael@0 | 70 | seg->feature_data[segment_id][feature_id] = seg_data; |
| michael@0 | 71 | } |
| michael@0 | 72 | |
| michael@0 | 73 | int vp9_get_segdata(const struct segmentation *seg, int segment_id, |
| michael@0 | 74 | SEG_LVL_FEATURES feature_id) { |
| michael@0 | 75 | return seg->feature_data[segment_id][feature_id]; |
| michael@0 | 76 | } |
| michael@0 | 77 | |
| michael@0 | 78 | |
| michael@0 | 79 | const vp9_tree_index vp9_segment_tree[TREE_SIZE(MAX_SEGMENTS)] = { |
| michael@0 | 80 | 2, 4, 6, 8, 10, 12, |
| michael@0 | 81 | 0, -1, -2, -3, -4, -5, -6, -7 |
| michael@0 | 82 | }; |
| michael@0 | 83 | |
| michael@0 | 84 | |
| michael@0 | 85 | // TBD? Functions to read and write segment data with range / validity checking |
