Parser.cpp 80 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705
  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 <AK/String.h>
  8. #include <LibGfx/Point.h>
  9. #include <LibGfx/Size.h>
  10. #include "Context.h"
  11. #include "Decoder.h"
  12. #include "Parser.h"
  13. #include "Utilities.h"
  14. #if defined(AK_COMPILER_GCC)
  15. # pragma GCC optimize("O3")
  16. #endif
  17. namespace Video::VP9 {
  18. #define TRY_READ(expression) DECODER_TRY(DecoderErrorCategory::Corrupted, expression)
  19. Parser::Parser(Decoder& decoder)
  20. : m_probability_tables(make<ProbabilityTables>())
  21. , m_decoder(decoder)
  22. {
  23. }
  24. Parser::~Parser()
  25. {
  26. }
  27. Vector<size_t> Parser::parse_superframe_sizes(ReadonlyBytes frame_data)
  28. {
  29. if (frame_data.size() < 1)
  30. return {};
  31. // The decoder determines the presence of a superframe by:
  32. // 1. parsing the final byte of the chunk and checking that the superframe_marker equals 0b110,
  33. // If the checks in steps 1 and 3 both pass, then the chunk is determined to contain a superframe and each
  34. // frame in the superframe is passed to the decoding process in turn.
  35. // Otherwise, the chunk is determined to not contain a superframe, and the whole chunk is passed to the
  36. // decoding process.
  37. // NOTE: Reading from span data will be quicker than spinning up a BitStream.
  38. u8 superframe_byte = frame_data[frame_data.size() - 1];
  39. // NOTE: We have to read out of the byte from the little end first, hence the padding bits in the masks below.
  40. u8 superframe_marker = superframe_byte & 0b1110'0000;
  41. if (superframe_marker == 0b1100'0000) {
  42. u8 bytes_per_framesize = ((superframe_byte >> 3) & 0b11) + 1;
  43. u8 frames_in_superframe = (superframe_byte & 0b111) + 1;
  44. // 2. setting the total size of the superframe_index SzIndex equal to 2 + NumFrames * SzBytes,
  45. size_t index_size = 2 + bytes_per_framesize * frames_in_superframe;
  46. if (index_size > frame_data.size())
  47. return {};
  48. auto superframe_header_data = frame_data.data() + frame_data.size() - index_size;
  49. u8 start_superframe_byte = *(superframe_header_data++);
  50. // 3. checking that the first byte of the superframe_index matches the final byte.
  51. if (superframe_byte != start_superframe_byte)
  52. return {};
  53. Vector<size_t> result;
  54. for (u8 i = 0; i < frames_in_superframe; i++) {
  55. size_t frame_size = 0;
  56. for (u8 j = 0; j < bytes_per_framesize; j++)
  57. frame_size |= (static_cast<size_t>(*(superframe_header_data++)) << (j * 8));
  58. result.append(frame_size);
  59. }
  60. return result;
  61. }
  62. return {};
  63. }
  64. /* (6.1) */
  65. DecoderErrorOr<FrameContext> Parser::parse_frame(ReadonlyBytes frame_data)
  66. {
  67. m_bit_stream = make<BitStream>(frame_data.data(), frame_data.size());
  68. m_syntax_element_counter = make<SyntaxElementCounter>();
  69. auto frame_context = TRY(uncompressed_header());
  70. if (!trailing_bits())
  71. return DecoderError::corrupted("Trailing bits were non-zero"sv);
  72. // FIXME: This should not be an error. Spec says that we consume padding bits until the end of the sample.
  73. if (frame_context.header_size_in_bytes == 0)
  74. return DecoderError::corrupted("Frame header is zero-sized"sv);
  75. m_probability_tables->load_probs(frame_context.probability_context_index);
  76. m_probability_tables->load_probs2(frame_context.probability_context_index);
  77. m_syntax_element_counter->clear_counts();
  78. TRY_READ(m_bit_stream->init_bool(frame_context.header_size_in_bytes));
  79. TRY(compressed_header(frame_context));
  80. TRY_READ(m_bit_stream->exit_bool());
  81. TRY(m_decoder.allocate_buffers(frame_context));
  82. TRY(decode_tiles(frame_context));
  83. TRY(refresh_probs(frame_context));
  84. m_previous_frame_type = frame_context.type;
  85. m_previous_frame_size = frame_context.size();
  86. m_previous_show_frame = frame_context.shows_a_frame();
  87. m_previous_color_config = frame_context.color_config;
  88. m_previous_loop_filter_ref_deltas = frame_context.loop_filter_reference_deltas;
  89. m_previous_loop_filter_mode_deltas = frame_context.loop_filter_mode_deltas;
  90. if (frame_context.segmentation_enabled) {
  91. m_previous_should_use_absolute_segment_base_quantizer = frame_context.should_use_absolute_segment_base_quantizer;
  92. m_previous_segmentation_features = frame_context.segmentation_features;
  93. }
  94. return frame_context;
  95. }
  96. bool Parser::trailing_bits()
  97. {
  98. while (m_bit_stream->bits_remaining() & 7u) {
  99. if (MUST(m_bit_stream->read_bit()))
  100. return false;
  101. }
  102. return true;
  103. }
  104. DecoderErrorOr<void> Parser::refresh_probs(FrameContext const& frame_context)
  105. {
  106. if (!frame_context.error_resilient_mode && !frame_context.parallel_decoding_mode) {
  107. m_probability_tables->load_probs(frame_context.probability_context_index);
  108. TRY(m_decoder.adapt_coef_probs(frame_context.is_inter_predicted()));
  109. if (frame_context.is_inter_predicted()) {
  110. m_probability_tables->load_probs2(frame_context.probability_context_index);
  111. TRY(m_decoder.adapt_non_coef_probs(frame_context));
  112. }
  113. }
  114. if (frame_context.should_replace_probability_context)
  115. m_probability_tables->save_probs(frame_context.probability_context_index);
  116. return {};
  117. }
  118. DecoderErrorOr<ColorRange> Parser::read_color_range()
  119. {
  120. if (TRY_READ(m_bit_stream->read_bit()))
  121. return ColorRange::Full;
  122. return ColorRange::Studio;
  123. }
  124. /* (6.2) */
  125. DecoderErrorOr<FrameContext> Parser::uncompressed_header()
  126. {
  127. // NOTE: m_reusable_frame_block_contexts does not need to retain any data between frame decodes.
  128. // This is only stored so that we don't need to allocate a frame's block contexts on each
  129. // call to this function, since it will rarely change sizes.
  130. FrameContext frame_context { m_reusable_frame_block_contexts };
  131. frame_context.color_config = m_previous_color_config;
  132. auto frame_marker = TRY_READ(m_bit_stream->read_bits(2));
  133. if (frame_marker != 2)
  134. return DecoderError::corrupted("uncompressed_header: Frame marker must be 2"sv);
  135. auto profile_low_bit = TRY_READ(m_bit_stream->read_bit());
  136. auto profile_high_bit = TRY_READ(m_bit_stream->read_bit());
  137. frame_context.profile = (profile_high_bit << 1u) + profile_low_bit;
  138. if (frame_context.profile == 3 && TRY_READ(m_bit_stream->read_bit()))
  139. return DecoderError::corrupted("uncompressed_header: Profile 3 reserved bit was non-zero"sv);
  140. if (TRY_READ(m_bit_stream->read_bit())) {
  141. frame_context.set_existing_frame_to_show(TRY_READ(m_bit_stream->read_bits(3)));
  142. return frame_context;
  143. }
  144. bool is_keyframe = !TRY_READ(m_bit_stream->read_bit());
  145. if (!TRY_READ(m_bit_stream->read_bit()))
  146. frame_context.set_frame_hidden();
  147. frame_context.error_resilient_mode = TRY_READ(m_bit_stream->read_bit());
  148. FrameType type;
  149. Gfx::Size<u32> frame_size;
  150. Gfx::Size<u32> render_size;
  151. u8 reference_frames_to_update_flags = 0xFF; // Save frame to all reference indices by default.
  152. enum class ResetProbabilities : u8 {
  153. No = 0,
  154. // 1 also means No here, but we don't need to do anything with the No case.
  155. OnlyCurrent = 2,
  156. All = 3,
  157. };
  158. ResetProbabilities reset_frame_context = ResetProbabilities::All;
  159. if (is_keyframe) {
  160. type = FrameType::KeyFrame;
  161. TRY(frame_sync_code());
  162. frame_context.color_config = TRY(parse_color_config(frame_context));
  163. frame_size = TRY(parse_frame_size());
  164. render_size = TRY(parse_render_size(frame_size));
  165. } else {
  166. if (!frame_context.shows_a_frame() && TRY_READ(m_bit_stream->read_bit())) {
  167. type = FrameType::IntraOnlyFrame;
  168. } else {
  169. type = FrameType::InterFrame;
  170. reset_frame_context = ResetProbabilities::No;
  171. }
  172. if (!frame_context.error_resilient_mode)
  173. reset_frame_context = static_cast<ResetProbabilities>(TRY_READ(m_bit_stream->read_bits(2)));
  174. if (type == FrameType::IntraOnlyFrame) {
  175. TRY(frame_sync_code());
  176. frame_context.color_config = frame_context.profile > 0 ? TRY(parse_color_config(frame_context)) : ColorConfig();
  177. reference_frames_to_update_flags = TRY_READ(m_bit_stream->read_f8());
  178. frame_size = TRY(parse_frame_size());
  179. render_size = TRY(parse_render_size(frame_size));
  180. } else {
  181. reference_frames_to_update_flags = TRY_READ(m_bit_stream->read_f8());
  182. for (auto i = 0; i < 3; i++) {
  183. frame_context.reference_frame_indices[i] = TRY_READ(m_bit_stream->read_bits(3));
  184. frame_context.reference_frame_sign_biases[ReferenceFrameType::LastFrame + i] = TRY_READ(m_bit_stream->read_bit());
  185. }
  186. frame_size = TRY(parse_frame_size_with_refs(frame_context.reference_frame_indices));
  187. render_size = TRY(parse_render_size(frame_size));
  188. frame_context.high_precision_motion_vectors_allowed = TRY_READ(m_bit_stream->read_bit());
  189. frame_context.interpolation_filter = TRY(read_interpolation_filter());
  190. }
  191. }
  192. bool should_replace_probability_context = false;
  193. bool parallel_decoding_mode = true;
  194. if (!frame_context.error_resilient_mode) {
  195. should_replace_probability_context = TRY_READ(m_bit_stream->read_bit());
  196. parallel_decoding_mode = TRY_READ(m_bit_stream->read_bit());
  197. }
  198. u8 probability_context_index = TRY_READ(m_bit_stream->read_bits(2));
  199. switch (reset_frame_context) {
  200. case ResetProbabilities::All:
  201. setup_past_independence();
  202. for (auto i = 0; i < 4; i++) {
  203. m_probability_tables->save_probs(i);
  204. }
  205. probability_context_index = 0;
  206. break;
  207. case ResetProbabilities::OnlyCurrent:
  208. setup_past_independence();
  209. m_probability_tables->save_probs(probability_context_index);
  210. probability_context_index = 0;
  211. break;
  212. default:
  213. break;
  214. }
  215. frame_context.type = type;
  216. DECODER_TRY_ALLOC(frame_context.set_size(frame_size));
  217. frame_context.render_size = render_size;
  218. TRY(compute_image_size(frame_context));
  219. frame_context.reference_frames_to_update_flags = reference_frames_to_update_flags;
  220. frame_context.parallel_decoding_mode = parallel_decoding_mode;
  221. frame_context.should_replace_probability_context = should_replace_probability_context;
  222. frame_context.probability_context_index = probability_context_index;
  223. TRY(loop_filter_params(frame_context));
  224. TRY(quantization_params(frame_context));
  225. TRY(segmentation_params(frame_context));
  226. TRY(parse_tile_counts(frame_context));
  227. frame_context.header_size_in_bytes = TRY_READ(m_bit_stream->read_f16());
  228. return frame_context;
  229. }
  230. DecoderErrorOr<void> Parser::frame_sync_code()
  231. {
  232. if (TRY_READ(m_bit_stream->read_f8()) != 0x49)
  233. return DecoderError::corrupted("frame_sync_code: Byte 0 was not 0x49."sv);
  234. if (TRY_READ(m_bit_stream->read_f8()) != 0x83)
  235. return DecoderError::corrupted("frame_sync_code: Byte 1 was not 0x83."sv);
  236. if (TRY_READ(m_bit_stream->read_f8()) != 0x42)
  237. return DecoderError::corrupted("frame_sync_code: Byte 2 was not 0x42."sv);
  238. return {};
  239. }
  240. DecoderErrorOr<ColorConfig> Parser::parse_color_config(FrameContext const& frame_context)
  241. {
  242. // (6.2.2) color_config( )
  243. u8 bit_depth;
  244. if (frame_context.profile >= 2) {
  245. bit_depth = TRY_READ(m_bit_stream->read_bit()) ? 12 : 10;
  246. } else {
  247. bit_depth = 8;
  248. }
  249. auto color_space = static_cast<ColorSpace>(TRY_READ(m_bit_stream->read_bits(3)));
  250. VERIFY(color_space <= ColorSpace::RGB);
  251. ColorRange color_range;
  252. bool subsampling_x, subsampling_y;
  253. if (color_space != ColorSpace::RGB) {
  254. color_range = TRY(read_color_range());
  255. if (frame_context.profile == 1 || frame_context.profile == 3) {
  256. subsampling_x = TRY_READ(m_bit_stream->read_bit());
  257. subsampling_y = TRY_READ(m_bit_stream->read_bit());
  258. if (TRY_READ(m_bit_stream->read_bit()))
  259. return DecoderError::corrupted("color_config: Subsampling reserved zero was set"sv);
  260. } else {
  261. subsampling_x = true;
  262. subsampling_y = true;
  263. }
  264. } else {
  265. color_range = ColorRange::Full;
  266. if (frame_context.profile == 1 || frame_context.profile == 3) {
  267. subsampling_x = false;
  268. subsampling_y = false;
  269. if (TRY_READ(m_bit_stream->read_bit()))
  270. return DecoderError::corrupted("color_config: RGB reserved zero was set"sv);
  271. } else {
  272. // FIXME: Spec does not specify the subsampling value here. Is this an error or should we set a default?
  273. VERIFY_NOT_REACHED();
  274. }
  275. }
  276. return ColorConfig { bit_depth, color_space, color_range, subsampling_x, subsampling_y };
  277. }
  278. DecoderErrorOr<Gfx::Size<u32>> Parser::parse_frame_size()
  279. {
  280. return Gfx::Size<u32> { TRY_READ(m_bit_stream->read_f16()) + 1, TRY_READ(m_bit_stream->read_f16()) + 1 };
  281. }
  282. DecoderErrorOr<Gfx::Size<u32>> Parser::parse_render_size(Gfx::Size<u32> frame_size)
  283. {
  284. // FIXME: This function should save this bit as a value in the FrameContext. The bit can be
  285. // used in files where the pixel aspect ratio changes between samples in the video.
  286. // If the bit is set, the pixel aspect ratio should be recalculated, whereas if only
  287. // the frame size has changed and the render size is unadjusted, then the pixel aspect
  288. // ratio should be retained and the new render size determined based on that.
  289. // See the Firefox source code here:
  290. // https://searchfox.org/mozilla-central/source/dom/media/platforms/wrappers/MediaChangeMonitor.cpp#268-276
  291. if (!TRY_READ(m_bit_stream->read_bit()))
  292. return frame_size;
  293. return Gfx::Size<u32> { TRY_READ(m_bit_stream->read_f16()) + 1, TRY_READ(m_bit_stream->read_f16()) + 1 };
  294. }
  295. DecoderErrorOr<Gfx::Size<u32>> Parser::parse_frame_size_with_refs(Array<u8, 3> const& reference_indices)
  296. {
  297. Optional<Gfx::Size<u32>> size;
  298. for (auto frame_index : reference_indices) {
  299. if (TRY_READ(m_bit_stream->read_bit())) {
  300. size.emplace(m_ref_frame_size[frame_index]);
  301. break;
  302. }
  303. }
  304. if (size.has_value())
  305. return size.value();
  306. return TRY(parse_frame_size());
  307. }
  308. DecoderErrorOr<void> Parser::compute_image_size(FrameContext& frame_context)
  309. {
  310. // 7.2.6 Compute image size semantics
  311. // When compute_image_size is invoked, the following ordered steps occur:
  312. // 1. If this is the first time compute_image_size is invoked, or if either FrameWidth or FrameHeight have
  313. // changed in value compared to the previous time this function was invoked, then the segmentation map is
  314. // cleared to all zeros by setting SegmentId[ row ][ col ] equal to 0 for row = 0..MiRows-1 and col =
  315. // 0..MiCols-1.
  316. // FIXME: What does this mean? SegmentIds is scoped to one frame, so it will not contain values here. It's
  317. // also suspicious that spec refers to this as SegmentId rather than SegmentIds (plural). Is this
  318. // supposed to refer to PrevSegmentIds?
  319. bool first_invoke = m_is_first_compute_image_size_invoke;
  320. m_is_first_compute_image_size_invoke = false;
  321. bool same_size = m_previous_frame_size == frame_context.size();
  322. // 2. The variable UsePrevFrameMvs is set equal to 1 if all of the following conditions are true:
  323. // a. This is not the first time compute_image_size is invoked.
  324. // b. Both FrameWidth and FrameHeight have the same value compared to the previous time this function
  325. // was invoked.
  326. // c. show_frame was equal to 1 the previous time this function was invoked.
  327. // d. error_resilient_mode is equal to 0.
  328. // e. FrameIsIntra is equal to 0.
  329. // Otherwise, UsePrevFrameMvs is set equal to 0.
  330. frame_context.use_previous_frame_motion_vectors = !first_invoke && same_size && m_previous_show_frame && !frame_context.error_resilient_mode && frame_context.is_inter_predicted();
  331. return {};
  332. }
  333. DecoderErrorOr<InterpolationFilter> Parser::read_interpolation_filter()
  334. {
  335. if (TRY_READ(m_bit_stream->read_bit())) {
  336. return InterpolationFilter::Switchable;
  337. }
  338. return literal_to_type[TRY_READ(m_bit_stream->read_bits(2))];
  339. }
  340. DecoderErrorOr<void> Parser::loop_filter_params(FrameContext& frame_context)
  341. {
  342. frame_context.loop_filter_level = TRY_READ(m_bit_stream->read_bits(6));
  343. frame_context.loop_filter_sharpness = TRY_READ(m_bit_stream->read_bits(3));
  344. frame_context.loop_filter_delta_enabled = TRY_READ(m_bit_stream->read_bit());
  345. auto reference_deltas = m_previous_loop_filter_ref_deltas;
  346. auto mode_deltas = m_previous_loop_filter_mode_deltas;
  347. if (frame_context.loop_filter_delta_enabled && TRY_READ(m_bit_stream->read_bit())) {
  348. for (auto& loop_filter_ref_delta : reference_deltas) {
  349. if (TRY_READ(m_bit_stream->read_bit()))
  350. loop_filter_ref_delta = TRY_READ(m_bit_stream->read_s(6));
  351. }
  352. for (auto& loop_filter_mode_delta : mode_deltas) {
  353. if (TRY_READ(m_bit_stream->read_bit()))
  354. loop_filter_mode_delta = TRY_READ(m_bit_stream->read_s(6));
  355. }
  356. }
  357. frame_context.loop_filter_reference_deltas = reference_deltas;
  358. frame_context.loop_filter_mode_deltas = mode_deltas;
  359. return {};
  360. }
  361. DecoderErrorOr<void> Parser::quantization_params(FrameContext& frame_context)
  362. {
  363. frame_context.base_quantizer_index = TRY_READ(m_bit_stream->read_f8());
  364. frame_context.y_dc_quantizer_index_delta = TRY(read_delta_q());
  365. frame_context.uv_dc_quantizer_index_delta = TRY(read_delta_q());
  366. frame_context.uv_ac_quantizer_index_delta = TRY(read_delta_q());
  367. return {};
  368. }
  369. DecoderErrorOr<i8> Parser::read_delta_q()
  370. {
  371. if (TRY_READ(m_bit_stream->read_bit()))
  372. return TRY_READ(m_bit_stream->read_s(4));
  373. return 0;
  374. }
  375. DecoderErrorOr<void> Parser::segmentation_params(FrameContext& frame_context)
  376. {
  377. frame_context.segmentation_enabled = TRY_READ(m_bit_stream->read_bit());
  378. if (!frame_context.segmentation_enabled)
  379. return {};
  380. frame_context.should_use_absolute_segment_base_quantizer = m_previous_should_use_absolute_segment_base_quantizer;
  381. frame_context.segmentation_features = m_previous_segmentation_features;
  382. if (TRY_READ(m_bit_stream->read_bit())) {
  383. frame_context.use_full_segment_id_tree = true;
  384. for (auto& segmentation_tree_prob : frame_context.full_segment_id_tree_probabilities)
  385. segmentation_tree_prob = TRY(read_prob());
  386. if (TRY_READ(m_bit_stream->read_bit())) {
  387. frame_context.use_predicted_segment_id_tree = true;
  388. for (auto& segmentation_pred_prob : frame_context.predicted_segment_id_tree_probabilities)
  389. segmentation_pred_prob = TRY(read_prob());
  390. }
  391. }
  392. auto segmentation_update_data = (TRY_READ(m_bit_stream->read_bit()));
  393. if (!segmentation_update_data)
  394. return {};
  395. frame_context.should_use_absolute_segment_base_quantizer = TRY_READ(m_bit_stream->read_bit());
  396. for (auto i = 0; i < MAX_SEGMENTS; i++) {
  397. for (auto j = 0; j < SEG_LVL_MAX; j++) {
  398. auto& feature = frame_context.segmentation_features[i][j];
  399. feature.enabled = TRY_READ(m_bit_stream->read_bit());
  400. if (feature.enabled) {
  401. auto bits_to_read = segmentation_feature_bits[j];
  402. feature.value = TRY_READ(m_bit_stream->read_bits(bits_to_read));
  403. if (segmentation_feature_signed[j]) {
  404. if (TRY_READ(m_bit_stream->read_bit()))
  405. feature.value = -feature.value;
  406. }
  407. }
  408. }
  409. }
  410. return {};
  411. }
  412. DecoderErrorOr<u8> Parser::read_prob()
  413. {
  414. if (TRY_READ(m_bit_stream->read_bit()))
  415. return TRY_READ(m_bit_stream->read_f8());
  416. return 255;
  417. }
  418. static u16 calc_min_log2_of_tile_columns(u32 superblock_columns)
  419. {
  420. auto min_log_2 = 0u;
  421. while ((u32)(MAX_TILE_WIDTH_B64 << min_log_2) < superblock_columns)
  422. min_log_2++;
  423. return min_log_2;
  424. }
  425. static u16 calc_max_log2_tile_cols(u32 superblock_columns)
  426. {
  427. u16 max_log_2 = 1;
  428. while ((superblock_columns >> max_log_2) >= MIN_TILE_WIDTH_B64)
  429. max_log_2++;
  430. return max_log_2 - 1;
  431. }
  432. DecoderErrorOr<void> Parser::parse_tile_counts(FrameContext& frame_context)
  433. {
  434. auto superblock_columns = frame_context.superblock_columns();
  435. auto log2_of_tile_columns = calc_min_log2_of_tile_columns(superblock_columns);
  436. auto log2_of_tile_columns_maximum = calc_max_log2_tile_cols(superblock_columns);
  437. while (log2_of_tile_columns < log2_of_tile_columns_maximum) {
  438. if (TRY_READ(m_bit_stream->read_bit()))
  439. log2_of_tile_columns++;
  440. else
  441. break;
  442. }
  443. u16 log2_of_tile_rows = TRY_READ(m_bit_stream->read_bit());
  444. if (log2_of_tile_rows > 0) {
  445. log2_of_tile_rows += TRY_READ(m_bit_stream->read_bit());
  446. }
  447. frame_context.log2_of_tile_counts = Gfx::Size<u16>(log2_of_tile_columns, log2_of_tile_rows);
  448. return {};
  449. }
  450. void Parser::setup_past_independence()
  451. {
  452. m_previous_block_contexts.reset();
  453. m_previous_loop_filter_ref_deltas[ReferenceFrameType::None] = 1;
  454. m_previous_loop_filter_ref_deltas[ReferenceFrameType::LastFrame] = 0;
  455. m_previous_loop_filter_ref_deltas[ReferenceFrameType::GoldenFrame] = -1;
  456. m_previous_loop_filter_ref_deltas[ReferenceFrameType::AltRefFrame] = -1;
  457. m_previous_loop_filter_mode_deltas.fill(0);
  458. m_previous_should_use_absolute_segment_base_quantizer = false;
  459. for (auto& segment_levels : m_previous_segmentation_features)
  460. segment_levels.fill({ false, 0 });
  461. m_probability_tables->reset_probs();
  462. }
  463. DecoderErrorOr<void> Parser::compressed_header(FrameContext& frame_context)
  464. {
  465. frame_context.transform_mode = TRY(read_tx_mode(frame_context));
  466. if (frame_context.transform_mode == TransformMode::Select)
  467. TRY(tx_mode_probs());
  468. TRY(read_coef_probs(frame_context.transform_mode));
  469. TRY(read_skip_prob());
  470. if (frame_context.is_inter_predicted()) {
  471. TRY(read_inter_mode_probs());
  472. if (frame_context.interpolation_filter == Switchable)
  473. TRY(read_interp_filter_probs());
  474. TRY(read_is_inter_probs());
  475. TRY(frame_reference_mode(frame_context));
  476. TRY(frame_reference_mode_probs(frame_context));
  477. TRY(read_y_mode_probs());
  478. TRY(read_partition_probs());
  479. TRY(mv_probs(frame_context));
  480. }
  481. return {};
  482. }
  483. DecoderErrorOr<TransformMode> Parser::read_tx_mode(FrameContext const& frame_context)
  484. {
  485. if (frame_context.is_lossless()) {
  486. return TransformMode::Only_4x4;
  487. }
  488. auto tx_mode = TRY_READ(m_bit_stream->read_literal(2));
  489. if (tx_mode == to_underlying(TransformMode::Allow_32x32))
  490. tx_mode += TRY_READ(m_bit_stream->read_literal(1));
  491. return static_cast<TransformMode>(tx_mode);
  492. }
  493. DecoderErrorOr<void> Parser::tx_mode_probs()
  494. {
  495. auto& tx_probs = m_probability_tables->tx_probs();
  496. for (auto i = 0; i < TX_SIZE_CONTEXTS; i++) {
  497. for (auto j = 0; j < TX_SIZES - 3; j++)
  498. tx_probs[Transform_8x8][i][j] = TRY(diff_update_prob(tx_probs[Transform_8x8][i][j]));
  499. }
  500. for (auto i = 0; i < TX_SIZE_CONTEXTS; i++) {
  501. for (auto j = 0; j < TX_SIZES - 2; j++)
  502. tx_probs[Transform_16x16][i][j] = TRY(diff_update_prob(tx_probs[Transform_16x16][i][j]));
  503. }
  504. for (auto i = 0; i < TX_SIZE_CONTEXTS; i++) {
  505. for (auto j = 0; j < TX_SIZES - 1; j++)
  506. tx_probs[Transform_32x32][i][j] = TRY(diff_update_prob(tx_probs[Transform_32x32][i][j]));
  507. }
  508. return {};
  509. }
  510. DecoderErrorOr<u8> Parser::diff_update_prob(u8 prob)
  511. {
  512. auto update_prob = TRY_READ(m_bit_stream->read_bool(252));
  513. if (update_prob) {
  514. auto delta_prob = TRY(decode_term_subexp());
  515. prob = inv_remap_prob(delta_prob, prob);
  516. }
  517. return prob;
  518. }
  519. DecoderErrorOr<u8> Parser::decode_term_subexp()
  520. {
  521. if (TRY_READ(m_bit_stream->read_literal(1)) == 0)
  522. return TRY_READ(m_bit_stream->read_literal(4));
  523. if (TRY_READ(m_bit_stream->read_literal(1)) == 0)
  524. return TRY_READ(m_bit_stream->read_literal(4)) + 16;
  525. if (TRY_READ(m_bit_stream->read_literal(1)) == 0)
  526. return TRY_READ(m_bit_stream->read_literal(5)) + 32;
  527. auto v = TRY_READ(m_bit_stream->read_literal(7));
  528. if (v < 65)
  529. return v + 64;
  530. return (v << 1u) - 1 + TRY_READ(m_bit_stream->read_literal(1));
  531. }
  532. u8 Parser::inv_remap_prob(u8 delta_prob, u8 prob)
  533. {
  534. u8 m = prob - 1;
  535. auto v = inv_map_table[delta_prob];
  536. if ((m << 1u) <= 255)
  537. return 1 + inv_recenter_nonneg(v, m);
  538. return 255 - inv_recenter_nonneg(v, 254 - m);
  539. }
  540. u8 Parser::inv_recenter_nonneg(u8 v, u8 m)
  541. {
  542. if (v > 2 * m)
  543. return v;
  544. if (v & 1u)
  545. return m - ((v + 1u) >> 1u);
  546. return m + (v >> 1u);
  547. }
  548. DecoderErrorOr<void> Parser::read_coef_probs(TransformMode transform_mode)
  549. {
  550. auto max_tx_size = tx_mode_to_biggest_tx_size[to_underlying(transform_mode)];
  551. for (u8 transform_size = 0; transform_size <= max_tx_size; transform_size++) {
  552. auto update_probs = TRY_READ(m_bit_stream->read_literal(1));
  553. if (update_probs == 1) {
  554. for (auto i = 0; i < 2; i++) {
  555. for (auto j = 0; j < 2; j++) {
  556. for (auto k = 0; k < 6; k++) {
  557. auto max_l = (k == 0) ? 3 : 6;
  558. for (auto l = 0; l < max_l; l++) {
  559. for (auto m = 0; m < 3; m++) {
  560. auto& prob = m_probability_tables->coef_probs()[transform_size][i][j][k][l][m];
  561. prob = TRY(diff_update_prob(prob));
  562. }
  563. }
  564. }
  565. }
  566. }
  567. }
  568. }
  569. return {};
  570. }
  571. DecoderErrorOr<void> Parser::read_skip_prob()
  572. {
  573. for (auto i = 0; i < SKIP_CONTEXTS; i++)
  574. m_probability_tables->skip_prob()[i] = TRY(diff_update_prob(m_probability_tables->skip_prob()[i]));
  575. return {};
  576. }
  577. DecoderErrorOr<void> Parser::read_inter_mode_probs()
  578. {
  579. for (auto i = 0; i < INTER_MODE_CONTEXTS; i++) {
  580. for (auto j = 0; j < INTER_MODES - 1; j++)
  581. m_probability_tables->inter_mode_probs()[i][j] = TRY(diff_update_prob(m_probability_tables->inter_mode_probs()[i][j]));
  582. }
  583. return {};
  584. }
  585. DecoderErrorOr<void> Parser::read_interp_filter_probs()
  586. {
  587. for (auto i = 0; i < INTERP_FILTER_CONTEXTS; i++) {
  588. for (auto j = 0; j < SWITCHABLE_FILTERS - 1; j++)
  589. m_probability_tables->interp_filter_probs()[i][j] = TRY(diff_update_prob(m_probability_tables->interp_filter_probs()[i][j]));
  590. }
  591. return {};
  592. }
  593. DecoderErrorOr<void> Parser::read_is_inter_probs()
  594. {
  595. for (auto i = 0; i < IS_INTER_CONTEXTS; i++)
  596. m_probability_tables->is_inter_prob()[i] = TRY(diff_update_prob(m_probability_tables->is_inter_prob()[i]));
  597. return {};
  598. }
  599. static void setup_compound_reference_mode(FrameContext& frame_context)
  600. {
  601. ReferenceFrameType fixed_reference;
  602. ReferenceFramePair variable_references;
  603. if (frame_context.reference_frame_sign_biases[ReferenceFrameType::LastFrame] == frame_context.reference_frame_sign_biases[ReferenceFrameType::GoldenFrame]) {
  604. fixed_reference = ReferenceFrameType::AltRefFrame;
  605. variable_references = { ReferenceFrameType::LastFrame, ReferenceFrameType::GoldenFrame };
  606. } else if (frame_context.reference_frame_sign_biases[ReferenceFrameType::LastFrame] == frame_context.reference_frame_sign_biases[ReferenceFrameType::AltRefFrame]) {
  607. fixed_reference = ReferenceFrameType::GoldenFrame;
  608. variable_references = { ReferenceFrameType::LastFrame, ReferenceFrameType::AltRefFrame };
  609. } else {
  610. fixed_reference = ReferenceFrameType::LastFrame;
  611. variable_references = { ReferenceFrameType::GoldenFrame, ReferenceFrameType::AltRefFrame };
  612. }
  613. frame_context.fixed_reference_type = fixed_reference;
  614. frame_context.variable_reference_types = variable_references;
  615. }
  616. DecoderErrorOr<void> Parser::frame_reference_mode(FrameContext& frame_context)
  617. {
  618. auto compound_reference_allowed = false;
  619. for (size_t i = 2; i <= REFS_PER_FRAME; i++) {
  620. if (frame_context.reference_frame_sign_biases[i] != frame_context.reference_frame_sign_biases[1])
  621. compound_reference_allowed = true;
  622. }
  623. ReferenceMode reference_mode;
  624. if (compound_reference_allowed) {
  625. auto non_single_reference = TRY_READ(m_bit_stream->read_literal(1));
  626. if (non_single_reference == 0) {
  627. reference_mode = SingleReference;
  628. } else {
  629. auto reference_select = TRY_READ(m_bit_stream->read_literal(1));
  630. if (reference_select == 0)
  631. reference_mode = CompoundReference;
  632. else
  633. reference_mode = ReferenceModeSelect;
  634. }
  635. } else {
  636. reference_mode = SingleReference;
  637. }
  638. frame_context.reference_mode = reference_mode;
  639. if (reference_mode != SingleReference)
  640. setup_compound_reference_mode(frame_context);
  641. return {};
  642. }
  643. DecoderErrorOr<void> Parser::frame_reference_mode_probs(FrameContext const& frame_context)
  644. {
  645. if (frame_context.reference_mode == ReferenceModeSelect) {
  646. for (auto i = 0; i < COMP_MODE_CONTEXTS; i++) {
  647. auto& comp_mode_prob = m_probability_tables->comp_mode_prob();
  648. comp_mode_prob[i] = TRY(diff_update_prob(comp_mode_prob[i]));
  649. }
  650. }
  651. if (frame_context.reference_mode != CompoundReference) {
  652. for (auto i = 0; i < REF_CONTEXTS; i++) {
  653. auto& single_ref_prob = m_probability_tables->single_ref_prob();
  654. single_ref_prob[i][0] = TRY(diff_update_prob(single_ref_prob[i][0]));
  655. single_ref_prob[i][1] = TRY(diff_update_prob(single_ref_prob[i][1]));
  656. }
  657. }
  658. if (frame_context.reference_mode != SingleReference) {
  659. for (auto i = 0; i < REF_CONTEXTS; i++) {
  660. auto& comp_ref_prob = m_probability_tables->comp_ref_prob();
  661. comp_ref_prob[i] = TRY(diff_update_prob(comp_ref_prob[i]));
  662. }
  663. }
  664. return {};
  665. }
  666. DecoderErrorOr<void> Parser::read_y_mode_probs()
  667. {
  668. for (auto i = 0; i < BLOCK_SIZE_GROUPS; i++) {
  669. for (auto j = 0; j < INTRA_MODES - 1; j++) {
  670. auto& y_mode_probs = m_probability_tables->y_mode_probs();
  671. y_mode_probs[i][j] = TRY(diff_update_prob(y_mode_probs[i][j]));
  672. }
  673. }
  674. return {};
  675. }
  676. DecoderErrorOr<void> Parser::read_partition_probs()
  677. {
  678. for (auto i = 0; i < PARTITION_CONTEXTS; i++) {
  679. for (auto j = 0; j < PARTITION_TYPES - 1; j++) {
  680. auto& partition_probs = m_probability_tables->partition_probs();
  681. partition_probs[i][j] = TRY(diff_update_prob(partition_probs[i][j]));
  682. }
  683. }
  684. return {};
  685. }
  686. DecoderErrorOr<void> Parser::mv_probs(FrameContext const& frame_context)
  687. {
  688. for (auto j = 0; j < MV_JOINTS - 1; j++) {
  689. auto& mv_joint_probs = m_probability_tables->mv_joint_probs();
  690. mv_joint_probs[j] = TRY(update_mv_prob(mv_joint_probs[j]));
  691. }
  692. for (auto i = 0; i < 2; i++) {
  693. auto& mv_sign_prob = m_probability_tables->mv_sign_prob();
  694. mv_sign_prob[i] = TRY(update_mv_prob(mv_sign_prob[i]));
  695. for (auto j = 0; j < MV_CLASSES - 1; j++) {
  696. auto& mv_class_probs = m_probability_tables->mv_class_probs();
  697. mv_class_probs[i][j] = TRY(update_mv_prob(mv_class_probs[i][j]));
  698. }
  699. auto& mv_class0_bit_prob = m_probability_tables->mv_class0_bit_prob();
  700. mv_class0_bit_prob[i] = TRY(update_mv_prob(mv_class0_bit_prob[i]));
  701. for (auto j = 0; j < MV_OFFSET_BITS; j++) {
  702. auto& mv_bits_prob = m_probability_tables->mv_bits_prob();
  703. mv_bits_prob[i][j] = TRY(update_mv_prob(mv_bits_prob[i][j]));
  704. }
  705. }
  706. for (auto i = 0; i < 2; i++) {
  707. for (auto j = 0; j < CLASS0_SIZE; j++) {
  708. for (auto k = 0; k < MV_FR_SIZE - 1; k++) {
  709. auto& mv_class0_fr_probs = m_probability_tables->mv_class0_fr_probs();
  710. mv_class0_fr_probs[i][j][k] = TRY(update_mv_prob(mv_class0_fr_probs[i][j][k]));
  711. }
  712. }
  713. for (auto k = 0; k < MV_FR_SIZE - 1; k++) {
  714. auto& mv_fr_probs = m_probability_tables->mv_fr_probs();
  715. mv_fr_probs[i][k] = TRY(update_mv_prob(mv_fr_probs[i][k]));
  716. }
  717. }
  718. if (frame_context.high_precision_motion_vectors_allowed) {
  719. for (auto i = 0; i < 2; i++) {
  720. auto& mv_class0_hp_prob = m_probability_tables->mv_class0_hp_prob();
  721. auto& mv_hp_prob = m_probability_tables->mv_hp_prob();
  722. mv_class0_hp_prob[i] = TRY(update_mv_prob(mv_class0_hp_prob[i]));
  723. mv_hp_prob[i] = TRY(update_mv_prob(mv_hp_prob[i]));
  724. }
  725. }
  726. return {};
  727. }
  728. DecoderErrorOr<u8> Parser::update_mv_prob(u8 prob)
  729. {
  730. if (TRY_READ(m_bit_stream->read_bool(252))) {
  731. return (TRY_READ(m_bit_stream->read_literal(7)) << 1u) | 1u;
  732. }
  733. return prob;
  734. }
  735. DecoderErrorOr<void> Parser::decode_tiles(FrameContext& frame_context)
  736. {
  737. auto log2_dimensions = frame_context.log2_of_tile_counts;
  738. auto tile_cols = 1 << log2_dimensions.width();
  739. auto tile_rows = 1 << log2_dimensions.height();
  740. PartitionContext above_partition_context = DECODER_TRY_ALLOC(PartitionContext::try_create(superblocks_to_blocks(frame_context.superblock_columns())));
  741. NonZeroTokens above_non_zero_tokens = DECODER_TRY_ALLOC(create_non_zero_tokens(blocks_to_sub_blocks(frame_context.columns()), frame_context.color_config.subsampling_x));
  742. SegmentationPredictionContext above_segmentation_ids = DECODER_TRY_ALLOC(SegmentationPredictionContext::try_create(frame_context.columns()));
  743. // FIXME: To implement tiled decoding, we'll need to pre-parse the tile positions and sizes into a 2D vector of ReadonlyBytes,
  744. // then run through each column of tiles in top to bottom order afterward. Each column can be sent to a worker thread
  745. // for execution. Each worker thread will want to create a set of above contexts sized to its tile width, then provide
  746. // those to each tile as it decodes them.
  747. for (auto tile_row = 0; tile_row < tile_rows; tile_row++) {
  748. for (auto tile_col = 0; tile_col < tile_cols; tile_col++) {
  749. auto last_tile = (tile_row == tile_rows - 1) && (tile_col == tile_cols - 1);
  750. size_t tile_size;
  751. if (last_tile)
  752. tile_size = m_bit_stream->bytes_remaining();
  753. else
  754. tile_size = TRY_READ(m_bit_stream->read_bits(32));
  755. auto rows_start = get_tile_offset(tile_row, frame_context.rows(), log2_dimensions.height());
  756. auto rows_end = get_tile_offset(tile_row + 1, frame_context.rows(), log2_dimensions.height());
  757. auto columns_start = get_tile_offset(tile_col, frame_context.columns(), log2_dimensions.width());
  758. auto columns_end = get_tile_offset(tile_col + 1, frame_context.columns(), log2_dimensions.width());
  759. auto width = columns_end - columns_start;
  760. auto above_partition_context_for_tile = above_partition_context.span().slice(columns_start, superblocks_to_blocks(blocks_ceiled_to_superblocks(width)));
  761. auto above_non_zero_tokens_view = create_non_zero_tokens_view(above_non_zero_tokens, blocks_to_sub_blocks(columns_start), blocks_to_sub_blocks(columns_end - columns_start), frame_context.color_config.subsampling_x);
  762. auto above_segmentation_ids_for_tile = safe_slice(above_segmentation_ids.span(), columns_start, columns_end - columns_start);
  763. auto tile_context = DECODER_TRY_ALLOC(TileContext::try_create(frame_context, rows_start, rows_end, columns_start, columns_end, above_partition_context_for_tile, above_non_zero_tokens_view, above_segmentation_ids_for_tile));
  764. TRY_READ(m_bit_stream->init_bool(tile_size));
  765. TRY(decode_tile(tile_context));
  766. TRY_READ(m_bit_stream->exit_bool());
  767. }
  768. }
  769. return {};
  770. }
  771. u32 Parser::get_tile_offset(u32 tile_num, u32 mis, u32 tile_size_log2)
  772. {
  773. u32 super_blocks = (mis + 7) >> 3u;
  774. u32 offset = ((tile_num * super_blocks) >> tile_size_log2) << 3u;
  775. return min(offset, mis);
  776. }
  777. DecoderErrorOr<void> Parser::decode_tile(TileContext& tile_context)
  778. {
  779. for (auto row = tile_context.rows_start; row < tile_context.rows_end; row += 8) {
  780. clear_left_context(tile_context);
  781. for (auto col = tile_context.columns_start; col < tile_context.columns_end; col += 8) {
  782. TRY(decode_partition(tile_context, row, col, Block_64x64));
  783. }
  784. }
  785. return {};
  786. }
  787. void Parser::clear_left_context(TileContext& tile_context)
  788. {
  789. for (auto& context_for_plane : tile_context.left_non_zero_tokens)
  790. context_for_plane.fill_with(false);
  791. tile_context.left_segmentation_ids.fill_with(0);
  792. tile_context.left_partition_context.fill_with(0);
  793. }
  794. DecoderErrorOr<void> Parser::decode_partition(TileContext& tile_context, u32 row, u32 column, BlockSubsize subsize)
  795. {
  796. if (row >= tile_context.frame_context.rows() || column >= tile_context.frame_context.columns())
  797. return {};
  798. u8 num_8x8 = num_8x8_blocks_wide_lookup[subsize];
  799. auto half_block_8x8 = num_8x8 >> 1;
  800. bool has_rows = (row + half_block_8x8) < tile_context.frame_context.rows();
  801. bool has_cols = (column + half_block_8x8) < tile_context.frame_context.columns();
  802. u32 row_in_tile = row - tile_context.rows_start;
  803. u32 column_in_tile = column - tile_context.columns_start;
  804. auto partition = TRY_READ(TreeParser::parse_partition(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, has_rows, has_cols, subsize, num_8x8, tile_context.above_partition_context, tile_context.left_partition_context.span(), row_in_tile, column_in_tile, !tile_context.frame_context.is_inter_predicted()));
  805. auto child_subsize = subsize_lookup[partition][subsize];
  806. if (child_subsize < Block_8x8 || partition == PartitionNone) {
  807. TRY(decode_block(tile_context, row, column, child_subsize));
  808. } else if (partition == PartitionHorizontal) {
  809. TRY(decode_block(tile_context, row, column, child_subsize));
  810. if (has_rows)
  811. TRY(decode_block(tile_context, row + half_block_8x8, column, child_subsize));
  812. } else if (partition == PartitionVertical) {
  813. TRY(decode_block(tile_context, row, column, child_subsize));
  814. if (has_cols)
  815. TRY(decode_block(tile_context, row, column + half_block_8x8, child_subsize));
  816. } else {
  817. TRY(decode_partition(tile_context, row, column, child_subsize));
  818. TRY(decode_partition(tile_context, row, column + half_block_8x8, child_subsize));
  819. TRY(decode_partition(tile_context, row + half_block_8x8, column, child_subsize));
  820. TRY(decode_partition(tile_context, row + half_block_8x8, column + half_block_8x8, child_subsize));
  821. }
  822. if (subsize == Block_8x8 || partition != PartitionSplit) {
  823. auto above_context = 15 >> b_width_log2_lookup[child_subsize];
  824. auto left_context = 15 >> b_height_log2_lookup[child_subsize];
  825. for (size_t i = 0; i < num_8x8; i++) {
  826. tile_context.above_partition_context[column_in_tile + i] = above_context;
  827. tile_context.left_partition_context[row_in_tile + i] = left_context;
  828. }
  829. }
  830. return {};
  831. }
  832. size_t Parser::get_image_index(FrameContext const& frame_context, u32 row, u32 column) const
  833. {
  834. VERIFY(row < frame_context.rows() && column < frame_context.columns());
  835. return row * frame_context.columns() + column;
  836. }
  837. DecoderErrorOr<void> Parser::decode_block(TileContext& tile_context, u32 row, u32 column, BlockSubsize subsize)
  838. {
  839. auto above_context = row > 0 ? tile_context.frame_block_contexts().at(row - 1, column) : FrameBlockContext();
  840. auto left_context = column > tile_context.columns_start ? tile_context.frame_block_contexts().at(row, column - 1) : FrameBlockContext();
  841. auto block_context = BlockContext::create(tile_context, row, column, subsize);
  842. TRY(mode_info(block_context, above_context, left_context));
  843. auto had_residual_tokens = TRY(residual(block_context, above_context.is_available, left_context.is_available));
  844. if (block_context.is_inter_predicted() && subsize >= Block_8x8 && !had_residual_tokens)
  845. block_context.should_skip_residuals = true;
  846. for (size_t y = 0; y < block_context.contexts_view.height(); y++) {
  847. for (size_t x = 0; x < block_context.contexts_view.width(); x++) {
  848. auto sub_block_context = FrameBlockContext { true, block_context.should_skip_residuals, block_context.transform_size, block_context.y_prediction_mode(), block_context.sub_block_prediction_modes, block_context.interpolation_filter, block_context.reference_frame_types, block_context.sub_block_motion_vectors, block_context.segment_id };
  849. block_context.contexts_view.at(y, x) = sub_block_context;
  850. VERIFY(block_context.frame_block_contexts().at(row + y, column + x).transform_size == sub_block_context.transform_size);
  851. }
  852. }
  853. return {};
  854. }
  855. DecoderErrorOr<void> Parser::mode_info(BlockContext& block_context, FrameBlockContext above_context, FrameBlockContext left_context)
  856. {
  857. if (block_context.frame_context.is_inter_predicted())
  858. TRY(inter_frame_mode_info(block_context, above_context, left_context));
  859. else
  860. TRY(intra_frame_mode_info(block_context, above_context, left_context));
  861. return {};
  862. }
  863. DecoderErrorOr<void> Parser::intra_frame_mode_info(BlockContext& block_context, FrameBlockContext above_context, FrameBlockContext left_context)
  864. {
  865. block_context.reference_frame_types = { ReferenceFrameType::None, ReferenceFrameType::None };
  866. VERIFY(!block_context.is_inter_predicted());
  867. TRY(set_intra_segment_id(block_context));
  868. block_context.should_skip_residuals = TRY(read_should_skip_residuals(block_context, above_context, left_context));
  869. block_context.transform_size = TRY(read_tx_size(block_context, above_context, left_context, true));
  870. // FIXME: This if statement is also present in parse_default_intra_mode. The selection of parameters for
  871. // the probability table lookup should be inlined here.
  872. if (block_context.size >= Block_8x8) {
  873. auto mode = TRY_READ(TreeParser::parse_default_intra_mode(*m_bit_stream, *m_probability_tables, block_context.size, above_context, left_context, block_context.sub_block_prediction_modes, 0, 0));
  874. for (auto& block_sub_mode : block_context.sub_block_prediction_modes)
  875. block_sub_mode = mode;
  876. } else {
  877. auto size_in_sub_blocks = block_context.get_size_in_sub_blocks();
  878. for (auto idy = 0; idy < 2; idy += size_in_sub_blocks.height()) {
  879. for (auto idx = 0; idx < 2; idx += size_in_sub_blocks.width()) {
  880. auto sub_mode = TRY_READ(TreeParser::parse_default_intra_mode(*m_bit_stream, *m_probability_tables, block_context.size, above_context, left_context, block_context.sub_block_prediction_modes, idx, idy));
  881. for (auto y = 0; y < size_in_sub_blocks.height(); y++) {
  882. for (auto x = 0; x < size_in_sub_blocks.width(); x++) {
  883. auto index = (idy + y) * 2 + idx + x;
  884. block_context.sub_block_prediction_modes[index] = sub_mode;
  885. }
  886. }
  887. }
  888. }
  889. }
  890. block_context.uv_prediction_mode = TRY_READ(TreeParser::parse_default_uv_mode(*m_bit_stream, *m_probability_tables, block_context.y_prediction_mode()));
  891. return {};
  892. }
  893. DecoderErrorOr<void> Parser::set_intra_segment_id(BlockContext& block_context)
  894. {
  895. if (block_context.frame_context.segmentation_enabled && block_context.frame_context.use_full_segment_id_tree)
  896. block_context.segment_id = TRY_READ(TreeParser::parse_segment_id(*m_bit_stream, block_context.frame_context.full_segment_id_tree_probabilities));
  897. else
  898. block_context.segment_id = 0;
  899. return {};
  900. }
  901. DecoderErrorOr<bool> Parser::read_should_skip_residuals(BlockContext& block_context, FrameBlockContext above_context, FrameBlockContext left_context)
  902. {
  903. if (seg_feature_active(block_context, SEG_LVL_SKIP))
  904. return true;
  905. return TRY_READ(TreeParser::parse_skip(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, above_context, left_context));
  906. }
  907. bool Parser::seg_feature_active(BlockContext const& block_context, u8 feature)
  908. {
  909. return block_context.frame_context.segmentation_features[block_context.segment_id][feature].enabled;
  910. }
  911. DecoderErrorOr<TransformSize> Parser::read_tx_size(BlockContext& block_context, FrameBlockContext above_context, FrameBlockContext left_context, bool allow_select)
  912. {
  913. auto max_tx_size = max_txsize_lookup[block_context.size];
  914. if (allow_select && block_context.frame_context.transform_mode == TransformMode::Select && block_context.size >= Block_8x8)
  915. return (TRY_READ(TreeParser::parse_tx_size(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, max_tx_size, above_context, left_context)));
  916. return min(max_tx_size, tx_mode_to_biggest_tx_size[to_underlying(block_context.frame_context.transform_mode)]);
  917. }
  918. DecoderErrorOr<void> Parser::inter_frame_mode_info(BlockContext& block_context, FrameBlockContext above_context, FrameBlockContext left_context)
  919. {
  920. TRY(set_inter_segment_id(block_context));
  921. block_context.should_skip_residuals = TRY(read_should_skip_residuals(block_context, above_context, left_context));
  922. auto is_inter = TRY(read_is_inter(block_context, above_context, left_context));
  923. block_context.transform_size = TRY(read_tx_size(block_context, above_context, left_context, !block_context.should_skip_residuals || !is_inter));
  924. if (is_inter) {
  925. TRY(inter_block_mode_info(block_context, above_context, left_context));
  926. } else {
  927. TRY(intra_block_mode_info(block_context));
  928. }
  929. return {};
  930. }
  931. DecoderErrorOr<void> Parser::set_inter_segment_id(BlockContext& block_context)
  932. {
  933. if (!block_context.frame_context.segmentation_enabled) {
  934. block_context.segment_id = 0;
  935. return {};
  936. }
  937. auto predicted_segment_id = get_segment_id(block_context);
  938. if (!block_context.frame_context.use_full_segment_id_tree) {
  939. block_context.segment_id = predicted_segment_id;
  940. return {};
  941. }
  942. if (!block_context.frame_context.use_predicted_segment_id_tree) {
  943. block_context.segment_id = TRY_READ(TreeParser::parse_segment_id(*m_bit_stream, block_context.frame_context.full_segment_id_tree_probabilities));
  944. return {};
  945. }
  946. auto above_segmentation_id = block_context.tile_context.above_segmentation_ids[block_context.row - block_context.tile_context.rows_start];
  947. auto left_segmentation_id = block_context.tile_context.left_segmentation_ids[block_context.column - block_context.tile_context.columns_start];
  948. auto seg_id_predicted = TRY_READ(TreeParser::parse_segment_id_predicted(*m_bit_stream, block_context.frame_context.predicted_segment_id_tree_probabilities, above_segmentation_id, left_segmentation_id));
  949. if (seg_id_predicted)
  950. block_context.segment_id = predicted_segment_id;
  951. else
  952. block_context.segment_id = TRY_READ(TreeParser::parse_segment_id(*m_bit_stream, block_context.frame_context.full_segment_id_tree_probabilities));
  953. // (7.4.1) AboveSegPredContext[ i ] only needs to be set to 0 for i = 0..MiCols-1.
  954. // This is taken care of by the slicing in BlockContext.
  955. block_context.above_segmentation_ids.fill(seg_id_predicted);
  956. // (7.4.1) LeftSegPredContext[ i ] only needs to be set to 0 for i = 0..MiRows-1.
  957. // This is taken care of by the slicing in BlockContext.
  958. block_context.left_segmentation_ids.fill(seg_id_predicted);
  959. return {};
  960. }
  961. u8 Parser::get_segment_id(BlockContext const& block_context)
  962. {
  963. auto bw = num_8x8_blocks_wide_lookup[block_context.size];
  964. auto bh = num_8x8_blocks_high_lookup[block_context.size];
  965. auto xmis = min(block_context.frame_context.columns() - block_context.column, (u32)bw);
  966. auto ymis = min(block_context.frame_context.rows() - block_context.row, (u32)bh);
  967. u8 segment = 7;
  968. for (size_t y = 0; y < ymis; y++) {
  969. for (size_t x = 0; x < xmis; x++) {
  970. segment = min(segment, m_previous_block_contexts.index_at(block_context.row + y, block_context.column + x));
  971. }
  972. }
  973. return segment;
  974. }
  975. DecoderErrorOr<bool> Parser::read_is_inter(BlockContext& block_context, FrameBlockContext above_context, FrameBlockContext left_context)
  976. {
  977. if (seg_feature_active(block_context, SEG_LVL_REF_FRAME))
  978. return block_context.frame_context.segmentation_features[block_context.segment_id][SEG_LVL_REF_FRAME].value != ReferenceFrameType::None;
  979. return TRY_READ(TreeParser::parse_block_is_inter_predicted(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, above_context, left_context));
  980. }
  981. DecoderErrorOr<void> Parser::intra_block_mode_info(BlockContext& block_context)
  982. {
  983. block_context.reference_frame_types = { ReferenceFrameType::None, ReferenceFrameType::None };
  984. VERIFY(!block_context.is_inter_predicted());
  985. auto& sub_modes = block_context.sub_block_prediction_modes;
  986. if (block_context.size >= Block_8x8) {
  987. auto mode = TRY_READ(TreeParser::parse_intra_mode(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, block_context.size));
  988. for (auto& block_sub_mode : sub_modes)
  989. block_sub_mode = mode;
  990. } else {
  991. auto size_in_sub_blocks = block_context.get_size_in_sub_blocks();
  992. for (auto idy = 0; idy < 2; idy += size_in_sub_blocks.height()) {
  993. for (auto idx = 0; idx < 2; idx += size_in_sub_blocks.width()) {
  994. auto sub_intra_mode = TRY_READ(TreeParser::parse_sub_intra_mode(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter));
  995. for (auto y = 0; y < size_in_sub_blocks.height(); y++) {
  996. for (auto x = 0; x < size_in_sub_blocks.width(); x++)
  997. sub_modes[(idy + y) * 2 + idx + x] = sub_intra_mode;
  998. }
  999. }
  1000. }
  1001. }
  1002. block_context.uv_prediction_mode = TRY_READ(TreeParser::parse_uv_mode(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, block_context.y_prediction_mode()));
  1003. return {};
  1004. }
  1005. static void select_best_reference_motion_vectors(BlockContext& block_context, MotionVectorPair reference_motion_vectors, BlockMotionVectorCandidates& candidates, ReferenceIndex);
  1006. DecoderErrorOr<void> Parser::inter_block_mode_info(BlockContext& block_context, FrameBlockContext above_context, FrameBlockContext left_context)
  1007. {
  1008. TRY(read_ref_frames(block_context, above_context, left_context));
  1009. VERIFY(block_context.is_inter_predicted());
  1010. BlockMotionVectorCandidates motion_vector_candidates;
  1011. auto reference_motion_vectors = find_reference_motion_vectors(block_context, block_context.reference_frame_types.primary, -1);
  1012. select_best_reference_motion_vectors(block_context, reference_motion_vectors, motion_vector_candidates, ReferenceIndex::Primary);
  1013. if (block_context.is_compound()) {
  1014. auto reference_motion_vectors = find_reference_motion_vectors(block_context, block_context.reference_frame_types.secondary, -1);
  1015. select_best_reference_motion_vectors(block_context, reference_motion_vectors, motion_vector_candidates, ReferenceIndex::Secondary);
  1016. }
  1017. if (seg_feature_active(block_context, SEG_LVL_SKIP)) {
  1018. block_context.y_prediction_mode() = PredictionMode::ZeroMv;
  1019. } else if (block_context.size >= Block_8x8) {
  1020. block_context.y_prediction_mode() = TRY_READ(TreeParser::parse_inter_mode(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, block_context.mode_context[block_context.reference_frame_types.primary]));
  1021. }
  1022. if (block_context.frame_context.interpolation_filter == Switchable)
  1023. block_context.interpolation_filter = TRY_READ(TreeParser::parse_interpolation_filter(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, above_context, left_context));
  1024. else
  1025. block_context.interpolation_filter = block_context.frame_context.interpolation_filter;
  1026. if (block_context.size < Block_8x8) {
  1027. auto size_in_sub_blocks = block_context.get_size_in_sub_blocks();
  1028. for (auto idy = 0; idy < 2; idy += size_in_sub_blocks.height()) {
  1029. for (auto idx = 0; idx < 2; idx += size_in_sub_blocks.width()) {
  1030. block_context.y_prediction_mode() = TRY_READ(TreeParser::parse_inter_mode(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, block_context.mode_context[block_context.reference_frame_types.primary]));
  1031. if (block_context.y_prediction_mode() == PredictionMode::NearestMv || block_context.y_prediction_mode() == PredictionMode::NearMv) {
  1032. select_best_sub_block_reference_motion_vectors(block_context, motion_vector_candidates, idy * 2 + idx, ReferenceIndex::Primary);
  1033. if (block_context.is_compound())
  1034. select_best_sub_block_reference_motion_vectors(block_context, motion_vector_candidates, idy * 2 + idx, ReferenceIndex::Secondary);
  1035. }
  1036. auto new_motion_vector_pair = TRY(get_motion_vector(block_context, motion_vector_candidates));
  1037. for (auto y = 0; y < size_in_sub_blocks.height(); y++) {
  1038. for (auto x = 0; x < size_in_sub_blocks.width(); x++) {
  1039. auto sub_block_index = (idy + y) * 2 + idx + x;
  1040. block_context.sub_block_motion_vectors[sub_block_index] = new_motion_vector_pair;
  1041. }
  1042. }
  1043. }
  1044. }
  1045. return {};
  1046. }
  1047. auto new_motion_vector_pair = TRY(get_motion_vector(block_context, motion_vector_candidates));
  1048. for (auto block = 0; block < 4; block++)
  1049. block_context.sub_block_motion_vectors[block] = new_motion_vector_pair;
  1050. return {};
  1051. }
  1052. DecoderErrorOr<void> Parser::read_ref_frames(BlockContext& block_context, FrameBlockContext above_context, FrameBlockContext left_context)
  1053. {
  1054. if (seg_feature_active(block_context, SEG_LVL_REF_FRAME)) {
  1055. block_context.reference_frame_types = { static_cast<ReferenceFrameType>(block_context.frame_context.segmentation_features[block_context.segment_id][SEG_LVL_REF_FRAME].value), ReferenceFrameType::None };
  1056. return {};
  1057. }
  1058. ReferenceMode compound_mode = block_context.frame_context.reference_mode;
  1059. auto fixed_reference = block_context.frame_context.fixed_reference_type;
  1060. if (compound_mode == ReferenceModeSelect)
  1061. compound_mode = TRY_READ(TreeParser::parse_comp_mode(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, fixed_reference, above_context, left_context));
  1062. if (compound_mode == CompoundReference) {
  1063. auto variable_references = block_context.frame_context.variable_reference_types;
  1064. auto fixed_reference_index = ReferenceIndex::Primary;
  1065. auto variable_reference_index = ReferenceIndex::Secondary;
  1066. if (block_context.frame_context.reference_frame_sign_biases[fixed_reference])
  1067. swap(fixed_reference_index, variable_reference_index);
  1068. auto variable_reference_selection = TRY_READ(TreeParser::parse_comp_ref(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, fixed_reference, variable_references, variable_reference_index, above_context, left_context));
  1069. block_context.reference_frame_types[fixed_reference_index] = fixed_reference;
  1070. block_context.reference_frame_types[variable_reference_index] = variable_references[variable_reference_selection];
  1071. return {};
  1072. }
  1073. // FIXME: Maybe consolidate this into a tree. Context is different between part 1 and 2 but still, it would look nice here.
  1074. ReferenceFrameType primary_type = ReferenceFrameType::LastFrame;
  1075. auto single_ref_p1 = TRY_READ(TreeParser::parse_single_ref_part_1(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, above_context, left_context));
  1076. if (single_ref_p1) {
  1077. auto single_ref_p2 = TRY_READ(TreeParser::parse_single_ref_part_2(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, above_context, left_context));
  1078. primary_type = single_ref_p2 ? ReferenceFrameType::AltRefFrame : ReferenceFrameType::GoldenFrame;
  1079. }
  1080. block_context.reference_frame_types = { primary_type, ReferenceFrameType::None };
  1081. return {};
  1082. }
  1083. // assign_mv( isCompound ) in the spec.
  1084. DecoderErrorOr<MotionVectorPair> Parser::get_motion_vector(BlockContext const& block_context, BlockMotionVectorCandidates const& candidates)
  1085. {
  1086. MotionVectorPair result;
  1087. auto read_one = [&](ReferenceIndex index) -> DecoderErrorOr<void> {
  1088. switch (block_context.y_prediction_mode()) {
  1089. case PredictionMode::NewMv:
  1090. result[index] = TRY(read_motion_vector(block_context, candidates, index));
  1091. break;
  1092. case PredictionMode::NearestMv:
  1093. result[index] = candidates[index].nearest_vector;
  1094. break;
  1095. case PredictionMode::NearMv:
  1096. result[index] = candidates[index].near_vector;
  1097. break;
  1098. default:
  1099. result[index] = {};
  1100. break;
  1101. }
  1102. return {};
  1103. };
  1104. TRY(read_one(ReferenceIndex::Primary));
  1105. if (block_context.is_compound())
  1106. TRY(read_one(ReferenceIndex::Secondary));
  1107. return result;
  1108. }
  1109. // use_mv_hp( deltaMv ) in the spec.
  1110. static bool should_use_high_precision_motion_vector(MotionVector const& delta_vector)
  1111. {
  1112. return (abs(delta_vector.row()) >> 3) < COMPANDED_MVREF_THRESH && (abs(delta_vector.column()) >> 3) < COMPANDED_MVREF_THRESH;
  1113. }
  1114. // read_mv( ref ) in the spec.
  1115. DecoderErrorOr<MotionVector> Parser::read_motion_vector(BlockContext const& block_context, BlockMotionVectorCandidates const& candidates, ReferenceIndex reference_index)
  1116. {
  1117. auto use_high_precision = block_context.frame_context.high_precision_motion_vectors_allowed && should_use_high_precision_motion_vector(candidates[reference_index].best_vector);
  1118. MotionVector delta_vector;
  1119. auto joint = TRY_READ(TreeParser::parse_motion_vector_joint(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter));
  1120. if ((joint & MotionVectorNonZeroRow) != 0)
  1121. delta_vector.set_row(TRY(read_single_motion_vector_component(0, use_high_precision)));
  1122. if ((joint & MotionVectorNonZeroColumn) != 0)
  1123. delta_vector.set_column(TRY(read_single_motion_vector_component(1, use_high_precision)));
  1124. return candidates[reference_index].best_vector + delta_vector;
  1125. }
  1126. // read_mv_component( comp ) in the spec.
  1127. DecoderErrorOr<i32> Parser::read_single_motion_vector_component(u8 component, bool use_high_precision)
  1128. {
  1129. auto mv_sign = TRY_READ(TreeParser::parse_motion_vector_sign(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, component));
  1130. auto mv_class = TRY_READ(TreeParser::parse_motion_vector_class(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, component));
  1131. u32 magnitude;
  1132. if (mv_class == MvClass0) {
  1133. auto mv_class0_bit = TRY_READ(TreeParser::parse_motion_vector_class0_bit(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, component));
  1134. auto mv_class0_fr = TRY_READ(TreeParser::parse_motion_vector_class0_fr(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, component, mv_class0_bit));
  1135. auto mv_class0_hp = TRY_READ(TreeParser::parse_motion_vector_class0_hp(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, component, use_high_precision));
  1136. magnitude = ((mv_class0_bit << 3) | (mv_class0_fr << 1) | mv_class0_hp) + 1;
  1137. } else {
  1138. u32 bits = 0;
  1139. for (u8 i = 0; i < mv_class; i++) {
  1140. auto mv_bit = TRY_READ(TreeParser::parse_motion_vector_bit(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, component, i));
  1141. bits |= mv_bit << i;
  1142. }
  1143. magnitude = CLASS0_SIZE << (mv_class + 2);
  1144. auto mv_fr = TRY_READ(TreeParser::parse_motion_vector_fr(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, component));
  1145. auto mv_hp = TRY_READ(TreeParser::parse_motion_vector_hp(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, component, use_high_precision));
  1146. magnitude += ((bits << 3) | (mv_fr << 1) | mv_hp) + 1;
  1147. }
  1148. return (mv_sign ? -1 : 1) * static_cast<i32>(magnitude);
  1149. }
  1150. Gfx::Point<size_t> Parser::get_decoded_point_for_plane(FrameContext const& frame_context, u32 column, u32 row, u8 plane)
  1151. {
  1152. (void)frame_context;
  1153. if (plane == 0)
  1154. return { column * 8, row * 8 };
  1155. return { (column * 8) >> frame_context.color_config.subsampling_x, (row * 8) >> frame_context.color_config.subsampling_y };
  1156. }
  1157. Gfx::Size<size_t> Parser::get_decoded_size_for_plane(FrameContext const& frame_context, u8 plane)
  1158. {
  1159. auto point = get_decoded_point_for_plane(frame_context, frame_context.columns(), frame_context.rows(), plane);
  1160. return { point.x(), point.y() };
  1161. }
  1162. static TransformSize get_uv_transform_size(TransformSize transform_size, BlockSubsize size_for_plane)
  1163. {
  1164. return min(transform_size, max_txsize_lookup[size_for_plane]);
  1165. }
  1166. static TransformSet select_transform_type(BlockContext const& block_context, u8 plane, TransformSize transform_size, u32 block_index)
  1167. {
  1168. if (plane > 0 || transform_size == Transform_32x32)
  1169. return TransformSet { TransformType::DCT, TransformType::DCT };
  1170. if (transform_size == Transform_4x4) {
  1171. if (block_context.frame_context.is_lossless() || block_context.is_inter_predicted())
  1172. return TransformSet { TransformType::DCT, TransformType::DCT };
  1173. return mode_to_txfm_map[to_underlying(block_context.size < Block_8x8 ? block_context.sub_block_prediction_modes[block_index] : block_context.y_prediction_mode())];
  1174. }
  1175. return mode_to_txfm_map[to_underlying(block_context.y_prediction_mode())];
  1176. }
  1177. DecoderErrorOr<bool> Parser::residual(BlockContext& block_context, bool has_block_above, bool has_block_left)
  1178. {
  1179. bool block_had_non_zero_tokens = false;
  1180. Array<u8, 1024> token_cache;
  1181. for (u8 plane = 0; plane < 3; plane++) {
  1182. auto plane_subsampling_x = (plane > 0) ? block_context.frame_context.color_config.subsampling_x : false;
  1183. auto plane_subsampling_y = (plane > 0) ? block_context.frame_context.color_config.subsampling_y : false;
  1184. auto plane_size = get_subsampled_block_size(block_context.size, plane_subsampling_x, plane_subsampling_y);
  1185. auto transform_size = get_uv_transform_size(block_context.transform_size, plane_size);
  1186. auto transform_size_in_sub_blocks = transform_size_to_sub_blocks(transform_size);
  1187. auto block_size_in_sub_blocks = block_size_to_sub_blocks(plane_size);
  1188. auto base_x_in_pixels = (blocks_to_pixels(block_context.column)) >> plane_subsampling_x;
  1189. auto base_y_in_pixels = (blocks_to_pixels(block_context.row)) >> plane_subsampling_y;
  1190. if (block_context.is_inter_predicted()) {
  1191. if (block_context.size < Block_8x8) {
  1192. for (auto y = 0; y < block_size_in_sub_blocks.height(); y++) {
  1193. for (auto x = 0; x < block_size_in_sub_blocks.width(); x++) {
  1194. TRY(m_decoder.predict_inter(plane, block_context, base_x_in_pixels + sub_blocks_to_pixels(x), base_y_in_pixels + sub_blocks_to_pixels(y), sub_blocks_to_pixels(1), sub_blocks_to_pixels(1), (y * block_size_in_sub_blocks.width()) + x));
  1195. }
  1196. }
  1197. } else {
  1198. TRY(m_decoder.predict_inter(plane, block_context, base_x_in_pixels, base_y_in_pixels, sub_blocks_to_pixels(block_size_in_sub_blocks.width()), sub_blocks_to_pixels(block_size_in_sub_blocks.height()), 0));
  1199. }
  1200. }
  1201. auto frame_right_in_pixels = (blocks_to_pixels(block_context.frame_context.columns())) >> plane_subsampling_x;
  1202. auto frame_bottom_in_pixels = (blocks_to_pixels(block_context.frame_context.rows())) >> plane_subsampling_y;
  1203. auto sub_block_index = 0;
  1204. for (u32 y = 0; y < block_size_in_sub_blocks.height(); y += transform_size_in_sub_blocks) {
  1205. for (u32 x = 0; x < block_size_in_sub_blocks.width(); x += transform_size_in_sub_blocks) {
  1206. auto transform_x_in_px = base_x_in_pixels + sub_blocks_to_pixels(x);
  1207. auto transform_y_in_px = base_y_in_pixels + sub_blocks_to_pixels(y);
  1208. auto sub_block_had_non_zero_tokens = false;
  1209. if (transform_x_in_px < frame_right_in_pixels && transform_y_in_px < frame_bottom_in_pixels) {
  1210. if (!block_context.is_inter_predicted())
  1211. TRY(m_decoder.predict_intra(plane, block_context, transform_x_in_px, transform_y_in_px, has_block_left || x > 0, has_block_above || y > 0, (x + transform_size_in_sub_blocks) < block_size_in_sub_blocks.width(), transform_size, sub_block_index));
  1212. if (!block_context.should_skip_residuals) {
  1213. auto transform_set = select_transform_type(block_context, plane, transform_size, sub_block_index);
  1214. sub_block_had_non_zero_tokens = TRY(tokens(block_context, plane, x, y, transform_size, transform_set, token_cache));
  1215. block_had_non_zero_tokens = block_had_non_zero_tokens || sub_block_had_non_zero_tokens;
  1216. TRY(m_decoder.reconstruct(plane, block_context, transform_x_in_px, transform_y_in_px, transform_size, transform_set));
  1217. }
  1218. }
  1219. auto& above_sub_block_tokens = block_context.above_non_zero_tokens[plane];
  1220. auto transform_right_in_sub_blocks = min(x + transform_size_in_sub_blocks, above_sub_block_tokens.size());
  1221. for (size_t inside_x = x; inside_x < transform_right_in_sub_blocks; inside_x++)
  1222. above_sub_block_tokens[inside_x] = sub_block_had_non_zero_tokens;
  1223. auto& left_sub_block_context = block_context.left_non_zero_tokens[plane];
  1224. auto transform_bottom_in_sub_blocks = min(y + transform_size_in_sub_blocks, left_sub_block_context.size());
  1225. for (size_t inside_y = y; inside_y < transform_bottom_in_sub_blocks; inside_y++)
  1226. left_sub_block_context[inside_y] = sub_block_had_non_zero_tokens;
  1227. sub_block_index++;
  1228. }
  1229. }
  1230. }
  1231. return block_had_non_zero_tokens;
  1232. }
  1233. static u16 const* get_scan(TransformSize transform_size, TransformSet transform_set)
  1234. {
  1235. constexpr TransformSet adst_dct { TransformType::ADST, TransformType::DCT };
  1236. constexpr TransformSet dct_adst { TransformType::DCT, TransformType::ADST };
  1237. if (transform_size == Transform_4x4) {
  1238. if (transform_set == adst_dct)
  1239. return row_scan_4x4;
  1240. if (transform_set == dct_adst)
  1241. return col_scan_4x4;
  1242. return default_scan_4x4;
  1243. }
  1244. if (transform_size == Transform_8x8) {
  1245. if (transform_set == adst_dct)
  1246. return row_scan_8x8;
  1247. if (transform_set == dct_adst)
  1248. return col_scan_8x8;
  1249. return default_scan_8x8;
  1250. }
  1251. if (transform_size == Transform_16x16) {
  1252. if (transform_set == adst_dct)
  1253. return row_scan_16x16;
  1254. if (transform_set == dct_adst)
  1255. return col_scan_16x16;
  1256. return default_scan_16x16;
  1257. }
  1258. return default_scan_32x32;
  1259. }
  1260. DecoderErrorOr<bool> Parser::tokens(BlockContext& block_context, size_t plane, u32 sub_block_column, u32 sub_block_row, TransformSize transform_size, TransformSet transform_set, Array<u8, 1024> token_cache)
  1261. {
  1262. block_context.residual_tokens.fill(0);
  1263. auto const* scan = get_scan(transform_size, transform_set);
  1264. auto check_for_more_coefficients = true;
  1265. u16 coef_index = 0;
  1266. u16 transform_pixel_count = 16 << (transform_size << 1);
  1267. for (; coef_index < transform_pixel_count; coef_index++) {
  1268. auto band = (transform_size == Transform_4x4) ? coefband_4x4[coef_index] : coefband_8x8plus[coef_index];
  1269. auto token_position = scan[coef_index];
  1270. TokensContext tokens_context;
  1271. if (coef_index == 0)
  1272. tokens_context = TreeParser::get_context_for_first_token(block_context.above_non_zero_tokens, block_context.left_non_zero_tokens, transform_size, plane, sub_block_column, sub_block_row, block_context.is_inter_predicted(), band);
  1273. else
  1274. tokens_context = TreeParser::get_context_for_other_tokens(token_cache, transform_size, transform_set, plane, token_position, block_context.is_inter_predicted(), band);
  1275. if (check_for_more_coefficients && !TRY_READ(TreeParser::parse_more_coefficients(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, tokens_context)))
  1276. break;
  1277. auto token = TRY_READ(TreeParser::parse_token(*m_bit_stream, *m_probability_tables, *m_syntax_element_counter, tokens_context));
  1278. token_cache[token_position] = energy_class[token];
  1279. i32 coef;
  1280. if (token == ZeroToken) {
  1281. coef = 0;
  1282. check_for_more_coefficients = false;
  1283. } else {
  1284. coef = TRY(read_coef(block_context.frame_context.color_config.bit_depth, token));
  1285. check_for_more_coefficients = true;
  1286. }
  1287. block_context.residual_tokens[token_position] = coef;
  1288. }
  1289. return coef_index > 0;
  1290. }
  1291. DecoderErrorOr<i32> Parser::read_coef(u8 bit_depth, Token token)
  1292. {
  1293. auto cat = extra_bits[token][0];
  1294. auto num_extra = extra_bits[token][1];
  1295. i32 coef = extra_bits[token][2];
  1296. if (token == DctValCat6) {
  1297. for (size_t e = 0; e < (u8)(bit_depth - 8); e++) {
  1298. auto high_bit = TRY_READ(m_bit_stream->read_bool(255));
  1299. coef += high_bit << (5 + bit_depth - e);
  1300. }
  1301. }
  1302. for (size_t e = 0; e < num_extra; e++) {
  1303. auto coef_bit = TRY_READ(m_bit_stream->read_bool(cat_probs[cat][e]));
  1304. coef += coef_bit << (num_extra - 1 - e);
  1305. }
  1306. bool sign_bit = TRY_READ(m_bit_stream->read_literal(1));
  1307. coef = sign_bit ? -coef : coef;
  1308. return coef;
  1309. }
  1310. // is_inside( candidateR, candidateC ) in the spec.
  1311. static bool motion_vector_is_inside_tile(TileContext const& tile_context, MotionVector vector)
  1312. {
  1313. if (vector.row() < 0)
  1314. return false;
  1315. if (vector.column() < 0)
  1316. return false;
  1317. u32 row_positive = vector.row();
  1318. u32 column_positive = vector.column();
  1319. return row_positive < tile_context.frame_context.rows() && column_positive >= tile_context.columns_start && column_positive < tile_context.columns_end;
  1320. }
  1321. // add_mv_ref_list( refList ) in the spec.
  1322. static void add_motion_vector_to_list_deduped(MotionVector const& vector, Vector<MotionVector, 2>& list)
  1323. {
  1324. if (list.size() >= 2)
  1325. return;
  1326. if (list.size() == 1 && vector == list[0])
  1327. return;
  1328. list.append(vector);
  1329. }
  1330. // get_block_mv( candidateR, candidateC, refList, usePrev ) in the spec.
  1331. MotionVectorCandidate Parser::get_motion_vector_from_current_or_previous_frame(BlockContext const& block_context, MotionVector candidate_vector, ReferenceIndex reference_index, bool use_prev)
  1332. {
  1333. if (use_prev) {
  1334. auto const& prev_context = m_previous_block_contexts.at(candidate_vector.row(), candidate_vector.column());
  1335. return { prev_context.ref_frames[reference_index], prev_context.primary_motion_vector_pair[reference_index] };
  1336. }
  1337. auto const& current_context = block_context.frame_block_contexts().at(candidate_vector.row(), candidate_vector.column());
  1338. return { current_context.ref_frames[reference_index], current_context.primary_motion_vector_pair()[reference_index] };
  1339. }
  1340. // if_same_ref_frame_add_mv( candidateR, candidateC, refFrame, usePrev ) in the spec.
  1341. void Parser::add_motion_vector_if_reference_frame_type_is_same(BlockContext const& block_context, MotionVector candidate_vector, ReferenceFrameType ref_frame, Vector<MotionVector, 2>& list, bool use_prev)
  1342. {
  1343. for (auto i = 0u; i < 2; i++) {
  1344. auto candidate = get_motion_vector_from_current_or_previous_frame(block_context, candidate_vector, static_cast<ReferenceIndex>(i), use_prev);
  1345. if (candidate.type == ref_frame) {
  1346. add_motion_vector_to_list_deduped(candidate.vector, list);
  1347. return;
  1348. }
  1349. }
  1350. }
  1351. // scale_mv( refList, refFrame ) in the spec.
  1352. static void apply_sign_bias_to_motion_vector(FrameContext const& frame_context, MotionVectorCandidate& candidate, ReferenceFrameType ref_frame)
  1353. {
  1354. if (frame_context.reference_frame_sign_biases[candidate.type] != frame_context.reference_frame_sign_biases[ref_frame])
  1355. candidate.vector *= -1;
  1356. }
  1357. // if_diff_ref_frame_add_mv( candidateR, candidateC, refFrame, usePrev ) in the spec.
  1358. void Parser::add_motion_vector_if_reference_frame_type_is_different(BlockContext const& block_context, MotionVector candidate_vector, ReferenceFrameType ref_frame, Vector<MotionVector, 2>& list, bool use_prev)
  1359. {
  1360. auto first_candidate = get_motion_vector_from_current_or_previous_frame(block_context, candidate_vector, ReferenceIndex::Primary, use_prev);
  1361. if (first_candidate.type > ReferenceFrameType::None && first_candidate.type != ref_frame) {
  1362. apply_sign_bias_to_motion_vector(block_context.frame_context, first_candidate, ref_frame);
  1363. add_motion_vector_to_list_deduped(first_candidate.vector, list);
  1364. }
  1365. auto second_candidate = get_motion_vector_from_current_or_previous_frame(block_context, candidate_vector, ReferenceIndex::Secondary, use_prev);
  1366. auto mvs_are_same = first_candidate.vector == second_candidate.vector;
  1367. if (second_candidate.type > ReferenceFrameType::None && second_candidate.type != ref_frame && !mvs_are_same) {
  1368. apply_sign_bias_to_motion_vector(block_context.frame_context, second_candidate, ref_frame);
  1369. add_motion_vector_to_list_deduped(second_candidate.vector, list);
  1370. }
  1371. }
  1372. // This function handles both clamp_mv_row( mvec, border ) and clamp_mv_col( mvec, border ) in the spec.
  1373. static MotionVector clamp_motion_vector(BlockContext const& block_context, MotionVector vector, i32 border)
  1374. {
  1375. i32 blocks_high = num_8x8_blocks_high_lookup[block_context.size];
  1376. // Casts must be done here to prevent subtraction underflow from wrapping the values.
  1377. i32 mb_to_top_edge = -8 * (static_cast<i32>(block_context.row) * MI_SIZE);
  1378. i32 mb_to_bottom_edge = 8 * ((static_cast<i32>(block_context.frame_context.rows()) - blocks_high - static_cast<i32>(block_context.row)) * MI_SIZE);
  1379. i32 blocks_wide = num_8x8_blocks_wide_lookup[block_context.size];
  1380. i32 mb_to_left_edge = -8 * (static_cast<i32>(block_context.column) * MI_SIZE);
  1381. i32 mb_to_right_edge = 8 * ((static_cast<i32>(block_context.frame_context.columns()) - blocks_wide - static_cast<i32>(block_context.column)) * MI_SIZE);
  1382. return {
  1383. clip_3(mb_to_top_edge - border, mb_to_bottom_edge + border, vector.row()),
  1384. clip_3(mb_to_left_edge - border, mb_to_right_edge + border, vector.column())
  1385. };
  1386. }
  1387. // 6.5.1 Find MV refs syntax
  1388. // find_mv_refs( refFrame, block ) in the spec.
  1389. MotionVectorPair Parser::find_reference_motion_vectors(BlockContext& block_context, ReferenceFrameType reference_frame, i32 block)
  1390. {
  1391. bool different_ref_found = false;
  1392. u8 context_counter = 0;
  1393. Vector<MotionVector, 2> list;
  1394. MotionVector base_coordinates = MotionVector(block_context.row, block_context.column);
  1395. for (auto i = 0u; i < 2; i++) {
  1396. auto offset_vector = mv_ref_blocks[block_context.size][i];
  1397. auto candidate = base_coordinates + offset_vector;
  1398. if (motion_vector_is_inside_tile(block_context.tile_context, candidate)) {
  1399. different_ref_found = true;
  1400. auto context = block_context.frame_block_contexts().at(candidate.row(), candidate.column());
  1401. context_counter += mode_2_counter[to_underlying(context.y_mode)];
  1402. for (auto i = 0u; i < 2; i++) {
  1403. auto reference_index = static_cast<ReferenceIndex>(i);
  1404. if (context.ref_frames[reference_index] == reference_frame) {
  1405. // This section up until add_mv_ref_list() is defined in spec as get_sub_block_mv().
  1406. constexpr u8 idx_n_column_to_subblock[4][2] = {
  1407. { 1, 2 },
  1408. { 1, 3 },
  1409. { 3, 2 },
  1410. { 3, 3 }
  1411. };
  1412. auto index = block >= 0 ? idx_n_column_to_subblock[block][offset_vector.column() == 0] : 3;
  1413. add_motion_vector_to_list_deduped(context.sub_block_motion_vectors[index][reference_index], list);
  1414. break;
  1415. }
  1416. }
  1417. }
  1418. }
  1419. block_context.mode_context[reference_frame] = counter_to_context[context_counter];
  1420. for (auto i = 2u; i < MVREF_NEIGHBOURS; i++) {
  1421. MotionVector candidate = base_coordinates + mv_ref_blocks[block_context.size][i];
  1422. if (motion_vector_is_inside_tile(block_context.tile_context, candidate)) {
  1423. different_ref_found = true;
  1424. add_motion_vector_if_reference_frame_type_is_same(block_context, candidate, reference_frame, list, false);
  1425. }
  1426. }
  1427. if (block_context.frame_context.use_previous_frame_motion_vectors)
  1428. add_motion_vector_if_reference_frame_type_is_same(block_context, base_coordinates, reference_frame, list, true);
  1429. if (different_ref_found) {
  1430. for (auto i = 0u; i < MVREF_NEIGHBOURS; i++) {
  1431. MotionVector candidate = base_coordinates + mv_ref_blocks[block_context.size][i];
  1432. if (motion_vector_is_inside_tile(block_context.tile_context, candidate))
  1433. add_motion_vector_if_reference_frame_type_is_different(block_context, candidate, reference_frame, list, false);
  1434. }
  1435. }
  1436. if (block_context.frame_context.use_previous_frame_motion_vectors)
  1437. add_motion_vector_if_reference_frame_type_is_different(block_context, base_coordinates, reference_frame, list, true);
  1438. for (auto i = 0u; i < list.size(); i++) {
  1439. // clamp_mv_ref( i ) in the spec.
  1440. list[i] = clamp_motion_vector(block_context, list[i], MV_BORDER);
  1441. }
  1442. MotionVectorPair result;
  1443. for (auto i = 0u; i < list.size(); i++)
  1444. result[static_cast<ReferenceIndex>(i)] = list[i];
  1445. return result;
  1446. }
  1447. // find_best_ref_mvs( refList ) in the spec.
  1448. static void select_best_reference_motion_vectors(BlockContext& block_context, MotionVectorPair reference_motion_vectors, BlockMotionVectorCandidates& candidates, ReferenceIndex reference_index)
  1449. {
  1450. auto adjust_and_clamp_vector = [&](MotionVector& vector) {
  1451. auto delta_row = vector.row();
  1452. auto delta_column = vector.column();
  1453. if (!block_context.frame_context.high_precision_motion_vectors_allowed || !should_use_high_precision_motion_vector(vector)) {
  1454. if ((delta_row & 1) != 0)
  1455. delta_row += delta_row > 0 ? -1 : 1;
  1456. if ((delta_column & 1) != 0)
  1457. delta_column += delta_column > 0 ? -1 : 1;
  1458. }
  1459. vector = { delta_row, delta_column };
  1460. vector = clamp_motion_vector(block_context, vector, (BORDERINPIXELS - INTERP_EXTEND) << 3);
  1461. };
  1462. adjust_and_clamp_vector(reference_motion_vectors.primary);
  1463. adjust_and_clamp_vector(reference_motion_vectors.secondary);
  1464. candidates[reference_index].nearest_vector = reference_motion_vectors.primary;
  1465. candidates[reference_index].near_vector = reference_motion_vectors.secondary;
  1466. candidates[reference_index].best_vector = reference_motion_vectors.primary;
  1467. }
  1468. // append_sub8x8_mvs( block, refList ) in the spec.
  1469. void Parser::select_best_sub_block_reference_motion_vectors(BlockContext& block_context, BlockMotionVectorCandidates& candidates, i32 block, ReferenceIndex reference_index)
  1470. {
  1471. Array<MotionVector, 2> sub_8x8_mvs;
  1472. MotionVectorPair reference_motion_vectors = find_reference_motion_vectors(block_context, block_context.reference_frame_types[reference_index], block);
  1473. auto destination_index = 0;
  1474. if (block == 0) {
  1475. sub_8x8_mvs[destination_index++] = reference_motion_vectors.primary;
  1476. sub_8x8_mvs[destination_index++] = reference_motion_vectors.secondary;
  1477. } else if (block <= 2) {
  1478. sub_8x8_mvs[destination_index++] = block_context.sub_block_motion_vectors[0][reference_index];
  1479. } else {
  1480. sub_8x8_mvs[destination_index++] = block_context.sub_block_motion_vectors[2][reference_index];
  1481. for (auto index = 1; index >= 0 && destination_index < 2; index--) {
  1482. auto block_vector = block_context.sub_block_motion_vectors[index][reference_index];
  1483. if (block_vector != sub_8x8_mvs[0])
  1484. sub_8x8_mvs[destination_index++] = block_vector;
  1485. }
  1486. }
  1487. for (auto n = 0u; n < 2 && destination_index < 2; n++) {
  1488. auto ref_list_vector = reference_motion_vectors[static_cast<ReferenceIndex>(n)];
  1489. if (ref_list_vector != sub_8x8_mvs[0])
  1490. sub_8x8_mvs[destination_index++] = ref_list_vector;
  1491. }
  1492. if (destination_index < 2)
  1493. sub_8x8_mvs[destination_index++] = {};
  1494. candidates[reference_index].nearest_vector = sub_8x8_mvs[0];
  1495. candidates[reference_index].near_vector = sub_8x8_mvs[1];
  1496. }
  1497. }