factor/extra/io/binary/fast/fast.factor

83 lines
2.1 KiB
Factor
Raw Normal View History

! Copyright (C) 2011 Doug Coleman.
! See http://factorcode.org/license.txt for BSD license.
USING: alien.data combinators combinators.smart endian fry
io.binary kernel locals macros math math.ranges sequences
sequences.generalizations ;
QUALIFIED-WITH: alien.c-types c
RENAME: be> io.binary => slow-be>
RENAME: le> io.binary => slow-le>
RENAME: >be io.binary => >slow-be
RENAME: >le io.binary => >slow-le
IN: io.binary.fast
ERROR: bad-length bytes n ;
: check-length ( bytes n -- bytes n )
2dup [ length ] dip > [ bad-length ] when ; inline
<<
: be-range ( n -- range )
1 - 8 * 0 -8 <range> ; inline
: le-range ( n -- range )
1 - 8 * 0 swap 8 <range> ; inline
: reassemble-bytes ( range -- quot )
2012-07-16 22:38:49 -04:00
[ [ [ ] ] [ '[ _ shift ] ] if-zero ] map
'[ [ _ spread ] [ bitor ] reduce-outputs ] ; inline
MACRO: reassemble-be ( n -- quot ) be-range reassemble-bytes ;
MACRO: reassemble-le ( n -- quot ) le-range reassemble-bytes ;
>>
:: n-be> ( bytes n -- x )
bytes n check-length drop n firstn-unsafe n reassemble-be ; inline
:: n-le> ( bytes n -- x )
bytes n check-length drop n firstn-unsafe n reassemble-le ; inline
: 2be> ( bytes -- x ) 2 n-be> ;
: 4be> ( bytes -- x ) 4 n-be> ;
: 8be> ( bytes -- x ) 8 n-be> ;
: be> ( bytes -- x )
dup length {
{ 2 [ 2be> ] }
{ 4 [ 4be> ] }
{ 8 [ 8be> ] }
[ drop slow-be> ]
} case ;
: 2le> ( bytes -- x ) 2 n-le> ;
: 4le> ( bytes -- x ) 4 n-le> ;
: 8le> ( bytes -- x ) 8 n-le> ;
: le> ( bytes -- x )
dup length {
{ 2 [ 2le> ] }
{ 4 [ 4le> ] }
{ 8 [ 8le> ] }
[ drop slow-le> ]
} case ;
: >le ( x n -- bytes )
compute-native-endianness little-endian = [
{
{ 2 [ c:short <ref> ] }
{ 4 [ c:int <ref> ] }
{ 8 [ c:longlong <ref> ] }
[ >slow-le ]
} case
] [ >slow-le ] if ;
: >be ( x n -- bytes )
compute-native-endianness big-endian = [
{
{ 2 [ c:short <ref> ] }
{ 4 [ c:int <ref> ] }
{ 8 [ c:longlong <ref> ] }
[ >slow-be ]
} case
] [ >slow-be ] if ;