TreeParser.cpp 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759
  1. /*
  2. * Copyright (c) 2021, Hunter Salyer <thefalsehonesty@gmail.com>
  3. * Copyright (c) 2022, Gregory Bertilson <zaggy1024@gmail.com>
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include "TreeParser.h"
  8. #include "LookupTables.h"
  9. #include "Parser.h"
  10. namespace Video::VP9 {
  11. template<typename T>
  12. ErrorOr<T> TreeParser::parse_tree(SyntaxElementType type)
  13. {
  14. auto tree_selection = select_tree(type);
  15. int value;
  16. if (tree_selection.is_single_value()) {
  17. value = tree_selection.get_single_value();
  18. } else {
  19. auto tree = tree_selection.get_tree_value();
  20. int n = 0;
  21. do {
  22. n = tree[n + TRY(m_decoder.m_bit_stream->read_bool(select_tree_probability(type, n >> 1)))];
  23. } while (n > 0);
  24. value = -n;
  25. }
  26. count_syntax_element(type, value);
  27. return static_cast<T>(value);
  28. }
  29. template ErrorOr<int> TreeParser::parse_tree(SyntaxElementType);
  30. template ErrorOr<bool> TreeParser::parse_tree(SyntaxElementType);
  31. template ErrorOr<u8> TreeParser::parse_tree(SyntaxElementType);
  32. template ErrorOr<u32> TreeParser::parse_tree(SyntaxElementType);
  33. template ErrorOr<IntraMode> TreeParser::parse_tree(SyntaxElementType);
  34. template ErrorOr<TXSize> TreeParser::parse_tree(SyntaxElementType);
  35. template ErrorOr<InterpolationFilter> TreeParser::parse_tree(SyntaxElementType);
  36. template ErrorOr<ReferenceMode> TreeParser::parse_tree(SyntaxElementType);
  37. template ErrorOr<Token> TreeParser::parse_tree(SyntaxElementType);
  38. template ErrorOr<MvClass> TreeParser::parse_tree(SyntaxElementType);
  39. template ErrorOr<MvJoint> TreeParser::parse_tree(SyntaxElementType);
  40. /*
  41. * Select a tree value based on the type of syntax element being parsed, as well as some parser state, as specified in section 9.3.1
  42. */
  43. TreeParser::TreeSelection TreeParser::select_tree(SyntaxElementType type)
  44. {
  45. switch (type) {
  46. case SyntaxElementType::Partition:
  47. if (m_decoder.m_has_rows && m_decoder.m_has_cols)
  48. return { partition_tree };
  49. if (m_decoder.m_has_cols)
  50. return { cols_partition_tree };
  51. if (m_decoder.m_has_rows)
  52. return { rows_partition_tree };
  53. return { PartitionSplit };
  54. case SyntaxElementType::DefaultIntraMode:
  55. case SyntaxElementType::DefaultUVMode:
  56. case SyntaxElementType::IntraMode:
  57. case SyntaxElementType::SubIntraMode:
  58. case SyntaxElementType::UVMode:
  59. return { intra_mode_tree };
  60. case SyntaxElementType::SegmentID:
  61. return { segment_tree };
  62. case SyntaxElementType::Skip:
  63. case SyntaxElementType::SegIDPredicted:
  64. case SyntaxElementType::IsInter:
  65. case SyntaxElementType::CompMode:
  66. case SyntaxElementType::CompRef:
  67. case SyntaxElementType::SingleRefP1:
  68. case SyntaxElementType::SingleRefP2:
  69. case SyntaxElementType::MVSign:
  70. case SyntaxElementType::MVClass0Bit:
  71. case SyntaxElementType::MVBit:
  72. case SyntaxElementType::MoreCoefs:
  73. return { binary_tree };
  74. case SyntaxElementType::TXSize:
  75. if (m_decoder.m_max_tx_size == TX_32x32)
  76. return { tx_size_32_tree };
  77. if (m_decoder.m_max_tx_size == TX_16x16)
  78. return { tx_size_16_tree };
  79. return { tx_size_8_tree };
  80. case SyntaxElementType::InterMode:
  81. return { inter_mode_tree };
  82. case SyntaxElementType::InterpFilter:
  83. return { interp_filter_tree };
  84. case SyntaxElementType::MVJoint:
  85. return { mv_joint_tree };
  86. case SyntaxElementType::MVClass:
  87. return { mv_class_tree };
  88. case SyntaxElementType::MVClass0FR:
  89. case SyntaxElementType::MVFR:
  90. return { mv_fr_tree };
  91. case SyntaxElementType::MVClass0HP:
  92. case SyntaxElementType::MVHP:
  93. if (m_decoder.m_use_hp)
  94. return { binary_tree };
  95. return { 1 };
  96. case SyntaxElementType::Token:
  97. return { token_tree };
  98. }
  99. VERIFY_NOT_REACHED();
  100. }
  101. /*
  102. * Select a probability with which to read a boolean when decoding a tree, as specified in section 9.3.2
  103. */
  104. u8 TreeParser::select_tree_probability(SyntaxElementType type, u8 node)
  105. {
  106. switch (type) {
  107. case SyntaxElementType::Partition:
  108. return calculate_partition_probability(node);
  109. case SyntaxElementType::DefaultIntraMode:
  110. return calculate_default_intra_mode_probability(node);
  111. case SyntaxElementType::DefaultUVMode:
  112. return calculate_default_uv_mode_probability(node);
  113. case SyntaxElementType::IntraMode:
  114. return calculate_intra_mode_probability(node);
  115. case SyntaxElementType::SubIntraMode:
  116. return calculate_sub_intra_mode_probability(node);
  117. case SyntaxElementType::UVMode:
  118. return calculate_uv_mode_probability(node);
  119. case SyntaxElementType::SegmentID:
  120. return calculate_segment_id_probability(node);
  121. case SyntaxElementType::Skip:
  122. return calculate_skip_probability();
  123. case SyntaxElementType::SegIDPredicted:
  124. return calculate_seg_id_predicted_probability();
  125. case SyntaxElementType::IsInter:
  126. return calculate_is_inter_probability();
  127. case SyntaxElementType::CompMode:
  128. return calculate_comp_mode_probability();
  129. case SyntaxElementType::CompRef:
  130. return calculate_comp_ref_probability();
  131. case SyntaxElementType::SingleRefP1:
  132. return calculate_single_ref_p1_probability();
  133. case SyntaxElementType::SingleRefP2:
  134. return calculate_single_ref_p2_probability();
  135. case SyntaxElementType::MVSign:
  136. return m_decoder.m_probability_tables->mv_sign_prob()[m_mv_component];
  137. case SyntaxElementType::MVClass0Bit:
  138. return m_decoder.m_probability_tables->mv_class0_bit_prob()[m_mv_component];
  139. case SyntaxElementType::MVBit:
  140. VERIFY(m_mv_bit < MV_OFFSET_BITS);
  141. return m_decoder.m_probability_tables->mv_bits_prob()[m_mv_component][m_mv_bit];
  142. case SyntaxElementType::TXSize:
  143. return calculate_tx_size_probability(node);
  144. case SyntaxElementType::InterMode:
  145. return calculate_inter_mode_probability(node);
  146. case SyntaxElementType::InterpFilter:
  147. return calculate_interp_filter_probability(node);
  148. case SyntaxElementType::MVJoint:
  149. return m_decoder.m_probability_tables->mv_joint_probs()[node];
  150. case SyntaxElementType::MVClass:
  151. // Spec doesn't mention node, but the probabilities table has an extra dimension
  152. // so we will use node for that.
  153. return m_decoder.m_probability_tables->mv_class_probs()[m_mv_component][node];
  154. case SyntaxElementType::MVClass0FR:
  155. VERIFY(m_mv_class0_bit < CLASS0_SIZE);
  156. return m_decoder.m_probability_tables->mv_class0_fr_probs()[m_mv_component][m_mv_class0_bit][node];
  157. case SyntaxElementType::MVClass0HP:
  158. return m_decoder.m_probability_tables->mv_class0_hp_prob()[m_mv_component];
  159. case SyntaxElementType::MVFR:
  160. return m_decoder.m_probability_tables->mv_fr_probs()[m_mv_component][node];
  161. case SyntaxElementType::MVHP:
  162. return m_decoder.m_probability_tables->mv_hp_prob()[m_mv_component];
  163. case SyntaxElementType::Token:
  164. return calculate_token_probability(node);
  165. case SyntaxElementType::MoreCoefs:
  166. return calculate_more_coefs_probability();
  167. }
  168. TODO();
  169. }
  170. #define ABOVE_FRAME_0 m_decoder.m_above_ref_frame[0]
  171. #define ABOVE_FRAME_1 m_decoder.m_above_ref_frame[1]
  172. #define LEFT_FRAME_0 m_decoder.m_left_ref_frame[0]
  173. #define LEFT_FRAME_1 m_decoder.m_left_ref_frame[1]
  174. #define AVAIL_U m_decoder.m_available_u
  175. #define AVAIL_L m_decoder.m_available_l
  176. #define ABOVE_INTRA m_decoder.m_above_intra
  177. #define LEFT_INTRA m_decoder.m_left_intra
  178. #define ABOVE_SINGLE m_decoder.m_above_single
  179. #define LEFT_SINGLE m_decoder.m_left_single
  180. u8 TreeParser::calculate_partition_probability(u8 node)
  181. {
  182. int node2;
  183. if (m_decoder.m_has_rows && m_decoder.m_has_cols) {
  184. node2 = node;
  185. } else if (m_decoder.m_has_cols) {
  186. node2 = 1;
  187. } else {
  188. node2 = 2;
  189. }
  190. u32 above = 0;
  191. u32 left = 0;
  192. auto bsl = mi_width_log2_lookup[m_decoder.m_block_subsize];
  193. auto block_offset = mi_width_log2_lookup[Block_64x64] - bsl;
  194. for (auto i = 0; i < m_decoder.m_num_8x8; i++) {
  195. above |= m_decoder.m_above_partition_context[m_decoder.m_col + i];
  196. left |= m_decoder.m_left_partition_context[m_decoder.m_row + i];
  197. }
  198. above = (above & (1 << block_offset)) > 0;
  199. left = (left & (1 << block_offset)) > 0;
  200. m_ctx = bsl * 4 + left * 2 + above;
  201. if (m_decoder.m_frame_is_intra)
  202. return m_decoder.m_probability_tables->kf_partition_probs()[m_ctx][node2];
  203. return m_decoder.m_probability_tables->partition_probs()[m_ctx][node2];
  204. }
  205. u8 TreeParser::calculate_default_intra_mode_probability(u8 node)
  206. {
  207. u32 above_mode, left_mode;
  208. if (m_decoder.m_mi_size >= Block_8x8) {
  209. above_mode = AVAIL_U
  210. ? m_decoder.m_sub_modes[m_decoder.get_image_index(m_decoder.m_mi_row - 1, m_decoder.m_mi_col)][2]
  211. : DcPred;
  212. left_mode = AVAIL_L
  213. ? m_decoder.m_sub_modes[m_decoder.get_image_index(m_decoder.m_mi_row, m_decoder.m_mi_col - 1)][1]
  214. : DcPred;
  215. } else {
  216. if (m_idy) {
  217. above_mode = m_decoder.m_block_sub_modes[m_idx];
  218. } else {
  219. above_mode = AVAIL_U
  220. ? m_decoder.m_sub_modes[m_decoder.get_image_index(m_decoder.m_mi_row - 1, m_decoder.m_mi_col)][2 + m_idx]
  221. : DcPred;
  222. }
  223. if (m_idx) {
  224. left_mode = m_decoder.m_block_sub_modes[m_idy * 2];
  225. } else {
  226. left_mode = AVAIL_L
  227. ? m_decoder.m_sub_modes[m_decoder.get_image_index(m_decoder.m_mi_row, m_decoder.m_mi_col - 1)][1 + m_idy * 2]
  228. : DcPred;
  229. }
  230. }
  231. return m_decoder.m_probability_tables->kf_y_mode_probs()[above_mode][left_mode][node];
  232. }
  233. u8 TreeParser::calculate_default_uv_mode_probability(u8 node)
  234. {
  235. return m_decoder.m_probability_tables->kf_uv_mode_prob()[m_decoder.m_y_mode][node];
  236. }
  237. u8 TreeParser::calculate_intra_mode_probability(u8 node)
  238. {
  239. m_ctx = size_group_lookup[m_decoder.m_mi_size];
  240. return m_decoder.m_probability_tables->y_mode_probs()[m_ctx][node];
  241. }
  242. u8 TreeParser::calculate_sub_intra_mode_probability(u8 node)
  243. {
  244. m_ctx = 0;
  245. return m_decoder.m_probability_tables->y_mode_probs()[m_ctx][node];
  246. }
  247. u8 TreeParser::calculate_uv_mode_probability(u8 node)
  248. {
  249. m_ctx = m_decoder.m_y_mode;
  250. return m_decoder.m_probability_tables->uv_mode_probs()[m_ctx][node];
  251. }
  252. u8 TreeParser::calculate_segment_id_probability(u8 node)
  253. {
  254. return m_decoder.m_segmentation_tree_probs[node];
  255. }
  256. u8 TreeParser::calculate_skip_probability()
  257. {
  258. m_ctx = 0;
  259. if (AVAIL_U)
  260. m_ctx += m_decoder.m_skips[(m_decoder.m_mi_row - 1) * m_decoder.m_mi_cols + m_decoder.m_mi_col];
  261. if (AVAIL_L)
  262. m_ctx += m_decoder.m_skips[m_decoder.m_mi_row * m_decoder.m_mi_cols + m_decoder.m_mi_col - 1];
  263. return m_decoder.m_probability_tables->skip_prob()[m_ctx];
  264. }
  265. u8 TreeParser::calculate_seg_id_predicted_probability()
  266. {
  267. m_ctx = m_decoder.m_left_seg_pred_context[m_decoder.m_mi_row] + m_decoder.m_above_seg_pred_context[m_decoder.m_mi_col];
  268. return m_decoder.m_segmentation_pred_prob[m_ctx];
  269. }
  270. u8 TreeParser::calculate_is_inter_probability()
  271. {
  272. if (AVAIL_U && AVAIL_L) {
  273. m_ctx = (LEFT_INTRA && ABOVE_INTRA) ? 3 : LEFT_INTRA || ABOVE_INTRA;
  274. } else if (AVAIL_U || AVAIL_L) {
  275. m_ctx = 2 * (AVAIL_U ? ABOVE_INTRA : LEFT_INTRA);
  276. } else {
  277. m_ctx = 0;
  278. }
  279. return m_decoder.m_probability_tables->is_inter_prob()[m_ctx];
  280. }
  281. u8 TreeParser::calculate_comp_mode_probability()
  282. {
  283. if (AVAIL_U && AVAIL_L) {
  284. if (ABOVE_SINGLE && LEFT_SINGLE) {
  285. auto is_above_fixed = ABOVE_FRAME_0 == m_decoder.m_comp_fixed_ref;
  286. auto is_left_fixed = LEFT_FRAME_0 == m_decoder.m_comp_fixed_ref;
  287. m_ctx = is_above_fixed ^ is_left_fixed;
  288. } else if (ABOVE_SINGLE) {
  289. auto is_above_fixed = ABOVE_FRAME_0 == m_decoder.m_comp_fixed_ref;
  290. m_ctx = 2 + (is_above_fixed || ABOVE_INTRA);
  291. } else if (LEFT_SINGLE) {
  292. auto is_left_fixed = LEFT_FRAME_0 == m_decoder.m_comp_fixed_ref;
  293. m_ctx = 2 + (is_left_fixed || LEFT_INTRA);
  294. } else {
  295. m_ctx = 4;
  296. }
  297. } else if (AVAIL_U) {
  298. if (ABOVE_SINGLE) {
  299. m_ctx = ABOVE_FRAME_0 == m_decoder.m_comp_fixed_ref;
  300. } else {
  301. m_ctx = 3;
  302. }
  303. } else if (AVAIL_L) {
  304. if (LEFT_SINGLE) {
  305. m_ctx = LEFT_FRAME_0 == m_decoder.m_comp_fixed_ref;
  306. } else {
  307. m_ctx = 3;
  308. }
  309. } else {
  310. m_ctx = 1;
  311. }
  312. return m_decoder.m_probability_tables->comp_mode_prob()[m_ctx];
  313. }
  314. u8 TreeParser::calculate_comp_ref_probability()
  315. {
  316. auto fix_ref_idx = m_decoder.m_ref_frame_sign_bias[m_decoder.m_comp_fixed_ref];
  317. auto var_ref_idx = !fix_ref_idx;
  318. if (AVAIL_U && AVAIL_L) {
  319. if (ABOVE_INTRA && LEFT_INTRA) {
  320. m_ctx = 2;
  321. } else if (LEFT_INTRA) {
  322. if (ABOVE_SINGLE) {
  323. m_ctx = 1 + 2 * (ABOVE_FRAME_0 != m_decoder.m_comp_var_ref[1]);
  324. } else {
  325. m_ctx = 1 + 2 * (m_decoder.m_above_ref_frame[var_ref_idx] != m_decoder.m_comp_var_ref[1]);
  326. }
  327. } else if (ABOVE_INTRA) {
  328. if (LEFT_SINGLE) {
  329. m_ctx = 1 + 2 * (LEFT_FRAME_0 != m_decoder.m_comp_var_ref[1]);
  330. } else {
  331. m_ctx = 1 + 2 * (m_decoder.m_left_ref_frame[var_ref_idx] != m_decoder.m_comp_var_ref[1]);
  332. }
  333. } else {
  334. auto var_ref_above = m_decoder.m_above_ref_frame[ABOVE_SINGLE ? 0 : var_ref_idx];
  335. auto var_ref_left = m_decoder.m_left_ref_frame[LEFT_SINGLE ? 0 : var_ref_idx];
  336. if (var_ref_above == var_ref_left && m_decoder.m_comp_var_ref[1] == var_ref_above) {
  337. m_ctx = 0;
  338. } else if (LEFT_SINGLE && ABOVE_SINGLE) {
  339. if ((var_ref_above == m_decoder.m_comp_fixed_ref && var_ref_left == m_decoder.m_comp_var_ref[0])
  340. || (var_ref_left == m_decoder.m_comp_fixed_ref && var_ref_above == m_decoder.m_comp_var_ref[0])) {
  341. m_ctx = 4;
  342. } else if (var_ref_above == var_ref_left) {
  343. m_ctx = 3;
  344. } else {
  345. m_ctx = 1;
  346. }
  347. } else if (LEFT_SINGLE || ABOVE_SINGLE) {
  348. auto vrfc = LEFT_SINGLE ? var_ref_above : var_ref_left;
  349. auto rfs = ABOVE_SINGLE ? var_ref_above : var_ref_left;
  350. if (vrfc == m_decoder.m_comp_var_ref[1] && rfs != m_decoder.m_comp_var_ref[1]) {
  351. m_ctx = 1;
  352. } else if (rfs == m_decoder.m_comp_var_ref[1] && vrfc != m_decoder.m_comp_var_ref[1]) {
  353. m_ctx = 2;
  354. } else {
  355. m_ctx = 4;
  356. }
  357. } else if (var_ref_above == var_ref_left) {
  358. m_ctx = 4;
  359. } else {
  360. m_ctx = 2;
  361. }
  362. }
  363. } else if (AVAIL_U) {
  364. if (ABOVE_INTRA) {
  365. m_ctx = 2;
  366. } else {
  367. if (ABOVE_SINGLE) {
  368. m_ctx = 3 * (ABOVE_FRAME_0 != m_decoder.m_comp_var_ref[1]);
  369. } else {
  370. m_ctx = 4 * (m_decoder.m_above_ref_frame[var_ref_idx] != m_decoder.m_comp_var_ref[1]);
  371. }
  372. }
  373. } else if (AVAIL_L) {
  374. if (LEFT_INTRA) {
  375. m_ctx = 2;
  376. } else {
  377. if (LEFT_SINGLE) {
  378. m_ctx = 3 * (LEFT_FRAME_0 != m_decoder.m_comp_var_ref[1]);
  379. } else {
  380. m_ctx = 4 * (m_decoder.m_left_ref_frame[var_ref_idx] != m_decoder.m_comp_var_ref[1]);
  381. }
  382. }
  383. } else {
  384. m_ctx = 2;
  385. }
  386. return m_decoder.m_probability_tables->comp_ref_prob()[m_ctx];
  387. }
  388. u8 TreeParser::calculate_single_ref_p1_probability()
  389. {
  390. if (AVAIL_U && AVAIL_L) {
  391. if (ABOVE_INTRA && LEFT_INTRA) {
  392. m_ctx = 2;
  393. } else if (LEFT_INTRA) {
  394. if (ABOVE_SINGLE) {
  395. m_ctx = 4 * (ABOVE_FRAME_0 == LastFrame);
  396. } else {
  397. m_ctx = 1 + (ABOVE_FRAME_0 == LastFrame || ABOVE_FRAME_1 == LastFrame);
  398. }
  399. } else if (ABOVE_INTRA) {
  400. if (LEFT_SINGLE) {
  401. m_ctx = 4 * (LEFT_FRAME_0 == LastFrame);
  402. } else {
  403. m_ctx = 1 + (LEFT_FRAME_0 == LastFrame || LEFT_FRAME_1 == LastFrame);
  404. }
  405. } else {
  406. if (LEFT_SINGLE && ABOVE_SINGLE) {
  407. m_ctx = 2 * (ABOVE_FRAME_0 == LastFrame) + 2 * (LEFT_FRAME_0 == LastFrame);
  408. } else if (!LEFT_SINGLE && !ABOVE_SINGLE) {
  409. auto above_is_last = ABOVE_FRAME_0 == LastFrame || ABOVE_FRAME_1 == LastFrame;
  410. auto left_is_last = LEFT_FRAME_0 == LastFrame || LEFT_FRAME_1 == LastFrame;
  411. m_ctx = 1 + (above_is_last || left_is_last);
  412. } else {
  413. auto rfs = ABOVE_SINGLE ? ABOVE_FRAME_0 : LEFT_FRAME_0;
  414. auto crf1 = ABOVE_SINGLE ? LEFT_FRAME_0 : ABOVE_FRAME_0;
  415. auto crf2 = ABOVE_SINGLE ? LEFT_FRAME_1 : ABOVE_FRAME_1;
  416. m_ctx = crf1 == LastFrame || crf2 == LastFrame;
  417. if (rfs == LastFrame)
  418. m_ctx += 3;
  419. }
  420. }
  421. } else if (AVAIL_U) {
  422. if (ABOVE_INTRA) {
  423. m_ctx = 2;
  424. } else {
  425. if (ABOVE_SINGLE) {
  426. m_ctx = 4 * (ABOVE_FRAME_0 == LastFrame);
  427. } else {
  428. m_ctx = 1 + (ABOVE_FRAME_0 == LastFrame || ABOVE_FRAME_1 == LastFrame);
  429. }
  430. }
  431. } else if (AVAIL_L) {
  432. if (LEFT_INTRA) {
  433. m_ctx = 2;
  434. } else {
  435. if (LEFT_SINGLE) {
  436. m_ctx = 4 * (LEFT_FRAME_0 == LastFrame);
  437. } else {
  438. m_ctx = 1 + (LEFT_FRAME_0 == LastFrame || LEFT_FRAME_1 == LastFrame);
  439. }
  440. }
  441. } else {
  442. m_ctx = 2;
  443. }
  444. return m_decoder.m_probability_tables->single_ref_prob()[m_ctx][0];
  445. }
  446. u8 TreeParser::calculate_single_ref_p2_probability()
  447. {
  448. if (AVAIL_U && AVAIL_L) {
  449. if (ABOVE_INTRA && LEFT_INTRA) {
  450. m_ctx = 2;
  451. } else if (LEFT_INTRA) {
  452. if (ABOVE_SINGLE) {
  453. if (ABOVE_FRAME_0 == LastFrame) {
  454. m_ctx = 3;
  455. } else {
  456. m_ctx = 4 * (ABOVE_FRAME_0 == GoldenFrame);
  457. }
  458. } else {
  459. m_ctx = 1 + 2 * (ABOVE_FRAME_0 == GoldenFrame || ABOVE_FRAME_1 == GoldenFrame);
  460. }
  461. } else if (ABOVE_INTRA) {
  462. if (LEFT_SINGLE) {
  463. if (LEFT_FRAME_0 == LastFrame) {
  464. m_ctx = 3;
  465. } else {
  466. m_ctx = 4 * (LEFT_FRAME_0 == GoldenFrame);
  467. }
  468. } else {
  469. m_ctx = 1 + 2 * (LEFT_FRAME_0 == GoldenFrame || LEFT_FRAME_1 == GoldenFrame);
  470. }
  471. } else {
  472. if (LEFT_SINGLE && ABOVE_SINGLE) {
  473. auto above_last = ABOVE_FRAME_0 == LastFrame;
  474. auto left_last = LEFT_FRAME_0 == LastFrame;
  475. if (above_last && left_last) {
  476. m_ctx = 3;
  477. } else if (above_last) {
  478. m_ctx = 4 * (LEFT_FRAME_0 == GoldenFrame);
  479. } else if (left_last) {
  480. m_ctx = 4 * (ABOVE_FRAME_0 == GoldenFrame);
  481. } else {
  482. m_ctx = 2 * (ABOVE_FRAME_0 == GoldenFrame) + 2 * (LEFT_FRAME_0 == GoldenFrame);
  483. }
  484. } else if (!LEFT_SINGLE && !ABOVE_SINGLE) {
  485. if (ABOVE_FRAME_0 == LEFT_FRAME_0 && ABOVE_FRAME_1 == LEFT_FRAME_1) {
  486. m_ctx = 3 * (ABOVE_FRAME_0 == GoldenFrame || ABOVE_FRAME_1 == GoldenFrame);
  487. } else {
  488. m_ctx = 2;
  489. }
  490. } else {
  491. auto rfs = ABOVE_SINGLE ? ABOVE_FRAME_0 : LEFT_FRAME_0;
  492. auto crf1 = ABOVE_SINGLE ? LEFT_FRAME_0 : ABOVE_FRAME_0;
  493. auto crf2 = ABOVE_SINGLE ? LEFT_FRAME_1 : ABOVE_FRAME_1;
  494. m_ctx = crf1 == GoldenFrame || crf2 == GoldenFrame;
  495. if (rfs == GoldenFrame) {
  496. m_ctx += 3;
  497. } else if (rfs != AltRefFrame) {
  498. m_ctx = 1 + (2 * m_ctx);
  499. }
  500. }
  501. }
  502. } else if (AVAIL_U) {
  503. if (ABOVE_INTRA || (ABOVE_FRAME_0 == LastFrame && ABOVE_SINGLE)) {
  504. m_ctx = 2;
  505. } else if (ABOVE_SINGLE) {
  506. m_ctx = 4 * (ABOVE_FRAME_0 == GoldenFrame);
  507. } else {
  508. m_ctx = 3 * (ABOVE_FRAME_0 == GoldenFrame || ABOVE_FRAME_1 == GoldenFrame);
  509. }
  510. } else if (AVAIL_L) {
  511. if (LEFT_INTRA || (LEFT_FRAME_0 == LastFrame && LEFT_SINGLE)) {
  512. m_ctx = 2;
  513. } else if (LEFT_SINGLE) {
  514. m_ctx = 4 * (LEFT_FRAME_0 == GoldenFrame);
  515. } else {
  516. m_ctx = 3 * (LEFT_FRAME_0 == GoldenFrame || LEFT_FRAME_1 == GoldenFrame);
  517. }
  518. } else {
  519. m_ctx = 2;
  520. }
  521. return m_decoder.m_probability_tables->single_ref_prob()[m_ctx][1];
  522. }
  523. u8 TreeParser::calculate_tx_size_probability(u8 node)
  524. {
  525. auto above = m_decoder.m_max_tx_size;
  526. auto left = m_decoder.m_max_tx_size;
  527. if (AVAIL_U) {
  528. auto u_pos = (m_decoder.m_mi_row - 1) * m_decoder.m_mi_cols + m_decoder.m_mi_col;
  529. if (!m_decoder.m_skips[u_pos])
  530. above = m_decoder.m_tx_sizes[u_pos];
  531. }
  532. if (AVAIL_L) {
  533. auto l_pos = m_decoder.m_mi_row * m_decoder.m_mi_cols + m_decoder.m_mi_col - 1;
  534. if (!m_decoder.m_skips[l_pos])
  535. left = m_decoder.m_tx_sizes[l_pos];
  536. }
  537. if (!AVAIL_L)
  538. left = above;
  539. if (!AVAIL_U)
  540. above = left;
  541. m_ctx = (above + left) > m_decoder.m_max_tx_size;
  542. return m_decoder.m_probability_tables->tx_probs()[m_decoder.m_max_tx_size][m_ctx][node];
  543. }
  544. u8 TreeParser::calculate_inter_mode_probability(u8 node)
  545. {
  546. m_ctx = m_decoder.m_mode_context[m_decoder.m_ref_frame[0]];
  547. return m_decoder.m_probability_tables->inter_mode_probs()[m_ctx][node];
  548. }
  549. u8 TreeParser::calculate_interp_filter_probability(u8 node)
  550. {
  551. // NOTE: SWITCHABLE_FILTERS is not used in the spec for this function. Therefore, the number
  552. // was demystified by referencing the reference codec libvpx:
  553. // https://github.com/webmproject/libvpx/blob/705bf9de8c96cfe5301451f1d7e5c90a41c64e5f/vp9/common/vp9_pred_common.h#L69
  554. auto left_interp = (AVAIL_L && m_decoder.m_left_ref_frame[0] > IntraFrame)
  555. ? m_decoder.m_interp_filters[m_decoder.get_image_index(m_decoder.m_mi_row, m_decoder.m_mi_col - 1)]
  556. : SWITCHABLE_FILTERS;
  557. auto above_interp = (AVAIL_U && m_decoder.m_above_ref_frame[0] > IntraFrame)
  558. ? m_decoder.m_interp_filters[m_decoder.get_image_index(m_decoder.m_mi_row - 1, m_decoder.m_mi_col)]
  559. : SWITCHABLE_FILTERS;
  560. if (left_interp == above_interp)
  561. m_ctx = left_interp;
  562. else if (left_interp == SWITCHABLE_FILTERS)
  563. m_ctx = above_interp;
  564. else if (above_interp == SWITCHABLE_FILTERS)
  565. m_ctx = left_interp;
  566. else
  567. m_ctx = SWITCHABLE_FILTERS;
  568. return m_decoder.m_probability_tables->interp_filter_probs()[m_ctx][node];
  569. }
  570. void TreeParser::set_tokens_variables(u8 band, u32 c, u32 plane, TXSize tx_size, u32 pos)
  571. {
  572. m_band = band;
  573. m_c = c;
  574. m_plane = plane;
  575. m_tx_size = tx_size;
  576. m_pos = pos;
  577. if (m_c == 0) {
  578. auto sx = m_plane > 0 ? m_decoder.m_subsampling_x : 0;
  579. auto sy = m_plane > 0 ? m_decoder.m_subsampling_y : 0;
  580. auto max_x = (2 * m_decoder.m_mi_cols) >> sx;
  581. auto max_y = (2 * m_decoder.m_mi_rows) >> sy;
  582. u8 numpts = 1 << m_tx_size;
  583. auto x4 = m_start_x >> 2;
  584. auto y4 = m_start_y >> 2;
  585. u32 above = 0;
  586. u32 left = 0;
  587. for (size_t i = 0; i < numpts; i++) {
  588. if (x4 + i < max_x)
  589. above |= m_decoder.m_above_nonzero_context[m_plane][x4 + i];
  590. if (y4 + i < max_y)
  591. left |= m_decoder.m_left_nonzero_context[m_plane][y4 + i];
  592. }
  593. m_ctx = above + left;
  594. } else {
  595. u32 neighbor_0, neighbor_1;
  596. auto n = 4 << m_tx_size;
  597. auto i = m_pos / n;
  598. auto j = m_pos % n;
  599. auto a = i > 0 ? (i - 1) * n + j : 0;
  600. auto a2 = i * n + j - 1;
  601. if (i > 0 && j > 0) {
  602. if (m_decoder.m_tx_type == DCT_ADST) {
  603. neighbor_0 = a;
  604. neighbor_1 = a;
  605. } else if (m_decoder.m_tx_type == ADST_DCT) {
  606. neighbor_0 = a2;
  607. neighbor_1 = a2;
  608. } else {
  609. neighbor_0 = a;
  610. neighbor_1 = a2;
  611. }
  612. } else if (i > 0) {
  613. neighbor_0 = a;
  614. neighbor_1 = a;
  615. } else {
  616. neighbor_0 = a2;
  617. neighbor_1 = a2;
  618. }
  619. m_ctx = (1 + m_decoder.m_token_cache[neighbor_0] + m_decoder.m_token_cache[neighbor_1]) >> 1;
  620. }
  621. }
  622. u8 TreeParser::calculate_more_coefs_probability()
  623. {
  624. return m_decoder.m_probability_tables->coef_probs()[m_tx_size][m_plane > 0][m_decoder.m_is_inter][m_band][m_ctx][0];
  625. }
  626. u8 TreeParser::calculate_token_probability(u8 node)
  627. {
  628. auto prob = m_decoder.m_probability_tables->coef_probs()[m_tx_size][m_plane > 0][m_decoder.m_is_inter][m_band][m_ctx][min(2, 1 + node)];
  629. if (node < 2)
  630. return prob;
  631. auto x = (prob - 1) / 2;
  632. auto& pareto_table = m_decoder.m_probability_tables->pareto_table();
  633. if (prob & 1)
  634. return pareto_table[x][node - 2];
  635. return (pareto_table[x][node - 2] + pareto_table[x + 1][node - 2]) >> 1;
  636. }
  637. void TreeParser::count_syntax_element(SyntaxElementType type, int value)
  638. {
  639. auto increment = [](u8& count) {
  640. count = min(static_cast<u32>(count) + 1, 255);
  641. };
  642. switch (type) {
  643. case SyntaxElementType::Partition:
  644. increment(m_decoder.m_syntax_element_counter->m_counts_partition[m_ctx][value]);
  645. return;
  646. case SyntaxElementType::IntraMode:
  647. case SyntaxElementType::SubIntraMode:
  648. increment(m_decoder.m_syntax_element_counter->m_counts_intra_mode[m_ctx][value]);
  649. return;
  650. case SyntaxElementType::UVMode:
  651. increment(m_decoder.m_syntax_element_counter->m_counts_uv_mode[m_ctx][value]);
  652. return;
  653. case SyntaxElementType::Skip:
  654. increment(m_decoder.m_syntax_element_counter->m_counts_skip[m_ctx][value]);
  655. return;
  656. case SyntaxElementType::IsInter:
  657. increment(m_decoder.m_syntax_element_counter->m_counts_is_inter[m_ctx][value]);
  658. return;
  659. case SyntaxElementType::CompMode:
  660. increment(m_decoder.m_syntax_element_counter->m_counts_comp_mode[m_ctx][value]);
  661. return;
  662. case SyntaxElementType::CompRef:
  663. increment(m_decoder.m_syntax_element_counter->m_counts_comp_ref[m_ctx][value]);
  664. return;
  665. case SyntaxElementType::SingleRefP1:
  666. increment(m_decoder.m_syntax_element_counter->m_counts_single_ref[m_ctx][0][value]);
  667. return;
  668. case SyntaxElementType::SingleRefP2:
  669. increment(m_decoder.m_syntax_element_counter->m_counts_single_ref[m_ctx][1][value]);
  670. return;
  671. case SyntaxElementType::MVSign:
  672. increment(m_decoder.m_syntax_element_counter->m_counts_mv_sign[m_mv_component][value]);
  673. return;
  674. case SyntaxElementType::MVClass0Bit:
  675. increment(m_decoder.m_syntax_element_counter->m_counts_mv_class0_bit[m_mv_component][value]);
  676. return;
  677. case SyntaxElementType::MVBit:
  678. VERIFY(m_mv_bit < MV_OFFSET_BITS);
  679. increment(m_decoder.m_syntax_element_counter->m_counts_mv_bits[m_mv_component][m_mv_bit][value]);
  680. m_mv_bit = 0xFF;
  681. return;
  682. case SyntaxElementType::TXSize:
  683. increment(m_decoder.m_syntax_element_counter->m_counts_tx_size[m_decoder.m_max_tx_size][m_ctx][value]);
  684. return;
  685. case SyntaxElementType::InterMode:
  686. increment(m_decoder.m_syntax_element_counter->m_counts_inter_mode[m_ctx][value]);
  687. return;
  688. case SyntaxElementType::InterpFilter:
  689. increment(m_decoder.m_syntax_element_counter->m_counts_interp_filter[m_ctx][value]);
  690. return;
  691. case SyntaxElementType::MVJoint:
  692. increment(m_decoder.m_syntax_element_counter->m_counts_mv_joint[value]);
  693. return;
  694. case SyntaxElementType::MVClass:
  695. increment(m_decoder.m_syntax_element_counter->m_counts_mv_class[m_mv_component][value]);
  696. return;
  697. case SyntaxElementType::MVClass0FR:
  698. VERIFY(m_mv_class0_bit < CLASS0_SIZE);
  699. increment(m_decoder.m_syntax_element_counter->m_counts_mv_class0_fr[m_mv_component][m_mv_class0_bit][value]);
  700. m_mv_class0_bit = 0xFF;
  701. return;
  702. case SyntaxElementType::MVClass0HP:
  703. increment(m_decoder.m_syntax_element_counter->m_counts_mv_class0_hp[m_mv_component][value]);
  704. return;
  705. case SyntaxElementType::MVFR:
  706. increment(m_decoder.m_syntax_element_counter->m_counts_mv_fr[m_mv_component][value]);
  707. return;
  708. case SyntaxElementType::MVHP:
  709. increment(m_decoder.m_syntax_element_counter->m_counts_mv_hp[m_mv_component][value]);
  710. return;
  711. case SyntaxElementType::Token:
  712. increment(m_decoder.m_syntax_element_counter->m_counts_token[m_tx_size][m_plane > 0][m_decoder.m_is_inter][m_band][m_ctx][min(2, value)]);
  713. return;
  714. case SyntaxElementType::MoreCoefs:
  715. increment(m_decoder.m_syntax_element_counter->m_counts_more_coefs[m_tx_size][m_plane > 0][m_decoder.m_is_inter][m_band][m_ctx][value]);
  716. return;
  717. case SyntaxElementType::DefaultIntraMode:
  718. case SyntaxElementType::DefaultUVMode:
  719. case SyntaxElementType::SegmentID:
  720. case SyntaxElementType::SegIDPredicted:
  721. // No counting required
  722. return;
  723. }
  724. TODO();
  725. }
  726. }