1 ! Copyright (C) 2008, 2009 Slava Pestov.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors alien alien.c-types alien.data alien.parser
4 assocs byte-arrays classes compiler.units functors kernel lexer
5 libc math math.vectors math.vectors.private namespaces
6 parser prettyprint.custom sequences sequences.private strings
7 summary vocabs vocabs.loader vocabs.parser vocabs.generated
8 words fry combinators make ;
11 MIXIN: specialized-array
13 INSTANCE: specialized-array sequence
15 GENERIC: direct-array-syntax ( obj -- word )
17 ERROR: bad-byte-array-length byte-array type ;
19 M: bad-byte-array-length summary
20 drop "Byte array length doesn't divide type width" ;
22 : (underlying) ( n c-type -- array )
23 heap-size * (byte-array) ; inline
25 : <underlying> ( n type -- array )
26 heap-size * <byte-array> ; inline
30 FUNCTOR: define-array ( T -- )
32 A DEFINES-CLASS ${T}-array
33 S DEFINES-CLASS ${T}-sequence
36 <direct-A> DEFINES <direct-${A}>
37 malloc-A DEFINES malloc-${A}
39 byte-array>A DEFINES byte-array>${A}
44 NTH [ T dup c-type-getter-boxer array-accessor ]
45 SET-NTH [ T dup c-setter array-accessor ]
52 { underlying c-ptr read-only }
53 { length array-capacity read-only } ;
55 : <direct-A> ( alien len -- specialized-array ) A boa ; inline
57 : <A> ( n -- specialized-array )
58 [ \ T <underlying> ] keep <direct-A> ; inline
60 : (A) ( n -- specialized-array )
61 [ \ T (underlying) ] keep <direct-A> ; inline
63 : malloc-A ( len -- specialized-array )
64 [ \ T heap-size calloc ] keep <direct-A> ; inline
66 : byte-array>A ( byte-array -- specialized-array )
67 >c-ptr dup length \ T heap-size /mod 0 =
68 [ drop \ T bad-byte-array-length ] unless
71 M: A clone [ underlying>> clone ] [ length>> ] bi <direct-A> ; inline
73 M: A length length>> ; inline
75 M: A nth-unsafe underlying>> NTH call ; inline
77 M: A set-nth-unsafe underlying>> SET-NTH call ; inline
79 : >A ( seq -- specialized-array ) A new clone-like ;
81 M: A like drop dup A instance? [ >A ] unless ; inline
83 M: A new-sequence drop (A) ; inline
85 M: A equal? over A instance? [ sequence= ] [ 2drop f ] if ;
89 [ \ T heap-size * ] [ underlying>> ] bi*
94 M: A byte-length length \ T heap-size * ; inline
96 M: A direct-array-syntax drop \ A@ ;
98 M: A pprint-delims drop \ A{ \ } ;
100 M: A >pprint-sequence ;
102 SYNTAX: A{ \ } [ >A ] parse-literal ;
103 SYNTAX: A@ scan-object scan-object <direct-A> suffix! ;
105 INSTANCE: A specialized-array
107 M: A vs+ [ + \ T c-type-clamp ] 2map ;
108 M: A vs- [ - \ T c-type-clamp ] 2map ;
109 M: A vs* [ * \ T c-type-clamp ] 2map ;
113 GENERIC: (underlying-type) ( c-type -- c-type' )
115 M: string (underlying-type) c-types get at ;
116 M: word (underlying-type) "c-type" word-prop ;
118 : underlying-type ( c-type -- c-type' )
119 dup (underlying-type) {
120 { [ dup not ] [ drop no-c-type ] }
121 { [ dup c-type-name? ] [ nip underlying-type ] }
125 : specialized-array-vocab ( c-type -- vocab )
127 "specialized-arrays.instances." %
128 [ vocabulary>> % "." % ]
135 : define-array-vocab ( type -- vocab )
137 [ specialized-array-vocab ] [ '[ _ define-array ] ] bi
140 M: c-type-name require-c-array define-array-vocab drop ;
142 ERROR: specialized-array-vocab-not-loaded c-type ;
144 M: c-type-name c-array-constructor
146 dup [ name>> "<" "-array>" surround ] [ specialized-array-vocab ] bi lookup
147 [ ] [ specialized-array-vocab-not-loaded ] ?if ; foldable
149 M: c-type-name c-(array)-constructor
151 dup [ name>> "(" "-array)" surround ] [ specialized-array-vocab ] bi lookup
152 [ ] [ specialized-array-vocab-not-loaded ] ?if ; foldable
154 M: c-type-name c-direct-array-constructor
156 dup [ name>> "<direct-" "-array>" surround ] [ specialized-array-vocab ] bi lookup
157 [ ] [ specialized-array-vocab-not-loaded ] ?if ; foldable
159 SYNTAX: SPECIALIZED-ARRAYS:
160 ";" parse-tokens [ parse-c-type define-array-vocab use-vocab ] each ;
162 SYNTAX: SPECIALIZED-ARRAY:
163 scan-c-type define-array-vocab use-vocab ;
165 "prettyprint" vocab [
166 "specialized-arrays.prettyprint" require
170 "specialized-arrays.mirrors" require