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 | #include "vpx_config.h" |
michael@0 | 13 | #include "vp8_rtcd.h" |
michael@0 | 14 | #include "blockd.h" |
michael@0 | 15 | |
michael@0 | 16 | void vp8_intra4x4_predict_c(unsigned char *Above, |
michael@0 | 17 | unsigned char *yleft, int left_stride, |
michael@0 | 18 | int _b_mode, |
michael@0 | 19 | unsigned char *dst, int dst_stride, |
michael@0 | 20 | unsigned char top_left) |
michael@0 | 21 | { |
michael@0 | 22 | int i, r, c; |
michael@0 | 23 | B_PREDICTION_MODE b_mode = (B_PREDICTION_MODE)_b_mode; |
michael@0 | 24 | unsigned char Left[4]; |
michael@0 | 25 | Left[0] = yleft[0]; |
michael@0 | 26 | Left[1] = yleft[left_stride]; |
michael@0 | 27 | Left[2] = yleft[2 * left_stride]; |
michael@0 | 28 | Left[3] = yleft[3 * left_stride]; |
michael@0 | 29 | |
michael@0 | 30 | switch (b_mode) |
michael@0 | 31 | { |
michael@0 | 32 | case B_DC_PRED: |
michael@0 | 33 | { |
michael@0 | 34 | int expected_dc = 0; |
michael@0 | 35 | |
michael@0 | 36 | for (i = 0; i < 4; i++) |
michael@0 | 37 | { |
michael@0 | 38 | expected_dc += Above[i]; |
michael@0 | 39 | expected_dc += Left[i]; |
michael@0 | 40 | } |
michael@0 | 41 | |
michael@0 | 42 | expected_dc = (expected_dc + 4) >> 3; |
michael@0 | 43 | |
michael@0 | 44 | for (r = 0; r < 4; r++) |
michael@0 | 45 | { |
michael@0 | 46 | for (c = 0; c < 4; c++) |
michael@0 | 47 | { |
michael@0 | 48 | dst[c] = expected_dc; |
michael@0 | 49 | } |
michael@0 | 50 | |
michael@0 | 51 | dst += dst_stride; |
michael@0 | 52 | } |
michael@0 | 53 | } |
michael@0 | 54 | break; |
michael@0 | 55 | case B_TM_PRED: |
michael@0 | 56 | { |
michael@0 | 57 | /* prediction similar to true_motion prediction */ |
michael@0 | 58 | for (r = 0; r < 4; r++) |
michael@0 | 59 | { |
michael@0 | 60 | for (c = 0; c < 4; c++) |
michael@0 | 61 | { |
michael@0 | 62 | int pred = Above[c] - top_left + Left[r]; |
michael@0 | 63 | |
michael@0 | 64 | if (pred < 0) |
michael@0 | 65 | pred = 0; |
michael@0 | 66 | |
michael@0 | 67 | if (pred > 255) |
michael@0 | 68 | pred = 255; |
michael@0 | 69 | |
michael@0 | 70 | dst[c] = pred; |
michael@0 | 71 | } |
michael@0 | 72 | |
michael@0 | 73 | dst += dst_stride; |
michael@0 | 74 | } |
michael@0 | 75 | } |
michael@0 | 76 | break; |
michael@0 | 77 | |
michael@0 | 78 | case B_VE_PRED: |
michael@0 | 79 | { |
michael@0 | 80 | |
michael@0 | 81 | unsigned int ap[4]; |
michael@0 | 82 | ap[0] = (top_left + 2 * Above[0] + Above[1] + 2) >> 2; |
michael@0 | 83 | ap[1] = (Above[0] + 2 * Above[1] + Above[2] + 2) >> 2; |
michael@0 | 84 | ap[2] = (Above[1] + 2 * Above[2] + Above[3] + 2) >> 2; |
michael@0 | 85 | ap[3] = (Above[2] + 2 * Above[3] + Above[4] + 2) >> 2; |
michael@0 | 86 | |
michael@0 | 87 | for (r = 0; r < 4; r++) |
michael@0 | 88 | { |
michael@0 | 89 | for (c = 0; c < 4; c++) |
michael@0 | 90 | { |
michael@0 | 91 | |
michael@0 | 92 | dst[c] = ap[c]; |
michael@0 | 93 | } |
michael@0 | 94 | |
michael@0 | 95 | dst += dst_stride; |
michael@0 | 96 | } |
michael@0 | 97 | |
michael@0 | 98 | } |
michael@0 | 99 | break; |
michael@0 | 100 | |
michael@0 | 101 | |
michael@0 | 102 | case B_HE_PRED: |
michael@0 | 103 | { |
michael@0 | 104 | |
michael@0 | 105 | unsigned int lp[4]; |
michael@0 | 106 | lp[0] = (top_left + 2 * Left[0] + Left[1] + 2) >> 2; |
michael@0 | 107 | lp[1] = (Left[0] + 2 * Left[1] + Left[2] + 2) >> 2; |
michael@0 | 108 | lp[2] = (Left[1] + 2 * Left[2] + Left[3] + 2) >> 2; |
michael@0 | 109 | lp[3] = (Left[2] + 2 * Left[3] + Left[3] + 2) >> 2; |
michael@0 | 110 | |
michael@0 | 111 | for (r = 0; r < 4; r++) |
michael@0 | 112 | { |
michael@0 | 113 | for (c = 0; c < 4; c++) |
michael@0 | 114 | { |
michael@0 | 115 | dst[c] = lp[r]; |
michael@0 | 116 | } |
michael@0 | 117 | |
michael@0 | 118 | dst += dst_stride; |
michael@0 | 119 | } |
michael@0 | 120 | } |
michael@0 | 121 | break; |
michael@0 | 122 | case B_LD_PRED: |
michael@0 | 123 | { |
michael@0 | 124 | unsigned char *ptr = Above; |
michael@0 | 125 | dst[0 * dst_stride + 0] = (ptr[0] + ptr[1] * 2 + ptr[2] + 2) >> 2; |
michael@0 | 126 | dst[0 * dst_stride + 1] = |
michael@0 | 127 | dst[1 * dst_stride + 0] = (ptr[1] + ptr[2] * 2 + ptr[3] + 2) >> 2; |
michael@0 | 128 | dst[0 * dst_stride + 2] = |
michael@0 | 129 | dst[1 * dst_stride + 1] = |
michael@0 | 130 | dst[2 * dst_stride + 0] = (ptr[2] + ptr[3] * 2 + ptr[4] + 2) >> 2; |
michael@0 | 131 | dst[0 * dst_stride + 3] = |
michael@0 | 132 | dst[1 * dst_stride + 2] = |
michael@0 | 133 | dst[2 * dst_stride + 1] = |
michael@0 | 134 | dst[3 * dst_stride + 0] = (ptr[3] + ptr[4] * 2 + ptr[5] + 2) >> 2; |
michael@0 | 135 | dst[1 * dst_stride + 3] = |
michael@0 | 136 | dst[2 * dst_stride + 2] = |
michael@0 | 137 | dst[3 * dst_stride + 1] = (ptr[4] + ptr[5] * 2 + ptr[6] + 2) >> 2; |
michael@0 | 138 | dst[2 * dst_stride + 3] = |
michael@0 | 139 | dst[3 * dst_stride + 2] = (ptr[5] + ptr[6] * 2 + ptr[7] + 2) >> 2; |
michael@0 | 140 | dst[3 * dst_stride + 3] = (ptr[6] + ptr[7] * 2 + ptr[7] + 2) >> 2; |
michael@0 | 141 | |
michael@0 | 142 | } |
michael@0 | 143 | break; |
michael@0 | 144 | case B_RD_PRED: |
michael@0 | 145 | { |
michael@0 | 146 | |
michael@0 | 147 | unsigned char pp[9]; |
michael@0 | 148 | |
michael@0 | 149 | pp[0] = Left[3]; |
michael@0 | 150 | pp[1] = Left[2]; |
michael@0 | 151 | pp[2] = Left[1]; |
michael@0 | 152 | pp[3] = Left[0]; |
michael@0 | 153 | pp[4] = top_left; |
michael@0 | 154 | pp[5] = Above[0]; |
michael@0 | 155 | pp[6] = Above[1]; |
michael@0 | 156 | pp[7] = Above[2]; |
michael@0 | 157 | pp[8] = Above[3]; |
michael@0 | 158 | |
michael@0 | 159 | dst[3 * dst_stride + 0] = (pp[0] + pp[1] * 2 + pp[2] + 2) >> 2; |
michael@0 | 160 | dst[3 * dst_stride + 1] = |
michael@0 | 161 | dst[2 * dst_stride + 0] = (pp[1] + pp[2] * 2 + pp[3] + 2) >> 2; |
michael@0 | 162 | dst[3 * dst_stride + 2] = |
michael@0 | 163 | dst[2 * dst_stride + 1] = |
michael@0 | 164 | dst[1 * dst_stride + 0] = (pp[2] + pp[3] * 2 + pp[4] + 2) >> 2; |
michael@0 | 165 | dst[3 * dst_stride + 3] = |
michael@0 | 166 | dst[2 * dst_stride + 2] = |
michael@0 | 167 | dst[1 * dst_stride + 1] = |
michael@0 | 168 | dst[0 * dst_stride + 0] = (pp[3] + pp[4] * 2 + pp[5] + 2) >> 2; |
michael@0 | 169 | dst[2 * dst_stride + 3] = |
michael@0 | 170 | dst[1 * dst_stride + 2] = |
michael@0 | 171 | dst[0 * dst_stride + 1] = (pp[4] + pp[5] * 2 + pp[6] + 2) >> 2; |
michael@0 | 172 | dst[1 * dst_stride + 3] = |
michael@0 | 173 | dst[0 * dst_stride + 2] = (pp[5] + pp[6] * 2 + pp[7] + 2) >> 2; |
michael@0 | 174 | dst[0 * dst_stride + 3] = (pp[6] + pp[7] * 2 + pp[8] + 2) >> 2; |
michael@0 | 175 | |
michael@0 | 176 | } |
michael@0 | 177 | break; |
michael@0 | 178 | case B_VR_PRED: |
michael@0 | 179 | { |
michael@0 | 180 | |
michael@0 | 181 | unsigned char pp[9]; |
michael@0 | 182 | |
michael@0 | 183 | pp[0] = Left[3]; |
michael@0 | 184 | pp[1] = Left[2]; |
michael@0 | 185 | pp[2] = Left[1]; |
michael@0 | 186 | pp[3] = Left[0]; |
michael@0 | 187 | pp[4] = top_left; |
michael@0 | 188 | pp[5] = Above[0]; |
michael@0 | 189 | pp[6] = Above[1]; |
michael@0 | 190 | pp[7] = Above[2]; |
michael@0 | 191 | pp[8] = Above[3]; |
michael@0 | 192 | |
michael@0 | 193 | |
michael@0 | 194 | dst[3 * dst_stride + 0] = (pp[1] + pp[2] * 2 + pp[3] + 2) >> 2; |
michael@0 | 195 | dst[2 * dst_stride + 0] = (pp[2] + pp[3] * 2 + pp[4] + 2) >> 2; |
michael@0 | 196 | dst[3 * dst_stride + 1] = |
michael@0 | 197 | dst[1 * dst_stride + 0] = (pp[3] + pp[4] * 2 + pp[5] + 2) >> 2; |
michael@0 | 198 | dst[2 * dst_stride + 1] = |
michael@0 | 199 | dst[0 * dst_stride + 0] = (pp[4] + pp[5] + 1) >> 1; |
michael@0 | 200 | dst[3 * dst_stride + 2] = |
michael@0 | 201 | dst[1 * dst_stride + 1] = (pp[4] + pp[5] * 2 + pp[6] + 2) >> 2; |
michael@0 | 202 | dst[2 * dst_stride + 2] = |
michael@0 | 203 | dst[0 * dst_stride + 1] = (pp[5] + pp[6] + 1) >> 1; |
michael@0 | 204 | dst[3 * dst_stride + 3] = |
michael@0 | 205 | dst[1 * dst_stride + 2] = (pp[5] + pp[6] * 2 + pp[7] + 2) >> 2; |
michael@0 | 206 | dst[2 * dst_stride + 3] = |
michael@0 | 207 | dst[0 * dst_stride + 2] = (pp[6] + pp[7] + 1) >> 1; |
michael@0 | 208 | dst[1 * dst_stride + 3] = (pp[6] + pp[7] * 2 + pp[8] + 2) >> 2; |
michael@0 | 209 | dst[0 * dst_stride + 3] = (pp[7] + pp[8] + 1) >> 1; |
michael@0 | 210 | |
michael@0 | 211 | } |
michael@0 | 212 | break; |
michael@0 | 213 | case B_VL_PRED: |
michael@0 | 214 | { |
michael@0 | 215 | |
michael@0 | 216 | unsigned char *pp = Above; |
michael@0 | 217 | |
michael@0 | 218 | dst[0 * dst_stride + 0] = (pp[0] + pp[1] + 1) >> 1; |
michael@0 | 219 | dst[1 * dst_stride + 0] = (pp[0] + pp[1] * 2 + pp[2] + 2) >> 2; |
michael@0 | 220 | dst[2 * dst_stride + 0] = |
michael@0 | 221 | dst[0 * dst_stride + 1] = (pp[1] + pp[2] + 1) >> 1; |
michael@0 | 222 | dst[1 * dst_stride + 1] = |
michael@0 | 223 | dst[3 * dst_stride + 0] = (pp[1] + pp[2] * 2 + pp[3] + 2) >> 2; |
michael@0 | 224 | dst[2 * dst_stride + 1] = |
michael@0 | 225 | dst[0 * dst_stride + 2] = (pp[2] + pp[3] + 1) >> 1; |
michael@0 | 226 | dst[3 * dst_stride + 1] = |
michael@0 | 227 | dst[1 * dst_stride + 2] = (pp[2] + pp[3] * 2 + pp[4] + 2) >> 2; |
michael@0 | 228 | dst[0 * dst_stride + 3] = |
michael@0 | 229 | dst[2 * dst_stride + 2] = (pp[3] + pp[4] + 1) >> 1; |
michael@0 | 230 | dst[1 * dst_stride + 3] = |
michael@0 | 231 | dst[3 * dst_stride + 2] = (pp[3] + pp[4] * 2 + pp[5] + 2) >> 2; |
michael@0 | 232 | dst[2 * dst_stride + 3] = (pp[4] + pp[5] * 2 + pp[6] + 2) >> 2; |
michael@0 | 233 | dst[3 * dst_stride + 3] = (pp[5] + pp[6] * 2 + pp[7] + 2) >> 2; |
michael@0 | 234 | } |
michael@0 | 235 | break; |
michael@0 | 236 | |
michael@0 | 237 | case B_HD_PRED: |
michael@0 | 238 | { |
michael@0 | 239 | unsigned char pp[9]; |
michael@0 | 240 | pp[0] = Left[3]; |
michael@0 | 241 | pp[1] = Left[2]; |
michael@0 | 242 | pp[2] = Left[1]; |
michael@0 | 243 | pp[3] = Left[0]; |
michael@0 | 244 | pp[4] = top_left; |
michael@0 | 245 | pp[5] = Above[0]; |
michael@0 | 246 | pp[6] = Above[1]; |
michael@0 | 247 | pp[7] = Above[2]; |
michael@0 | 248 | pp[8] = Above[3]; |
michael@0 | 249 | |
michael@0 | 250 | |
michael@0 | 251 | dst[3 * dst_stride + 0] = (pp[0] + pp[1] + 1) >> 1; |
michael@0 | 252 | dst[3 * dst_stride + 1] = (pp[0] + pp[1] * 2 + pp[2] + 2) >> 2; |
michael@0 | 253 | dst[2 * dst_stride + 0] = |
michael@0 | 254 | dst[3 * dst_stride + 2] = (pp[1] + pp[2] + 1) >> 1; |
michael@0 | 255 | dst[2 * dst_stride + 1] = |
michael@0 | 256 | dst[3 * dst_stride + 3] = (pp[1] + pp[2] * 2 + pp[3] + 2) >> 2; |
michael@0 | 257 | dst[2 * dst_stride + 2] = |
michael@0 | 258 | dst[1 * dst_stride + 0] = (pp[2] + pp[3] + 1) >> 1; |
michael@0 | 259 | dst[2 * dst_stride + 3] = |
michael@0 | 260 | dst[1 * dst_stride + 1] = (pp[2] + pp[3] * 2 + pp[4] + 2) >> 2; |
michael@0 | 261 | dst[1 * dst_stride + 2] = |
michael@0 | 262 | dst[0 * dst_stride + 0] = (pp[3] + pp[4] + 1) >> 1; |
michael@0 | 263 | dst[1 * dst_stride + 3] = |
michael@0 | 264 | dst[0 * dst_stride + 1] = (pp[3] + pp[4] * 2 + pp[5] + 2) >> 2; |
michael@0 | 265 | dst[0 * dst_stride + 2] = (pp[4] + pp[5] * 2 + pp[6] + 2) >> 2; |
michael@0 | 266 | dst[0 * dst_stride + 3] = (pp[5] + pp[6] * 2 + pp[7] + 2) >> 2; |
michael@0 | 267 | } |
michael@0 | 268 | break; |
michael@0 | 269 | |
michael@0 | 270 | |
michael@0 | 271 | case B_HU_PRED: |
michael@0 | 272 | { |
michael@0 | 273 | unsigned char *pp = Left; |
michael@0 | 274 | dst[0 * dst_stride + 0] = (pp[0] + pp[1] + 1) >> 1; |
michael@0 | 275 | dst[0 * dst_stride + 1] = (pp[0] + pp[1] * 2 + pp[2] + 2) >> 2; |
michael@0 | 276 | dst[0 * dst_stride + 2] = |
michael@0 | 277 | dst[1 * dst_stride + 0] = (pp[1] + pp[2] + 1) >> 1; |
michael@0 | 278 | dst[0 * dst_stride + 3] = |
michael@0 | 279 | dst[1 * dst_stride + 1] = (pp[1] + pp[2] * 2 + pp[3] + 2) >> 2; |
michael@0 | 280 | dst[1 * dst_stride + 2] = |
michael@0 | 281 | dst[2 * dst_stride + 0] = (pp[2] + pp[3] + 1) >> 1; |
michael@0 | 282 | dst[1 * dst_stride + 3] = |
michael@0 | 283 | dst[2 * dst_stride + 1] = (pp[2] + pp[3] * 2 + pp[3] + 2) >> 2; |
michael@0 | 284 | dst[2 * dst_stride + 2] = |
michael@0 | 285 | dst[2 * dst_stride + 3] = |
michael@0 | 286 | dst[3 * dst_stride + 0] = |
michael@0 | 287 | dst[3 * dst_stride + 1] = |
michael@0 | 288 | dst[3 * dst_stride + 2] = |
michael@0 | 289 | dst[3 * dst_stride + 3] = pp[3]; |
michael@0 | 290 | } |
michael@0 | 291 | break; |
michael@0 | 292 | |
michael@0 | 293 | default: |
michael@0 | 294 | break; |
michael@0 | 295 | |
michael@0 | 296 | } |
michael@0 | 297 | } |