Thu, 15 Jan 2015 15:59:08 +0100
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 | |
michael@0 | 12 | #ifndef VP9_COMMON_VP9_FINDNEARMV_H_ |
michael@0 | 13 | #define VP9_COMMON_VP9_FINDNEARMV_H_ |
michael@0 | 14 | |
michael@0 | 15 | #include "vp9/common/vp9_mv.h" |
michael@0 | 16 | #include "vp9/common/vp9_blockd.h" |
michael@0 | 17 | #include "vp9/common/vp9_treecoder.h" |
michael@0 | 18 | #include "vp9/common/vp9_onyxc_int.h" |
michael@0 | 19 | |
michael@0 | 20 | #define LEFT_TOP_MARGIN ((VP9BORDERINPIXELS - VP9_INTERP_EXTEND) << 3) |
michael@0 | 21 | #define RIGHT_BOTTOM_MARGIN ((VP9BORDERINPIXELS - VP9_INTERP_EXTEND) << 3) |
michael@0 | 22 | |
michael@0 | 23 | // check a list of motion vectors by sad score using a number rows of pixels |
michael@0 | 24 | // above and a number cols of pixels in the left to select the one with best |
michael@0 | 25 | // score to use as ref motion vector |
michael@0 | 26 | void vp9_find_best_ref_mvs(MACROBLOCKD *xd, int allow_hp, |
michael@0 | 27 | int_mv *mvlist, int_mv *nearest, int_mv *near); |
michael@0 | 28 | |
michael@0 | 29 | // TODO(jingning): this mv clamping function should be block size dependent. |
michael@0 | 30 | static void clamp_mv2(MV *mv, const MACROBLOCKD *xd) { |
michael@0 | 31 | clamp_mv(mv, xd->mb_to_left_edge - LEFT_TOP_MARGIN, |
michael@0 | 32 | xd->mb_to_right_edge + RIGHT_BOTTOM_MARGIN, |
michael@0 | 33 | xd->mb_to_top_edge - LEFT_TOP_MARGIN, |
michael@0 | 34 | xd->mb_to_bottom_edge + RIGHT_BOTTOM_MARGIN); |
michael@0 | 35 | } |
michael@0 | 36 | |
michael@0 | 37 | void vp9_append_sub8x8_mvs_for_idx(VP9_COMMON *cm, MACROBLOCKD *xd, |
michael@0 | 38 | const TileInfo *const tile, |
michael@0 | 39 | int_mv *dst_nearest, |
michael@0 | 40 | int_mv *dst_near, |
michael@0 | 41 | int block_idx, int ref_idx, |
michael@0 | 42 | int mi_row, int mi_col); |
michael@0 | 43 | |
michael@0 | 44 | static MB_PREDICTION_MODE left_block_mode(const MODE_INFO *cur_mi, |
michael@0 | 45 | const MODE_INFO *left_mi, int b) { |
michael@0 | 46 | if (b == 0 || b == 2) { |
michael@0 | 47 | if (!left_mi || is_inter_block(&left_mi->mbmi)) |
michael@0 | 48 | return DC_PRED; |
michael@0 | 49 | |
michael@0 | 50 | return left_mi->mbmi.sb_type < BLOCK_8X8 ? left_mi->bmi[b + 1].as_mode |
michael@0 | 51 | : left_mi->mbmi.mode; |
michael@0 | 52 | } else { |
michael@0 | 53 | assert(b == 1 || b == 3); |
michael@0 | 54 | return cur_mi->bmi[b - 1].as_mode; |
michael@0 | 55 | } |
michael@0 | 56 | } |
michael@0 | 57 | |
michael@0 | 58 | static MB_PREDICTION_MODE above_block_mode(const MODE_INFO *cur_mi, |
michael@0 | 59 | const MODE_INFO *above_mi, int b) { |
michael@0 | 60 | if (b == 0 || b == 1) { |
michael@0 | 61 | if (!above_mi || is_inter_block(&above_mi->mbmi)) |
michael@0 | 62 | return DC_PRED; |
michael@0 | 63 | |
michael@0 | 64 | return above_mi->mbmi.sb_type < BLOCK_8X8 ? above_mi->bmi[b + 2].as_mode |
michael@0 | 65 | : above_mi->mbmi.mode; |
michael@0 | 66 | } else { |
michael@0 | 67 | assert(b == 2 || b == 3); |
michael@0 | 68 | return cur_mi->bmi[b - 2].as_mode; |
michael@0 | 69 | } |
michael@0 | 70 | } |
michael@0 | 71 | |
michael@0 | 72 | #endif // VP9_COMMON_VP9_FINDNEARMV_H_ |