1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
/*
* // Copyright (c) Radzivon Bartoshyk 7/2026. All rights reserved.
* //
* // Redistribution and use in source and binary forms, with or without modification,
* // are permitted provided that the following conditions are met:
* //
* // 1. Redistributions of source code must retain the above copyright notice, this
* // list of conditions and the following disclaimer.
* //
* // 2. Redistributions in binary form must reproduce the above copyright notice,
* // this list of conditions and the following disclaimer in the documentation
* // and/or other materials provided with the distribution.
* //
* // 3. Neither the name of the copyright holder nor the names of its
* // contributors may be used to endorse or promote products derived from
* // this software without specific prior written permission.
* //
* // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* // DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* // SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* // CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* // OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
//! A plane/grid buffer that is either **owned** (a `Vec`, the normal serial
//! case) or a **shared aliasing view** (a raw pointer + length) into buffers
//! owned elsewhere. This lets the WPP wavefront hand each row-decoder mutable
//! views over the *same* picture planes without changing any of the decoder's
//! per-CTB methods: `Plane<T>` derefs to `[T]`, so `self.y[i]`, `self.y[a..b]`,
//! `self.y.get(i)`, `self.y.len()`, `self.y.iter()` and `copy_from_slice` all
//! work unchanged.
//!
//! # Safety contract for the `Shared` variant
//! Multiple `Shared` planes may alias one backing buffer **only** when the
//! wavefront guarantees the live `&mut` regions are disjoint at every instant.
//! The 2-CTB diagonal lag provides exactly that: at any moment, row `r` writes
//! CTB column `c` while row `r-1` is at least at column `c+2`, so their touched
//! pixels/grid cells never overlap. Reads of the row above (intra neighbors)
//! land in cells row `r-1` finished ≥2 CTBs ago, i.e. no longer being written.
//! Holding the pointer as `Send` is sound under this discipline; violating the
//! lag would be UB.
use ;
pub
// SAFETY: sending a `Shared` plane to a worker thread is sound because the
// wavefront's lag discipline keeps every thread's live `&mut` region disjoint
// (see module docs). `T: Send` ensures the elements themselves are movable.
unsafe