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 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274
// Copyright 2014-2016 bluss and ndarray developers.
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.
use std::ptr::NonNull;
use crate::dimension;
use crate::error::ShapeError;
use crate::extension::nonnull::nonnull_debug_checked_from_ptr;
use crate::imp_prelude::*;
use crate::{is_aligned, StrideShape};
/// Methods for read-only array views.
impl<'a, A, D> ArrayView<'a, A, D>
where
D: Dimension,
{
/// Create a read-only array view borrowing its data from a slice.
///
/// Checks whether `shape` are compatible with the slice's
/// length, returning an `Err` if not compatible.
///
/// ```
/// use ndarray::ArrayView;
/// use ndarray::arr3;
/// use ndarray::ShapeBuilder;
///
/// let s = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12];
/// let a = ArrayView::from_shape((2, 3, 2).strides((1, 4, 2)),
/// &s).unwrap();
///
/// assert!(
/// a == arr3(&[[[0, 2],
/// [4, 6],
/// [8, 10]],
/// [[1, 3],
/// [5, 7],
/// [9, 11]]])
/// );
/// assert!(a.strides() == &[1, 4, 2]);
/// ```
pub fn from_shape<Sh>(shape: Sh, xs: &'a [A]) -> Result<Self, ShapeError>
where
Sh: Into<StrideShape<D>>,
{
// eliminate the type parameter Sh as soon as possible
Self::from_shape_impl(shape.into(), xs)
}
fn from_shape_impl(shape: StrideShape<D>, xs: &'a [A]) -> Result<Self, ShapeError> {
let dim = shape.dim;
let strides = shape.strides;
if shape.custom {
dimension::can_index_slice(xs, &dim, &strides)?;
} else {
dimension::can_index_slice_not_custom::<A, _>(xs, &dim)?;
}
unsafe { Ok(Self::new_(xs.as_ptr(), dim, strides)) }
}
/// Create an `ArrayView<A, D>` from shape information and a raw pointer to
/// the elements.
///
/// # Safety
///
/// The caller is responsible for ensuring all of the following:
///
/// * The elements seen by moving `ptr` according to the shape and strides
/// must live at least as long as `'a` and must not be not mutably
/// aliased for the duration of `'a`.
///
/// * `ptr` must be non-null and aligned, and it must be safe to
/// [`.offset()`] `ptr` by zero.
///
/// * It must be safe to [`.offset()`] the pointer repeatedly along all
/// axes and calculate the `count`s for the `.offset()` calls without
/// overflow, even if the array is empty or the elements are zero-sized.
///
/// In other words,
///
/// * All possible pointers generated by moving along all axes must be in
/// bounds or one byte past the end of a single allocation with element
/// type `A`. The only exceptions are if the array is empty or the element
/// type is zero-sized. In these cases, `ptr` may be dangling, but it must
/// still be safe to [`.offset()`] the pointer along the axes.
///
/// * The offset in units of bytes between the least address and greatest
/// address by moving along all axes must not exceed `isize::MAX`. This
/// constraint prevents the computed offset, in bytes, from overflowing
/// `isize` regardless of the starting point due to past offsets.
///
/// * The offset in units of `A` between the least address and greatest
/// address by moving along all axes must not exceed `isize::MAX`. This
/// constraint prevents overflow when calculating the `count` parameter to
/// [`.offset()`] regardless of the starting point due to past offsets.
///
/// * The product of non-zero axis lengths must not exceed `isize::MAX`.
///
/// [`.offset()`]: https://doc.rust-lang.org/stable/std/primitive.pointer.html#method.offset
pub unsafe fn from_shape_ptr<Sh>(shape: Sh, ptr: *const A) -> Self
where
Sh: Into<StrideShape<D>>,
{
RawArrayView::from_shape_ptr(shape, ptr).deref_into_view()
}
}
/// Methods for read-write array views.
impl<'a, A, D> ArrayViewMut<'a, A, D>
where
D: Dimension,
{
/// Create a read-write array view borrowing its data from a slice.
///
/// Checks whether `dim` and `strides` are compatible with the slice's
/// length, returning an `Err` if not compatible.
///
/// ```
/// use ndarray::ArrayViewMut;
/// use ndarray::arr3;
/// use ndarray::ShapeBuilder;
///
/// let mut s = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12];
/// let mut a = ArrayViewMut::from_shape((2, 3, 2).strides((1, 4, 2)),
/// &mut s).unwrap();
///
/// a[[0, 0, 0]] = 1;
/// assert!(
/// a == arr3(&[[[1, 2],
/// [4, 6],
/// [8, 10]],
/// [[1, 3],
/// [5, 7],
/// [9, 11]]])
/// );
/// assert!(a.strides() == &[1, 4, 2]);
/// ```
pub fn from_shape<Sh>(shape: Sh, xs: &'a mut [A]) -> Result<Self, ShapeError>
where
Sh: Into<StrideShape<D>>,
{
// eliminate the type parameter Sh as soon as possible
Self::from_shape_impl(shape.into(), xs)
}
fn from_shape_impl(shape: StrideShape<D>, xs: &'a mut [A]) -> Result<Self, ShapeError> {
let dim = shape.dim;
let strides = shape.strides;
if shape.custom {
dimension::can_index_slice(xs, &dim, &strides)?;
} else {
dimension::can_index_slice_not_custom::<A, _>(xs, &dim)?;
}
unsafe { Ok(Self::new_(xs.as_mut_ptr(), dim, strides)) }
}
/// Create an `ArrayViewMut<A, D>` from shape information and a
/// raw pointer to the elements.
///
/// # Safety
///
/// The caller is responsible for ensuring all of the following:
///
/// * The elements seen by moving `ptr` according to the shape and strides
/// must live at least as long as `'a` and must not be aliased for the
/// duration of `'a`.
///
/// * `ptr` must be non-null and aligned, and it must be safe to
/// [`.offset()`] `ptr` by zero.
///
/// * It must be safe to [`.offset()`] the pointer repeatedly along all
/// axes and calculate the `count`s for the `.offset()` calls without
/// overflow, even if the array is empty or the elements are zero-sized.
///
/// In other words,
///
/// * All possible pointers generated by moving along all axes must be in
/// bounds or one byte past the end of a single allocation with element
/// type `A`. The only exceptions are if the array is empty or the element
/// type is zero-sized. In these cases, `ptr` may be dangling, but it must
/// still be safe to [`.offset()`] the pointer along the axes.
///
/// * The offset in units of bytes between the least address and greatest
/// address by moving along all axes must not exceed `isize::MAX`. This
/// constraint prevents the computed offset, in bytes, from overflowing
/// `isize` regardless of the starting point due to past offsets.
///
/// * The offset in units of `A` between the least address and greatest
/// address by moving along all axes must not exceed `isize::MAX`. This
/// constraint prevents overflow when calculating the `count` parameter to
/// [`.offset()`] regardless of the starting point due to past offsets.
///
/// * The product of non-zero axis lengths must not exceed `isize::MAX`.
///
/// [`.offset()`]: https://doc.rust-lang.org/stable/std/primitive.pointer.html#method.offset
pub unsafe fn from_shape_ptr<Sh>(shape: Sh, ptr: *mut A) -> Self
where
Sh: Into<StrideShape<D>>,
{
RawArrayViewMut::from_shape_ptr(shape, ptr).deref_into_view_mut()
}
/// Convert the view into an `ArrayViewMut<'b, A, D>` where `'b` is a lifetime
/// outlived by `'a'`.
pub fn reborrow<'b>(self) -> ArrayViewMut<'b, A, D>
where
'a: 'b,
{
unsafe { ArrayViewMut::new(self.ptr, self.dim, self.strides) }
}
}
/// Private array view methods
impl<'a, A, D> ArrayView<'a, A, D>
where
D: Dimension,
{
/// Create a new `ArrayView`
///
/// Unsafe because: `ptr` must be valid for the given dimension and strides.
#[inline(always)]
pub(crate) unsafe fn new(ptr: NonNull<A>, dim: D, strides: D) -> Self {
if cfg!(debug_assertions) {
assert!(is_aligned(ptr.as_ptr()), "The pointer must be aligned.");
dimension::max_abs_offset_check_overflow::<A, _>(&dim, &strides).unwrap();
}
ArrayView {
data: ViewRepr::new(),
ptr,
dim,
strides,
}
}
/// Unsafe because: `ptr` must be valid for the given dimension and strides.
#[inline]
pub(crate) unsafe fn new_(ptr: *const A, dim: D, strides: D) -> Self {
Self::new(nonnull_debug_checked_from_ptr(ptr as *mut A), dim, strides)
}
}
impl<'a, A, D> ArrayViewMut<'a, A, D>
where
D: Dimension,
{
/// Create a new `ArrayView`
///
/// Unsafe because: `ptr` must be valid for the given dimension and strides.
#[inline(always)]
pub(crate) unsafe fn new(ptr: NonNull<A>, dim: D, strides: D) -> Self {
if cfg!(debug_assertions) {
assert!(is_aligned(ptr.as_ptr()), "The pointer must be aligned.");
dimension::max_abs_offset_check_overflow::<A, _>(&dim, &strides).unwrap();
}
ArrayViewMut {
data: ViewRepr::new(),
ptr,
dim,
strides,
}
}
/// Create a new `ArrayView`
///
/// Unsafe because: `ptr` must be valid for the given dimension and strides.
#[inline(always)]
pub(crate) unsafe fn new_(ptr: *mut A, dim: D, strides: D) -> Self {
Self::new(nonnull_debug_checked_from_ptr(ptr), dim, strides)
}
}