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
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
|
//! This package contains just four macros, which enable the creation
//! of array references to portions of arrays or slices (or things
//! that can be sliced).
//!
//! # Examples
//!
//! Here is a simple example of slicing and dicing a slice into array
//! references with these macros. Here we implement a simple
//! little-endian conversion from bytes to `u16`, and demonstrate code
//! that uses `array_ref!` to extract an array reference from a larger
//! array. Note that the documentation for each macro also has an
//! example of its use.
//!
//! ```
//! #[macro_use]
//! extern crate arrayref;
//!
//! fn read_u16(bytes: &[u8; 2]) -> u16 {
//! bytes[0] as u16 + ((bytes[1] as u16) << 8)
//! }
//! // ...
//! # fn main() {
//! let data = [0,1,2,3,4,0,6,7,8,9];
//! assert_eq!(256, read_u16(array_ref![data,0,2]));
//! assert_eq!(4, read_u16(array_ref![data,4,2]));
//! # }
//! ```
#![deny(warnings)]
#![no_std]
#[cfg(test)]
#[macro_use]
extern crate std;
/// You can use `array_ref` to generate an array reference to a subset
/// of a sliceable bit of data (which could be an array, or a slice,
/// or a Vec).
///
/// **Panics** if the slice is out of bounds.
///
/// ```
/// #[macro_use]
/// extern crate arrayref;
///
/// fn read_u16(bytes: &[u8; 2]) -> u16 {
/// bytes[0] as u16 + ((bytes[1] as u16) << 8)
/// }
/// // ...
/// # fn main() {
/// let data = [0,1,2,3,4,0,6,7,8,9];
/// assert_eq!(256, read_u16(array_ref![data,0,2]));
/// assert_eq!(4, read_u16(array_ref![data,4,2]));
/// # }
/// ```
#[macro_export]
macro_rules! array_ref {
($arr:expr, $offset:expr, $len:expr) => {{
{
#[inline]
unsafe fn as_array<T>(slice: &[T]) -> &[T; $len] {
&*(slice.as_ptr() as *const [_; $len])
}
let offset = $offset;
let slice = & $arr[offset..offset + $len];
#[allow(unused_unsafe)]
unsafe {
as_array(slice)
}
}
}}
}
/// You can use `array_refs` to generate a series of array references
/// to an input array reference. The idea is if you want to break an
/// array into a series of contiguous and non-overlapping arrays.
/// `array_refs` is a bit funny in that it insists on slicing up the
/// *entire* array. This is intentional, as I find it handy to make
/// me ensure that my sub-arrays add up to the entire array. This
/// macro will *never* panic, since the sizes are all checked at
/// compile time.
///
/// Note that unlike `array_ref!`, `array_refs` *requires* that the
/// first argument be an array reference. The following arguments are
/// the lengths of each subarray you wish a reference to. The total
/// of these arguments *must* equal the size of the array itself.
///
/// ```
/// #[macro_use]
/// extern crate arrayref;
///
/// fn read_u16(bytes: &[u8; 2]) -> u16 {
/// bytes[0] as u16 + ((bytes[1] as u16) << 8)
/// }
/// // ...
/// # fn main() {
/// let data = [0,1,2,3,4,0,6,7];
/// let (a,b,c) = array_refs![&data,2,2,4];
/// assert_eq!(read_u16(a), 256);
/// assert_eq!(read_u16(b), 3*256+2);
/// assert_eq!(*c, [4,0,6,7]);
/// # }
/// ```
#[macro_export]
macro_rules! array_refs {
( $arr:expr, $( $pre:expr ),* ; .. ; $( $post:expr ),* ) => {{
{
use std::slice;
#[inline]
#[allow(unused_assignments)]
#[allow(eval_order_dependence)]
unsafe fn as_arrays<T>(a: &[T]) -> ( $( &[T; $pre], )* &[T], $( &[T; $post], )*) {
let min_len = $( $pre + )* $( $post + )* 0;
let var_len = a.len() - min_len;
assert!(a.len() >= min_len);
let mut p = a.as_ptr();
( $( {
let aref = & *(p as *const [T; $pre]);
p = p.offset($pre as isize);
aref
} ),* , {
let sl = slice::from_raw_parts(p as *const T, var_len);
p = p.offset(var_len as isize);
sl
}, $( {
let aref = & *(p as *const [T; $post]);
p = p.offset($post as isize);
aref
} ),*)
}
let input = $arr;
#[allow(unused_unsafe)]
unsafe {
as_arrays(input)
}
}
}};
( $arr:expr, $( $len:expr ),* ) => {{
{
#[inline]
#[allow(unused_assignments)]
#[allow(eval_order_dependence)]
unsafe fn as_arrays<T>(a: &[T; $( $len + )* 0 ]) -> ( $( &[T; $len], )* ) {
let mut p = a.as_ptr();
( $( {
let aref = &*(p as *const [T; $len]);
p = p.offset($len as isize);
aref
} ),* )
}
let input = $arr;
#[allow(unused_unsafe)]
unsafe {
as_arrays(input)
}
}
}}
}
/// You can use `mut_array_refs` to generate a series of mutable array
/// references to an input mutable array reference. The idea is if
/// you want to break an array into a series of contiguous and
/// non-overlapping mutable array references. Like `array_refs!`,
/// `mut_array_refs!` is a bit funny in that it insists on slicing up
/// the *entire* array. This is intentional, as I find it handy to
/// make me ensure that my sub-arrays add up to the entire array.
/// This macro will *never* panic, since the sizes are all checked at
/// compile time.
///
/// Note that unlike `array_mut_ref!`, `mut_array_refs` *requires*
/// that the first argument be a mutable array reference. The
/// following arguments are the lengths of each subarray you wish a
/// reference to. The total of these arguments *must* equal the size
/// of the array itself. Also note that this macro allows you to take
/// out multiple mutable references to a single object, which is both
/// weird and powerful.
///
/// ```
/// #[macro_use]
/// extern crate arrayref;
///
/// fn write_u16(bytes: &mut [u8; 2], num: u16) {
/// bytes[0] = num as u8;
/// bytes[1] = (num >> 8) as u8;
/// }
/// fn write_u32(bytes: &mut [u8; 4], num: u32) {
/// bytes[0] = num as u8;
/// bytes[1] = (num >> 8) as u8; // this is buggy to save space...
/// }
/// // ...
/// # fn main() {
/// let mut data = [0,1,2,3,4,0,6,7];
/// let (a,b,c) = mut_array_refs![&mut data,2,2,4];
/// // let's write out some nice prime numbers!
/// write_u16(a, 37);
/// write_u16(b, 73);
/// write_u32(c, 137); // approximate inverse of the fine structure constant!
/// # }
/// ```
#[macro_export]
macro_rules! mut_array_refs {
( $arr:expr, $( $pre:expr ),* ; .. ; $( $post:expr ),* ) => {{
{
use std::slice;
#[inline]
#[allow(unused_assignments)]
#[allow(eval_order_dependence)]
unsafe fn as_arrays<T>(a: &mut [T]) -> ( $( &mut [T; $pre], )* &mut [T], $( &mut [T; $post], )*) {
let min_len = $( $pre + )* $( $post + )* 0;
let var_len = a.len() - min_len;
assert!(a.len() >= min_len);
let mut p = a.as_mut_ptr();
( $( {
let aref = &mut *(p as *mut [T; $pre]);
p = p.offset($pre as isize);
aref
} ),* , {
let sl = slice::from_raw_parts_mut(p as *mut T, var_len);
p = p.offset(var_len as isize);
sl
}, $( {
let aref = &mut *(p as *mut [T; $post]);
p = p.offset($post as isize);
aref
} ),*)
}
let input = $arr;
#[allow(unused_unsafe)]
unsafe {
as_arrays(input)
}
}
}};
( $arr:expr, $( $len:expr ),* ) => {{
{
#[inline]
#[allow(unused_assignments)]
#[allow(eval_order_dependence)]
unsafe fn as_arrays<T>(a: &mut [T; $( $len + )* 0 ]) -> ( $( &mut [T; $len], )* ) {
let mut p = a.as_mut_ptr();
( $( {
let aref = &mut *(p as *mut [T; $len]);
p = p.offset($len as isize);
aref
} ),* )
}
let input = $arr;
#[allow(unused_unsafe)]
unsafe {
as_arrays(input)
}
}
}};
}
/// You can use `array_mut_ref` to generate a mutable array reference
/// to a subset of a sliceable bit of data (which could be an array,
/// or a slice, or a Vec).
///
/// **Panics** if the slice is out of bounds.
///
/// ```
/// #[macro_use]
/// extern crate arrayref;
///
/// fn write_u16(bytes: &mut [u8; 2], num: u16) {
/// bytes[0] = num as u8;
/// bytes[1] = (num >> 8) as u8;
/// }
/// // ...
/// # fn main() {
/// let mut data = [0,1,2,3,4,0,6,7,8,9];
/// write_u16(array_mut_ref![data,0,2], 1);
/// write_u16(array_mut_ref![data,2,2], 5);
/// assert_eq!(*array_ref![data,0,4], [1,0,5,0]);
/// *array_mut_ref![data,4,5] = [4,3,2,1,0];
/// assert_eq!(data, [1,0,5,0,4,3,2,1,0,9]);
/// # }
/// ```
#[macro_export]
macro_rules! array_mut_ref {
($arr:expr, $offset:expr, $len:expr) => {{
{
#[inline]
unsafe fn as_array<T>(slice: &mut [T]) -> &mut [T; $len] {
&mut *(slice.as_mut_ptr() as *mut [_; $len])
}
let offset = $offset;
let slice = &mut $arr[offset..offset + $len];
#[allow(unused_unsafe)]
unsafe {
as_array(slice)
}
}
}}
}
#[cfg(test)]
mod test {
extern crate quickcheck;
use std::vec::Vec;
// use super::*;
#[test]
#[should_panic]
fn checks_bounds() {
let foo: [u8; 11] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
let bar = array_ref!(foo, 1, 11);
println!("I am checking that I can dereference bar[0] = {}", bar[0]);
}
#[test]
fn simple_case_works() {
fn check(expected: [u8; 3], actual: &[u8; 3]) {
for (e, a) in (&expected).iter().zip(actual.iter()) {
assert_eq!(e, a)
}
}
let mut foo: [u8; 11] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
{
let bar = array_ref!(foo, 2, 3);
check([2, 3, 4], bar);
}
check([0, 1, 2], array_ref!(foo, 0, 3));
fn zero2(x: &mut [u8; 2]) {
x[0] = 0;
x[1] = 0;
}
zero2(array_mut_ref!(foo, 8, 2));
check([0, 0, 10], array_ref!(foo, 8, 3));
}
#[test]
fn check_array_ref_5() {
fn f(data: Vec<u8>, offset: usize) -> quickcheck::TestResult {
if data.len() < offset + 5 {
return quickcheck::TestResult::discard();
}
let out = array_ref!(data, offset, 5);
quickcheck::TestResult::from_bool(out.len() == 5)
}
quickcheck::quickcheck(f as fn(Vec<u8>, usize) -> quickcheck::TestResult);
}
#[test]
fn check_array_ref_out_of_bounds_5() {
fn f(data: Vec<u8>, offset: usize) -> quickcheck::TestResult {
if data.len() >= offset + 5 {
return quickcheck::TestResult::discard();
}
quickcheck::TestResult::must_fail(move || {
array_ref!(data, offset, 5);
})
}
quickcheck::quickcheck(f as fn(Vec<u8>, usize) -> quickcheck::TestResult);
}
#[test]
fn check_array_mut_ref_7() {
fn f(mut data: Vec<u8>, offset: usize) -> quickcheck::TestResult {
if data.len() < offset + 7 {
return quickcheck::TestResult::discard();
}
let out = array_mut_ref!(data, offset, 7);
out[6] = 3;
quickcheck::TestResult::from_bool(out.len() == 7)
}
quickcheck::quickcheck(f as fn(Vec<u8>, usize) -> quickcheck::TestResult);
}
#[test]
fn check_array_mut_ref_out_of_bounds_32() {
fn f(mut data: Vec<u8>, offset: usize) -> quickcheck::TestResult {
if data.len() >= offset + 32 {
return quickcheck::TestResult::discard();
}
quickcheck::TestResult::must_fail(move || {
array_mut_ref!(data, offset, 32);
})
}
quickcheck::quickcheck(f as fn(Vec<u8>, usize) -> quickcheck::TestResult);
}
#[test]
fn test_5_array_refs() {
let mut data: [usize; 128] = [0; 128];
for i in 0..128 {
data[i] = i;
}
let data = data;
let (a,b,c,d,e) = array_refs!(&data, 1, 14, 3, 100, 10);
assert_eq!(a.len(), 1 as usize);
assert_eq!(b.len(), 14 as usize);
assert_eq!(c.len(), 3 as usize);
assert_eq!(d.len(), 100 as usize);
assert_eq!(e.len(), 10 as usize);
assert_eq!(a, array_ref![data, 0, 1]);
assert_eq!(b, array_ref![data, 1, 14]);
assert_eq!(c, array_ref![data, 15, 3]);
assert_eq!(e, array_ref![data, 118, 10]);
}
#[test]
fn test_5_array_refs_dotdot() {
let mut data: [usize; 128] = [0; 128];
for i in 0..128 {
data[i] = i;
}
let data = data;
let (a,b,c,d,e) = array_refs!(&data, 1, 14, 3; ..; 10);
assert_eq!(a.len(), 1 as usize);
assert_eq!(b.len(), 14 as usize);
assert_eq!(c.len(), 3 as usize);
assert_eq!(d.len(), 100 as usize);
assert_eq!(e.len(), 10 as usize);
assert_eq!(a, array_ref![data, 0, 1]);
assert_eq!(b, array_ref![data, 1, 14]);
assert_eq!(c, array_ref![data, 15, 3]);
assert_eq!(e, array_ref![data, 118, 10]);
}
#[test]
fn test_5_mut_xarray_refs() {
let mut data: [usize; 128] = [0; 128];
{
// temporarily borrow the data to modify it.
let (a,b,c,d,e) = mut_array_refs!(&mut data, 1, 14, 3, 100, 10);
assert_eq!(a.len(), 1 as usize);
assert_eq!(b.len(), 14 as usize);
assert_eq!(c.len(), 3 as usize);
assert_eq!(d.len(), 100 as usize);
assert_eq!(e.len(), 10 as usize);
*a = [1; 1];
*b = [14; 14];
*c = [3; 3];
*d = [100; 100];
*e = [10; 10];
}
assert_eq!(&[1;1], array_ref![data, 0, 1]);
assert_eq!(&[14;14], array_ref![data, 1, 14]);
assert_eq!(&[3;3], array_ref![data, 15, 3]);
assert_eq!(&[10;10], array_ref![data, 118, 10]);
}
#[test]
fn test_5_mut_xarray_refs_with_dotdot() {
let mut data: [usize; 128] = [0; 128];
{
// temporarily borrow the data to modify it.
let (a,b,c,d,e) = mut_array_refs!(&mut data, 1, 14, 3; ..; 10);
assert_eq!(a.len(), 1 as usize);
assert_eq!(b.len(), 14 as usize);
assert_eq!(c.len(), 3 as usize);
assert_eq!(d.len(), 100 as usize);
assert_eq!(e.len(), 10 as usize);
*a = [1; 1];
*b = [14; 14];
*c = [3; 3];
*e = [10; 10];
}
assert_eq!(&[1;1], array_ref![data, 0, 1]);
assert_eq!(&[14;14], array_ref![data, 1, 14]);
assert_eq!(&[3;3], array_ref![data, 15, 3]);
assert_eq!(&[10;10], array_ref![data, 118, 10]);
}
} // mod test
|