|
1
|
1 |
"
|
|
5
|
2 |
COPYRIGHT (c) 1989 by Claus Gittinger
|
|
155
|
3 |
All Rights Reserved
|
|
1
|
4 |
|
|
|
5 |
This software is furnished under a license and may be used
|
|
|
6 |
only in accordance with the terms of that license and with the
|
|
|
7 |
inclusion of the above copyright notice. This software may not
|
|
|
8 |
be provided or otherwise made available to, or used by, any
|
|
|
9 |
other person. No title to or ownership of the software is
|
|
|
10 |
hereby transferred.
|
|
|
11 |
"
|
|
|
12 |
|
|
10
|
13 |
ArrayedCollection variableByteSubclass:#ByteArray
|
|
1
|
14 |
instanceVariableNames:''
|
|
|
15 |
classVariableNames:''
|
|
|
16 |
poolDictionaries:''
|
|
155
|
17 |
category:'Collections-Arrayed'
|
|
1
|
18 |
!
|
|
|
19 |
|
|
|
20 |
ByteArray comment:'
|
|
88
|
21 |
COPYRIGHT (c) 1989 by Claus Gittinger
|
|
155
|
22 |
All Rights Reserved
|
|
92
|
23 |
|
|
213
|
24 |
$Header: /cvs/stx/stx/libbasic/ByteArray.st,v 1.19 1994-11-28 20:32:32 claus Exp $
|
|
88
|
25 |
'!
|
|
1
|
26 |
|
|
88
|
27 |
!ByteArray class methodsFor:'documentation'!
|
|
|
28 |
|
|
|
29 |
copyright
|
|
|
30 |
"
|
|
|
31 |
COPYRIGHT (c) 1989 by Claus Gittinger
|
|
155
|
32 |
All Rights Reserved
|
|
1
|
33 |
|
|
88
|
34 |
This software is furnished under a license and may be used
|
|
|
35 |
only in accordance with the terms of that license and with the
|
|
|
36 |
inclusion of the above copyright notice. This software may not
|
|
|
37 |
be provided or otherwise made available to, or used by, any
|
|
|
38 |
other person. No title to or ownership of the software is
|
|
|
39 |
hereby transferred.
|
|
|
40 |
"
|
|
|
41 |
!
|
|
1
|
42 |
|
|
88
|
43 |
version
|
|
|
44 |
"
|
|
213
|
45 |
$Header: /cvs/stx/stx/libbasic/ByteArray.st,v 1.19 1994-11-28 20:32:32 claus Exp $
|
|
88
|
46 |
"
|
|
|
47 |
!
|
|
1
|
48 |
|
|
88
|
49 |
documentation
|
|
|
50 |
"
|
|
|
51 |
ByteArrays store integers in the range 0..255.
|
|
129
|
52 |
In contrast to normal arrays (which store pointers to their elements),
|
|
|
53 |
byteArrays store the values in a dens & compact way. ByteArrays can
|
|
|
54 |
be used to hold the data for bitmaps, images and other bulk data.
|
|
|
55 |
ByteArrays are also used to store the bytecode-instructions of an
|
|
|
56 |
interpreted method and are used as superclass for Strings.
|
|
|
57 |
|
|
|
58 |
ByteArrays can be used as literals i.e. you can enter ByteArray-constants
|
|
|
59 |
as #[ element1 element2 .... elementN] and also use byteArray constants
|
|
|
60 |
as elements in a constant array.
|
|
|
61 |
As in: #( #[1 1 1] #[2 2 2] #[3 3 3])
|
|
|
62 |
|
|
|
63 |
If you have to communicate structure-data (in the C-sense) with external
|
|
|
64 |
programs/data-bases, see a companion class (Structure) in the goodies directory.
|
|
|
65 |
It allows the definition of subclasses of ByteArray, which transparently fetch
|
|
|
66 |
and store C-structure fields.
|
|
88
|
67 |
"
|
|
|
68 |
! !
|
|
1
|
69 |
|
|
3
|
70 |
!ByteArray class methodsFor:'queries'!
|
|
|
71 |
|
|
|
72 |
isBuiltInClass
|
|
|
73 |
"this class is known by the run-time-system"
|
|
|
74 |
|
|
|
75 |
^ self == ByteArray
|
|
|
76 |
! !
|
|
|
77 |
|
|
2
|
78 |
!ByteArray class methodsFor: 'binary storage'!
|
|
|
79 |
|
|
|
80 |
binaryDefinitionFrom: stream manager: manager
|
|
54
|
81 |
"get a ByteArray from the binary stream.
|
|
|
82 |
ByteArrays are stored as 4-byte size, followed by the bytes"
|
|
|
83 |
|
|
|
84 |
"take care of subclasses ..."
|
|
|
85 |
self == ByteArray ifTrue:[
|
|
155
|
86 |
^ (stream next: (stream nextNumber: 4))
|
|
54
|
87 |
].
|
|
|
88 |
^ super binaryDefinitionFrom: stream manager: manager
|
|
2
|
89 |
! !
|
|
|
90 |
|
|
|
91 |
!ByteArray methodsFor: 'binary storage'!
|
|
|
92 |
|
|
|
93 |
storeBinaryDefinitionOn: stream manager: manager
|
|
37
|
94 |
"append a binary representation of the receiver onto stream.
|
|
|
95 |
Redefined since ByteArrays are stored with a special type code and
|
|
|
96 |
in a more compact way."
|
|
|
97 |
|
|
|
98 |
"not, if I have named instance variables"
|
|
|
99 |
self class instSize ~~ 0 ifTrue:[
|
|
155
|
100 |
^ super storeBinaryDefinitionOn: stream manager: manager
|
|
37
|
101 |
].
|
|
2
|
102 |
manager putIdOf: self class on: stream.
|
|
|
103 |
stream nextNumber: 4 put: self basicSize.
|
|
37
|
104 |
stream nextPutAll: self asByteArray
|
|
2
|
105 |
! !
|
|
|
106 |
|
|
1
|
107 |
!ByteArray class methodsFor:'instance creation'!
|
|
|
108 |
|
|
|
109 |
uninitializedNew:anInteger
|
|
|
110 |
"return a new instance of the receiver with uninitialized
|
|
|
111 |
(i.e. undefined) contents. The indexed elements have any random
|
|
75
|
112 |
value. However, any named instance variables are still nilled.
|
|
|
113 |
For use, when contents will be set anyway shortly after - this
|
|
|
114 |
is a bit faster than the regular basicNew:, which clears the bytes.
|
|
|
115 |
Of course, it only makes a difference for very big ByteArrays, such
|
|
|
116 |
as used for images/bitmaps.
|
|
|
117 |
|
|
|
118 |
Notice: if you want to port code using uninitializedNew: to another
|
|
|
119 |
smalltalk, you have to add an 'uninitializedNew: -> basicNew:'-calling
|
|
|
120 |
method to the ByteArray class of the other smalltalk."
|
|
1
|
121 |
|
|
|
122 |
%{ /* NOCONTEXT */
|
|
|
123 |
OBJ newobj;
|
|
|
124 |
INT instsize, nInstVars, nindexedinstvars;
|
|
|
125 |
REGISTER OBJ *op;
|
|
|
126 |
extern OBJ new();
|
|
|
127 |
|
|
|
128 |
if (_isSmallInteger(anInteger)) {
|
|
155
|
129 |
nindexedinstvars = _intVal(anInteger);
|
|
|
130 |
if (nindexedinstvars >= 0) {
|
|
92
|
131 |
/*
|
|
|
132 |
* not needed - always true
|
|
75
|
133 |
* if ((_intVal(_ClassInstPtr(self)->c_flags) & ARRAYMASK) == BYTEARRAY)
|
|
|
134 |
*/
|
|
155
|
135 |
{
|
|
|
136 |
if (self == ByteArray) {
|
|
|
137 |
/*
|
|
|
138 |
* the most common case
|
|
|
139 |
*/
|
|
|
140 |
instsize = OHDR_SIZE + nindexedinstvars;
|
|
|
141 |
if (_CanDoQuickNew(instsize)) {
|
|
|
142 |
_qCheckedNew(newobj, instsize);
|
|
|
143 |
_InstPtr(newobj)->o_class = self;
|
|
|
144 |
RETURN (newobj );
|
|
|
145 |
}
|
|
|
146 |
}
|
|
|
147 |
nInstVars = _intVal(_ClassInstPtr(self)->c_ninstvars);
|
|
|
148 |
instsize = OHDR_SIZE + __OBJS2BYTES__(nInstVars) + nindexedinstvars;
|
|
|
149 |
PROTECT_CONTEXT
|
|
|
150 |
_qNew(newobj, instsize, SENDER);
|
|
|
151 |
UNPROTECT_CONTEXT
|
|
|
152 |
if (newobj) {
|
|
|
153 |
_InstPtr(newobj)->o_class = self;
|
|
|
154 |
if (nInstVars) {
|
|
|
155 |
/*
|
|
|
156 |
* still have to nil out named instvars ...
|
|
|
157 |
*/
|
|
92
|
158 |
#if defined(FAST_MEMSET) && !defined(NEGATIVE_ADDRESSES)
|
|
155
|
159 |
/*
|
|
|
160 |
* knowing that nil is 0
|
|
|
161 |
*/
|
|
|
162 |
memset(_InstPtr(newobj)->i_instvars, 0, instsize - OHDR_SIZE);
|
|
1
|
163 |
#else
|
|
155
|
164 |
op = _InstPtr(newobj)->i_instvars;
|
|
|
165 |
while (nInstVars--)
|
|
|
166 |
*op++ = nil;
|
|
1
|
167 |
#endif
|
|
155
|
168 |
}
|
|
|
169 |
RETURN ( newobj );
|
|
|
170 |
}
|
|
|
171 |
}
|
|
|
172 |
}
|
|
1
|
173 |
}
|
|
|
174 |
%}
|
|
|
175 |
.
|
|
12
|
176 |
(anInteger isMemberOf:SmallInteger) ifTrue:[
|
|
155
|
177 |
(anInteger < 0) ifTrue:[
|
|
|
178 |
^ self error:'bad (negative) argument to new'
|
|
|
179 |
].
|
|
|
180 |
"
|
|
|
181 |
memory allocation failed.
|
|
|
182 |
When we arrive here, there was no memory, even after
|
|
|
183 |
a garbage collect. This means, that the VM wanted to
|
|
|
184 |
get some more memory from the Operatingsystem, which
|
|
|
185 |
was not kind enough to give some.
|
|
|
186 |
"
|
|
|
187 |
^ ObjectMemory allocationFailureSignal raise.
|
|
12
|
188 |
].
|
|
1
|
189 |
^ self basicNew:anInteger
|
|
|
190 |
|
|
|
191 |
! !
|
|
|
192 |
|
|
|
193 |
!ByteArray methodsFor:'accessing'!
|
|
|
194 |
|
|
|
195 |
basicAt:index
|
|
|
196 |
"return the indexed instance variable with index, anInteger
|
|
2
|
197 |
- redefined here to be slighly faster than the default in Object"
|
|
1
|
198 |
|
|
|
199 |
%{ /* NOCONTEXT */
|
|
|
200 |
|
|
|
201 |
REGISTER int indx;
|
|
|
202 |
int nIndex;
|
|
54
|
203 |
OBJ cls;
|
|
1
|
204 |
|
|
2
|
205 |
if (_isSmallInteger(index)) {
|
|
155
|
206 |
indx = _intVal(index);
|
|
2
|
207 |
|
|
155
|
208 |
if ((cls = _qClass(self)) != ByteArray)
|
|
|
209 |
indx += __OBJS2BYTES__(_intVal(_ClassInstPtr(cls)->c_ninstvars));
|
|
|
210 |
nIndex = _qSize(self) - OHDR_SIZE;
|
|
|
211 |
if ((indx > 0) && (indx <= nIndex)) {
|
|
|
212 |
RETURN ( _MKSMALLINT(_ByteArrayInstPtr(self)->ba_element[indx - 1]) );
|
|
|
213 |
}
|
|
1
|
214 |
}
|
|
|
215 |
%}
|
|
|
216 |
.
|
|
|
217 |
^ super basicAt:index
|
|
|
218 |
!
|
|
|
219 |
|
|
|
220 |
basicAt:index put:value
|
|
|
221 |
"set the indexed instance variable with index, anInteger to value
|
|
2
|
222 |
- redefined here to be slighly faster than the default in Object"
|
|
1
|
223 |
|
|
|
224 |
%{ /* NOCONTEXT */
|
|
|
225 |
|
|
|
226 |
REGISTER int indx;
|
|
|
227 |
int nIndex;
|
|
|
228 |
int val;
|
|
54
|
229 |
OBJ cls;
|
|
1
|
230 |
|
|
2
|
231 |
if (_isSmallInteger(index) && _isSmallInteger(value)) {
|
|
155
|
232 |
val = _intVal(value);
|
|
|
233 |
if ((val >= 0) && (val <= 255)) {
|
|
|
234 |
indx = _intVal(index);
|
|
|
235 |
if ((cls = _qClass(self)) != ByteArray)
|
|
|
236 |
indx += __OBJS2BYTES__(_intVal(_ClassInstPtr(cls)->c_ninstvars));
|
|
|
237 |
nIndex = _qSize(self) - OHDR_SIZE;
|
|
|
238 |
if ((indx > 0) && (indx <= nIndex)) {
|
|
|
239 |
_ByteArrayInstPtr(self)->ba_element[indx - 1] = val;
|
|
|
240 |
RETURN ( value );
|
|
|
241 |
}
|
|
|
242 |
}
|
|
1
|
243 |
}
|
|
|
244 |
%}
|
|
|
245 |
.
|
|
|
246 |
^ super basicAt:index put:value
|
|
2
|
247 |
!
|
|
|
248 |
|
|
54
|
249 |
byteAt:index
|
|
|
250 |
"return the byte at index
|
|
|
251 |
- for ST-80 compatibility"
|
|
|
252 |
|
|
|
253 |
^ self at:index
|
|
|
254 |
!
|
|
|
255 |
|
|
|
256 |
byteAt:index put:aByteValuedInteger
|
|
|
257 |
"return the byte at index
|
|
|
258 |
- for ST-80 compatibility"
|
|
|
259 |
|
|
|
260 |
^ self at:index put:aByteValuedInteger
|
|
|
261 |
!
|
|
|
262 |
|
|
2
|
263 |
wordAt:index
|
|
|
264 |
"return the 2-bytes starting at index as an (unsigned) Integer.
|
|
129
|
265 |
The value is retrieved LSB-first (i.e. low 8-bits at lower byte index).
|
|
|
266 |
Question: should it be retrieve signed values ? (see ByteArray>>signedWordAt:)"
|
|
2
|
267 |
|
|
|
268 |
%{ /* NOCONTEXT */
|
|
|
269 |
|
|
|
270 |
REGISTER int indx;
|
|
|
271 |
int nIndex;
|
|
|
272 |
int val;
|
|
|
273 |
extern OBJ _makeLarge();
|
|
|
274 |
|
|
|
275 |
if (_isSmallInteger(index)) {
|
|
155
|
276 |
indx = _intVal(index);
|
|
|
277 |
if (_qClass(self) != ByteArray)
|
|
|
278 |
indx += __OBJS2BYTES__(_intVal(_ClassInstPtr(_qClass(self))->c_ninstvars));
|
|
|
279 |
nIndex = _qSize(self) - OHDR_SIZE;
|
|
|
280 |
if ((indx > 0) && ((indx+1) <= nIndex)) {
|
|
|
281 |
val = _ByteArrayInstPtr(self)->ba_element[indx+1-1];
|
|
|
282 |
val = (val << 8) + _ByteArrayInstPtr(self)->ba_element[indx-1];
|
|
|
283 |
RETURN ( _MKSMALLINT(val) );
|
|
|
284 |
}
|
|
2
|
285 |
}
|
|
|
286 |
%}
|
|
|
287 |
.
|
|
|
288 |
^ ((self at:index+1) * 256) + (self at:index)
|
|
|
289 |
!
|
|
|
290 |
|
|
|
291 |
wordAt:index put:value
|
|
|
292 |
"set the 2-bytes starting at index from the (unsigned) Integer value.
|
|
129
|
293 |
The stored value must be in the range 0 .. 16rFFFF.
|
|
|
294 |
The value is stored LSB-first - i.e. the low 8bits are stored at the
|
|
|
295 |
lower address.
|
|
|
296 |
Question: should it accept signed values ? (see ByteArray>>signedWordAt:put:)"
|
|
2
|
297 |
|
|
|
298 |
%{ /* NOCONTEXT */
|
|
|
299 |
|
|
|
300 |
REGISTER int indx;
|
|
|
301 |
int nIndex;
|
|
|
302 |
int val;
|
|
|
303 |
extern OBJ _makeLarge();
|
|
|
304 |
|
|
|
305 |
if (_isSmallInteger(index) && _isSmallInteger(value)) {
|
|
155
|
306 |
indx = _intVal(index);
|
|
|
307 |
if (_qClass(self) != ByteArray)
|
|
|
308 |
indx += __OBJS2BYTES__(_intVal(_ClassInstPtr(_qClass(self))->c_ninstvars));
|
|
|
309 |
nIndex = _qSize(self) - OHDR_SIZE;
|
|
|
310 |
if ((indx > 0) && ((indx+1) <= nIndex)) {
|
|
|
311 |
val = _intVal(value);
|
|
|
312 |
if ((val >= 0) && (val <= 0xFFFF)) {
|
|
|
313 |
_ByteArrayInstPtr(self)->ba_element[indx-1] = val & 0xFF;
|
|
|
314 |
_ByteArrayInstPtr(self)->ba_element[indx+1-1] = (val>>8) & 0xFF;
|
|
|
315 |
RETURN ( value );
|
|
|
316 |
}
|
|
|
317 |
}
|
|
2
|
318 |
}
|
|
|
319 |
%}
|
|
|
320 |
.
|
|
|
321 |
(value < 0) ifTrue:[
|
|
155
|
322 |
^ self elementBoundsError
|
|
2
|
323 |
].
|
|
|
324 |
self at:index put:(value \\ 256).
|
|
|
325 |
self at:index + 1 put:(value // 256).
|
|
|
326 |
^ value
|
|
129
|
327 |
|
|
|
328 |
"
|
|
|
329 |
|b|
|
|
|
330 |
b := ByteArray new:4.
|
|
|
331 |
b wordAt:1 put:16r0102.
|
|
|
332 |
b wordAt:3 put:16r0304.
|
|
|
333 |
b inspect
|
|
|
334 |
"
|
|
2
|
335 |
!
|
|
|
336 |
|
|
54
|
337 |
signedWordAt:index
|
|
129
|
338 |
"return the 2-bytes starting at index as a signed Integer.
|
|
|
339 |
The value is retrieved LSB-first (i.e. low 8-bits at lower byte index)"
|
|
54
|
340 |
|
|
|
341 |
|w|
|
|
|
342 |
|
|
|
343 |
w := self wordAt:index.
|
|
|
344 |
(w > 16r7FFF) ifTrue:[
|
|
155
|
345 |
^ w - 16r10000
|
|
54
|
346 |
].
|
|
|
347 |
^ w
|
|
|
348 |
|
|
|
349 |
"
|
|
129
|
350 |
|b|
|
|
|
351 |
b := ByteArray new:2.
|
|
|
352 |
b wordAt:1 put:16rFFFF.
|
|
|
353 |
b signedWordAt:1
|
|
54
|
354 |
"
|
|
|
355 |
!
|
|
|
356 |
|
|
|
357 |
signedWordAt:index put:value
|
|
129
|
358 |
"set the 2-bytes starting at index from the signed Integer value.
|
|
|
359 |
The stored value must be in the range -32768 .. +32676.
|
|
|
360 |
The value is stored LSB-first (i.e. low 8-bits at lower byte index)"
|
|
54
|
361 |
|
|
|
362 |
value > 0 ifTrue:[
|
|
155
|
363 |
^ self wordAt:index put:value
|
|
54
|
364 |
].
|
|
|
365 |
^ self wordAt:index put:(16r10000 + value)
|
|
129
|
366 |
|
|
|
367 |
"
|
|
|
368 |
|b|
|
|
|
369 |
b := ByteArray new:4.
|
|
|
370 |
b signedWordAt:1 put:-1.
|
|
|
371 |
b signedWordAt:3 put:-2.
|
|
|
372 |
b inspect
|
|
|
373 |
"
|
|
54
|
374 |
!
|
|
|
375 |
|
|
2
|
376 |
doubleWordAt:index
|
|
|
377 |
"return the 4-bytes starting at index as an (unsigned) Integer.
|
|
129
|
378 |
The value is retrieved LSB-first (i.e. low 8-bits at lowest byte-index).
|
|
|
379 |
question: should it return a signed value ? (see ByteArray>>signedDoubleWordAt:)"
|
|
2
|
380 |
|
|
|
381 |
%{ /* NOCONTEXT */
|
|
|
382 |
|
|
|
383 |
REGISTER int indx;
|
|
|
384 |
int nIndex;
|
|
|
385 |
int val;
|
|
129
|
386 |
extern OBJ _makeULarge();
|
|
2
|
387 |
|
|
|
388 |
if (_isSmallInteger(index)) {
|
|
155
|
389 |
indx = _intVal(index);
|
|
|
390 |
if (_qClass(self) != ByteArray)
|
|
|
391 |
indx += __OBJS2BYTES__(_intVal(_ClassInstPtr(_qClass(self))->c_ninstvars));
|
|
|
392 |
nIndex = _qSize(self) - OHDR_SIZE;
|
|
|
393 |
if ((indx > 0) && ((indx+3) <= nIndex)) {
|
|
|
394 |
val = _ByteArrayInstPtr(self)->ba_element[indx+3-1];
|
|
|
395 |
val = (val << 8) + _ByteArrayInstPtr(self)->ba_element[indx+2-1];
|
|
|
396 |
val = (val << 8) + _ByteArrayInstPtr(self)->ba_element[indx+1-1];
|
|
|
397 |
val = (val << 8) + _ByteArrayInstPtr(self)->ba_element[indx-1];
|
|
|
398 |
if ((val >= 0) && (val <= _MAX_INT)) {
|
|
|
399 |
RETURN ( _MKSMALLINT(val) );
|
|
|
400 |
}
|
|
|
401 |
RETURN ( _makeULarge(val) );
|
|
|
402 |
}
|
|
2
|
403 |
}
|
|
129
|
404 |
/*
|
|
|
405 |
* fall through in case of any error
|
|
|
406 |
* it will be handled in wordAt: finally
|
|
|
407 |
*/
|
|
2
|
408 |
%}
|
|
|
409 |
.
|
|
85
|
410 |
^ ((256 * 256) * (self wordAt:index+2)) + (self wordAt:index)
|
|
129
|
411 |
|
|
|
412 |
"
|
|
|
413 |
|b|
|
|
|
414 |
|
|
|
415 |
b := ByteArray withAll:#(1 2 3 4).
|
|
|
416 |
(b doubleWordAt:1) printStringRadix:16
|
|
|
417 |
"
|
|
2
|
418 |
!
|
|
|
419 |
|
|
|
420 |
doubleWordAt:index put:value
|
|
|
421 |
"set the 4-bytes starting at index from the (unsigned) Integer value.
|
|
129
|
422 |
The value must be in the range 0 to 16rFFFFFFFF.
|
|
|
423 |
The value is stored LSB-first (i.e. low 8-bits at lowest byte-index).
|
|
|
424 |
question: should it store signed values ? (see ByteArray signedDoubleWordAt:put:)"
|
|
2
|
425 |
|
|
|
426 |
|t|
|
|
|
427 |
|
|
|
428 |
%{ /* NOCONTEXT */
|
|
|
429 |
|
|
|
430 |
REGISTER int indx;
|
|
|
431 |
int nIndex;
|
|
|
432 |
int val;
|
|
|
433 |
extern OBJ _makeLarge();
|
|
|
434 |
|
|
|
435 |
if (_isSmallInteger(index) && _isSmallInteger(value)) {
|
|
155
|
436 |
val = _intVal(value);
|
|
|
437 |
if (val >= 0) {
|
|
|
438 |
indx = _intVal(index);
|
|
|
439 |
if (_qClass(self) != ByteArray)
|
|
|
440 |
indx += __OBJS2BYTES__(_intVal(_ClassInstPtr(_qClass(self))->c_ninstvars));
|
|
|
441 |
nIndex = _qSize(self) - OHDR_SIZE;
|
|
|
442 |
if ((indx > 0) && ((indx+3) <= nIndex)) {
|
|
|
443 |
_ByteArrayInstPtr(self)->ba_element[indx-1] = val & 0xFF;
|
|
|
444 |
val >>= 8;
|
|
|
445 |
_ByteArrayInstPtr(self)->ba_element[indx+1-1] = val & 0xFF;
|
|
|
446 |
val >>= 8;
|
|
|
447 |
_ByteArrayInstPtr(self)->ba_element[indx+2-1] = val & 0xFF;
|
|
|
448 |
val >>= 8;
|
|
|
449 |
_ByteArrayInstPtr(self)->ba_element[indx+3-1] = val & 0xFF;
|
|
|
450 |
RETURN ( value );
|
|
|
451 |
}
|
|
|
452 |
}
|
|
2
|
453 |
}
|
|
|
454 |
%}
|
|
|
455 |
.
|
|
|
456 |
(value < 0) ifTrue:[
|
|
155
|
457 |
^ self elementBoundsError
|
|
2
|
458 |
].
|
|
|
459 |
t := value // (256 * 256).
|
|
|
460 |
self wordAt:(index+2) put:t.
|
|
85
|
461 |
self wordAt:(index) put:(value - (256 * 256 * t)).
|
|
2
|
462 |
^ value
|
|
129
|
463 |
|
|
|
464 |
"
|
|
|
465 |
|b|
|
|
|
466 |
b := ByteArray new:4.
|
|
|
467 |
b doubleWordAt:1 put:16r04030201.
|
|
|
468 |
b inspect
|
|
|
469 |
"
|
|
54
|
470 |
!
|
|
|
471 |
|
|
|
472 |
signedDoubleWordAt:index
|
|
129
|
473 |
"return the 4-bytes starting at index as a signed Integer.
|
|
|
474 |
The value is retrieved LSB-first (i.e. low 8-bits at lowest byte-index)."
|
|
54
|
475 |
|
|
|
476 |
|w|
|
|
|
477 |
|
|
129
|
478 |
"
|
|
|
479 |
stupid: due to an STC bug, cannot currently have LargeInteger
|
|
|
480 |
constants - change to code below when fixed ...
|
|
|
481 |
"
|
|
54
|
482 |
w := self doubleWordAt:index.
|
|
|
483 |
(w > (16r7FFFFFF * 16r10 + 16rF)) ifTrue:[
|
|
155
|
484 |
^ w - (16r10000000 * 16r10)
|
|
54
|
485 |
].
|
|
|
486 |
^ w
|
|
|
487 |
"
|
|
|
488 |
w := self doubleWordAt:index.
|
|
|
489 |
(w > 16r7FFFFFFF) ifTrue:[
|
|
155
|
490 |
^ w - 16r100000000
|
|
54
|
491 |
].
|
|
|
492 |
^ w
|
|
|
493 |
"
|
|
|
494 |
|
|
|
495 |
"
|
|
129
|
496 |
|b|
|
|
|
497 |
b := ByteArray new:4.
|
|
|
498 |
b doubleWordAt:1 put:16rFFFFFFFF.
|
|
|
499 |
(b signedDoubleWordAt:1)
|
|
54
|
500 |
"
|
|
|
501 |
!
|
|
|
502 |
|
|
|
503 |
signedDoubleWordAt:index put:value
|
|
129
|
504 |
"set the 4-bytes starting at index from the signed Integer value.
|
|
|
505 |
The value is stored LSB-first (i.e. low 8-bits at lowest byte-index)."
|
|
54
|
506 |
|
|
|
507 |
value > 0 ifTrue:[
|
|
155
|
508 |
^ self doubleWordAt:index put:value
|
|
54
|
509 |
].
|
|
129
|
510 |
"
|
|
|
511 |
stupid: due to an STC bug, cannot currently have LargeInteger
|
|
|
512 |
constants - change to code below when fixed ...
|
|
|
513 |
"
|
|
54
|
514 |
^ self doubleWordAt:index put:((16r10000000 * 16r10) + value)
|
|
|
515 |
"
|
|
|
516 |
^ self doubleWordAt:index put:(16r100000000 + value)
|
|
|
517 |
"
|
|
129
|
518 |
"
|
|
|
519 |
|b|
|
|
|
520 |
b := ByteArray new:4.
|
|
|
521 |
b signedDoubleWordAt:1 put:-1.
|
|
|
522 |
(b doubleWordAt:1) printStringRadix:16
|
|
|
523 |
"
|
|
|
524 |
!
|
|
54
|
525 |
|
|
129
|
526 |
|
|
|
527 |
quadWordAt:index
|
|
|
528 |
"return the 8-bytes starting at index as an (unsigned) Integer.
|
|
|
529 |
The value is retrieved LSB-first (i.e. low 8-bits at lowest byte-index)."
|
|
|
530 |
|
|
|
531 |
|l bIdx "{ Class: SmallInteger }"|
|
|
|
532 |
|
|
|
533 |
l := LargeInteger basicNew numberOfDigits:8.
|
|
|
534 |
bIdx := index.
|
|
|
535 |
1 to:8 do:[:i |
|
|
155
|
536 |
l digitAt:i put:(self basicAt:bIdx).
|
|
|
537 |
bIdx := bIdx + 1
|
|
129
|
538 |
].
|
|
|
539 |
^ l normalize
|
|
|
540 |
|
|
|
541 |
"
|
|
|
542 |
|b|
|
|
|
543 |
|
|
|
544 |
b := ByteArray withAll:#(1 2 3 4 5 6 7 8).
|
|
|
545 |
(b quadWordAt:1) printStringRadix:16
|
|
|
546 |
"
|
|
|
547 |
!
|
|
|
548 |
|
|
|
549 |
quadWordAt:index put:anInteger
|
|
|
550 |
"set the 8-bytes starting at index from the (unsigned) Integer value.
|
|
|
551 |
The value must be in the range 0 to 16rFFFFFFFFFFFFFFFF.
|
|
|
552 |
The value is stored LSB-first (i.e. low 8-bits at lowest byte-index)."
|
|
|
553 |
|
|
|
554 |
|bIdx "{ Class: SmallInteger }"|
|
|
|
555 |
|
|
|
556 |
bIdx := index.
|
|
|
557 |
1 to:8 do:[:i |
|
|
155
|
558 |
self basicAt:bIdx put:(anInteger digitAt:i).
|
|
|
559 |
bIdx := bIdx + 1.
|
|
129
|
560 |
]
|
|
|
561 |
|
|
|
562 |
"
|
|
|
563 |
|b|
|
|
|
564 |
b := ByteArray new:8.
|
|
|
565 |
b quadWordAtIndex:1 put:16r0807060504030201.
|
|
|
566 |
b inspect
|
|
|
567 |
"
|
|
54
|
568 |
!
|
|
|
569 |
|
|
|
570 |
floatAt:index
|
|
|
571 |
"return the 4-bytes starting at index as a Float.
|
|
129
|
572 |
Notice, that (currently) ST/X Floats are what Doubles are in ST-80;
|
|
|
573 |
therefore this method reads a 4-byte float from the byteArray and returns
|
|
|
574 |
a float object which keeps an 8-byte double internally.
|
|
54
|
575 |
Notice also, that the bytes are expected to be in this machines
|
|
129
|
576 |
float representation and order - if the bytearray originated from another
|
|
54
|
577 |
machine, some conversion is usually needed."
|
|
|
578 |
|
|
|
579 |
|newFloat|
|
|
|
580 |
|
|
|
581 |
newFloat := Float basicNew.
|
|
77
|
582 |
UninterpretedBytes isBigEndian ifFalse:[
|
|
155
|
583 |
5 to:8 do:[:destIndex|
|
|
|
584 |
newFloat basicAt:destIndex put:(self at:index - 5 + destIndex)
|
|
|
585 |
].
|
|
77
|
586 |
] ifTrue:[
|
|
155
|
587 |
1 to:4 do:[:destIndex|
|
|
|
588 |
newFloat basicAt:destIndex put:(self at:index - 1 + destIndex)
|
|
|
589 |
].
|
|
54
|
590 |
].
|
|
|
591 |
^ newFloat.
|
|
|
592 |
!
|
|
|
593 |
|
|
|
594 |
floatAt:index put:aFloat
|
|
|
595 |
"store the 4 bytes of value of the argument, aFloat into the receiver
|
|
|
596 |
starting at index.
|
|
|
597 |
Notice, that (currently) ST/X Floats are what DOubles are in ST-80.
|
|
|
598 |
Notice also, that the bytes are expected to be in this machines
|
|
|
599 |
float representation - if the bytearray originated from another
|
|
|
600 |
machine, some conversion is usually needed."
|
|
|
601 |
|
|
77
|
602 |
UninterpretedBytes isBigEndian ifFalse:[
|
|
155
|
603 |
5 to:8 do:[:srcIndex|
|
|
|
604 |
self at:index - 5 + srcIndex put:(aFloat basicAt:srcIndex)
|
|
|
605 |
].
|
|
77
|
606 |
] ifTrue:[
|
|
155
|
607 |
1 to:4 do:[:srcIndex|
|
|
|
608 |
self at:index - 1 + srcIndex put:(aFloat basicAt:srcIndex)
|
|
|
609 |
].
|
|
54
|
610 |
].
|
|
|
611 |
^ aFloat
|
|
|
612 |
!
|
|
|
613 |
|
|
|
614 |
doubleAt:index
|
|
|
615 |
"return the 8-bytes starting at index as a Float.
|
|
|
616 |
Notice, that (currently) ST/X Floats are what Doubles are in ST-80.
|
|
|
617 |
Notice also, that the bytes are expected to be in this machines
|
|
|
618 |
float representation - if the bytearray originated from another
|
|
|
619 |
machine, some conversion is usually needed."
|
|
|
620 |
|
|
|
621 |
|newFloat|
|
|
|
622 |
|
|
|
623 |
newFloat := Float basicNew.
|
|
|
624 |
1 to:8 do:[:destIndex|
|
|
155
|
625 |
newFloat basicAt:destIndex put:(self at:index - 1 + destIndex)
|
|
54
|
626 |
].
|
|
|
627 |
^ newFloat.
|
|
|
628 |
!
|
|
|
629 |
|
|
|
630 |
doubleAt:index put:aFloat
|
|
|
631 |
"store the value of the argument, aFloat into the receiver
|
|
|
632 |
starting at index.
|
|
|
633 |
Notice, that (currently) ST/X Floats are what Doubles are in ST-80.
|
|
|
634 |
Notice also, that the bytes are expected to be in this machines
|
|
|
635 |
float representation - if the bytearray originated from another
|
|
|
636 |
machine, some conversion is usually needed."
|
|
|
637 |
|
|
|
638 |
1 to:8 do:[:srcIndex|
|
|
155
|
639 |
self at:index - 1 + srcIndex put:(aFloat basicAt:srcIndex)
|
|
54
|
640 |
].
|
|
|
641 |
^ aFloat
|
|
129
|
642 |
!
|
|
|
643 |
|
|
|
644 |
ieeFloatAt:index
|
|
|
645 |
"retrieve the 4 bytes starting at index as a float.
|
|
|
646 |
The 4 bytes are assumed to be in IEE floating point single precision
|
|
|
647 |
number format."
|
|
|
648 |
|
|
|
649 |
"
|
|
|
650 |
currently, we assume that the machines native number format is already
|
|
|
651 |
IEE format - we need some more code here whenever ST/X is ported
|
|
|
652 |
to an IBM 370 or old VAX etc.
|
|
|
653 |
To date, all supported systems use IEE float numbers, so there should be
|
|
|
654 |
no problem.
|
|
|
655 |
"
|
|
|
656 |
^ self floatAt:index
|
|
|
657 |
!
|
|
|
658 |
|
|
|
659 |
ieeFloatAt:index put:aFloat
|
|
|
660 |
"store the value of the argument, aFloat into the receiver
|
|
|
661 |
starting at index. Storage is in IEE floating point single precision format.
|
|
|
662 |
(i.e. 4 bytes are stored). Since ST/X floats are really doubles, the low-
|
|
|
663 |
order 4 bytes of the precision is lost."
|
|
|
664 |
|
|
|
665 |
"
|
|
|
666 |
currently, we assume that the machines native number format is already
|
|
|
667 |
IEE format - we need some more code here whenever ST/X is ported
|
|
|
668 |
to an IBM 370 or old VAX etc.
|
|
|
669 |
To date, all supported systems use IEE float numbers, so there should be
|
|
|
670 |
no problem.
|
|
|
671 |
"
|
|
|
672 |
^ self floatAt:index put:aFloat
|
|
|
673 |
!
|
|
|
674 |
|
|
|
675 |
ieeDoubleAt:index
|
|
|
676 |
"retrieve the 8 bytes starting at index as a float.
|
|
|
677 |
The 8 bytes are assumed to be in IEE floating point single precision
|
|
|
678 |
number format."
|
|
|
679 |
|
|
|
680 |
"
|
|
|
681 |
currently, we assume that the machines native number format is already
|
|
|
682 |
IEE format - we need some more code here whenever ST/X is ported
|
|
|
683 |
to an IBM 370 or old VAX etc.
|
|
|
684 |
To date, all supported systems use IEE float numbers, so there should be
|
|
|
685 |
no problem.
|
|
|
686 |
"
|
|
|
687 |
^ self doubleAt:index
|
|
|
688 |
!
|
|
|
689 |
|
|
|
690 |
ieeDoubleAt:index put:aFloat
|
|
|
691 |
"store the value of the argument, aFloat into the receiver
|
|
|
692 |
starting at index. Storage is in IEE floating point double precision format.
|
|
|
693 |
(i.e. 8 bytes are stored)."
|
|
|
694 |
|
|
|
695 |
"
|
|
|
696 |
currently, we assume that the machines native number format is already
|
|
|
697 |
IEE format - we need some more code here whenever ST/X is ported
|
|
|
698 |
to an IBM 370 or old VAX etc.
|
|
|
699 |
To date, all supported systems use IEE float numbers, so there should be
|
|
|
700 |
no problem.
|
|
|
701 |
"
|
|
|
702 |
^ self doubleAt:index put:aFloat
|
|
1
|
703 |
! !
|
|
|
704 |
|
|
12
|
705 |
!ByteArray methodsFor:'converting'!
|
|
|
706 |
|
|
|
707 |
asByteArray
|
|
|
708 |
"return the receiver as a byteArray"
|
|
|
709 |
|
|
|
710 |
"could be an instance of a subclass..."
|
|
|
711 |
self class == ByteArray ifTrue:[
|
|
155
|
712 |
^ self
|
|
12
|
713 |
].
|
|
|
714 |
^ super asByteArray
|
|
129
|
715 |
|
|
|
716 |
"
|
|
|
717 |
'hello world' asByteArray
|
|
|
718 |
#(1 2 3 4 5 6 7) asByteArray
|
|
|
719 |
#(1 2 256 4 5 6 7) asByteArray
|
|
|
720 |
"
|
|
12
|
721 |
! !
|
|
|
722 |
|
|
|
723 |
!ByteArray methodsFor:'printing & storing'!
|
|
|
724 |
|
|
|
725 |
isLiteral
|
|
37
|
726 |
"return true, if the receiver can be used as a literal
|
|
|
727 |
(i.e. can be used in constant arrays)"
|
|
12
|
728 |
|
|
|
729 |
^ true
|
|
|
730 |
!
|
|
|
731 |
|
|
|
732 |
storeOn:aStream
|
|
54
|
733 |
"append a printed representation from which the receiver can be
|
|
|
734 |
reconstructed to aStream. (reimplemented to make it look better)"
|
|
|
735 |
|
|
|
736 |
|first|
|
|
|
737 |
|
|
|
738 |
self class == ByteArray ifTrue:[
|
|
155
|
739 |
aStream nextPutAll:'#['.
|
|
|
740 |
first := true.
|
|
|
741 |
self do:[:byte |
|
|
|
742 |
first ifFalse:[aStream space]
|
|
|
743 |
ifTrue:[first := false].
|
|
|
744 |
byte storeOn:aStream.
|
|
|
745 |
].
|
|
|
746 |
aStream nextPutAll:']'.
|
|
|
747 |
^ self
|
|
54
|
748 |
].
|
|
|
749 |
^ super storeOn:aStream
|
|
68
|
750 |
|
|
129
|
751 |
"
|
|
|
752 |
#[1 2 3 4 5] storeOn:Transcript
|
|
|
753 |
"
|
|
12
|
754 |
! !
|
|
|
755 |
|
|
1
|
756 |
!ByteArray methodsFor:'queries'!
|
|
|
757 |
|
|
|
758 |
indexOf:aByte startingAt:start
|
|
|
759 |
"return the index of the first occurrence of the argument, aByte
|
|
|
760 |
in the receiver starting at start, anInteger; return 0 if not found.
|
|
|
761 |
- reimplemented here for speed"
|
|
|
762 |
|
|
|
763 |
%{ /* NOCONTEXT */
|
|
|
764 |
|
|
|
765 |
REGISTER unsigned char *cp;
|
|
|
766 |
REGISTER int index, byteValue;
|
|
|
767 |
REGISTER int len;
|
|
|
768 |
|
|
|
769 |
if (! _isSmallInteger(aByte)) {
|
|
155
|
770 |
RETURN ( _MKSMALLINT(0) );
|
|
1
|
771 |
}
|
|
|
772 |
|
|
|
773 |
byteValue = _intVal(aByte);
|
|
|
774 |
|
|
|
775 |
if ((byteValue < 0) || (byteValue > 255)) {
|
|
155
|
776 |
RETURN ( _MKSMALLINT(0) );
|
|
1
|
777 |
}
|
|
|
778 |
|
|
2
|
779 |
if (_isSmallInteger(start)) {
|
|
155
|
780 |
index = _intVal(start);
|
|
|
781 |
len = _qSize(self) - OHDR_SIZE;
|
|
|
782 |
cp = &(_ByteArrayInstPtr(self)->ba_element[0]);
|
|
|
783 |
if (_qClass(self) != ByteArray) {
|
|
|
784 |
int nInst;
|
|
2
|
785 |
|
|
155
|
786 |
nInst = __OBJS2BYTES__(_intVal(_ClassInstPtr(_qClass(self))->c_ninstvars));
|
|
|
787 |
cp += nInst;
|
|
|
788 |
len -= nInst;
|
|
|
789 |
}
|
|
|
790 |
cp += index - 1;
|
|
|
791 |
while (index <= len) {
|
|
|
792 |
if (*cp == byteValue) {
|
|
|
793 |
RETURN ( _MKSMALLINT(index) );
|
|
|
794 |
}
|
|
|
795 |
index++;
|
|
|
796 |
cp++;
|
|
|
797 |
}
|
|
|
798 |
RETURN ( _MKSMALLINT(0) );
|
|
1
|
799 |
}
|
|
|
800 |
%}
|
|
|
801 |
.
|
|
|
802 |
^ super indexOf:aByte startingAt:start
|
|
129
|
803 |
|
|
|
804 |
"
|
|
|
805 |
#[1 2 3 4 5 6 7 8 9 0 1 2 3 4 5] indexOf:0
|
|
|
806 |
"
|
|
1
|
807 |
!
|
|
|
808 |
|
|
|
809 |
usedValues
|
|
|
810 |
"return a new ByteArray with all used values (actually a kind of Set);
|
|
129
|
811 |
This is needed specially in the bitmap/Imageclasses to find used colors
|
|
|
812 |
in an image."
|
|
1
|
813 |
|
|
|
814 |
|result l|
|
|
12
|
815 |
|
|
|
816 |
%{ /* STACK: 400 */
|
|
|
817 |
|
|
1
|
818 |
REGISTER unsigned char *cp;
|
|
|
819 |
REGISTER int len;
|
|
|
820 |
unsigned char flags[256];
|
|
|
821 |
static struct inlineCache nw = _ILC1;
|
|
213
|
822 |
extern OBJ ByteArray;
|
|
1
|
823 |
|
|
|
824 |
if (_qClass(self) == ByteArray) {
|
|
155
|
825 |
memset(flags, 0, sizeof(flags));
|
|
|
826 |
len = _qSize(self) - OHDR_SIZE;
|
|
|
827 |
cp = &(_ByteArrayInstPtr(self)->ba_element[0]);
|
|
1
|
828 |
|
|
155
|
829 |
/* for each used byte, set flag */
|
|
|
830 |
while (len > 0) {
|
|
|
831 |
flags[*cp] = 1;
|
|
|
832 |
cp++;
|
|
|
833 |
len--;
|
|
|
834 |
}
|
|
|
835 |
/* count 1's */
|
|
|
836 |
len = 0;
|
|
|
837 |
for (cp=flags+255; cp >= flags; cp--)
|
|
|
838 |
if (*cp) len++;
|
|
1
|
839 |
|
|
155
|
840 |
/* create ByteArray of used values */
|
|
|
841 |
result = (*nw.ilc_func)(ByteArray,
|
|
|
842 |
@symbol(new:),
|
|
|
843 |
CON_COMMA nil, &nw,
|
|
|
844 |
_MKSMALLINT(len));
|
|
|
845 |
if (_Class(result) == ByteArray) {
|
|
|
846 |
cp = &(_ByteArrayInstPtr(result)->ba_element[0]);
|
|
|
847 |
for (len=0; len < 256; len++) {
|
|
|
848 |
if (flags[len])
|
|
|
849 |
*cp++ = len;
|
|
|
850 |
}
|
|
|
851 |
}
|
|
|
852 |
RETURN ( result );
|
|
1
|
853 |
}
|
|
|
854 |
%}
|
|
|
855 |
.
|
|
54
|
856 |
^ self asSet
|
|
129
|
857 |
|
|
|
858 |
"
|
|
|
859 |
#[1 2 3 1 2 3 1 2 3 1 2 3 4 5 6 4 5 6] usedValues
|
|
|
860 |
"
|
|
1
|
861 |
!
|
|
|
862 |
|
|
129
|
863 |
|
|
1
|
864 |
usageCounts
|
|
|
865 |
"return an array filled with value-counts -
|
|
129
|
866 |
This is needed in the bitmap/image classes to get info on color usage.
|
|
|
867 |
(i.e. to build up a histogram of color usage within an image)."
|
|
1
|
868 |
|
|
|
869 |
|counts|
|
|
|
870 |
|
|
|
871 |
counts := Array new:256.
|
|
12
|
872 |
|
|
|
873 |
%{ /* STACK: 2000 */
|
|
|
874 |
|
|
1
|
875 |
REGISTER unsigned char *cp;
|
|
|
876 |
REGISTER int nByte;
|
|
|
877 |
REGISTER int index;
|
|
|
878 |
int icounts[256];
|
|
|
879 |
|
|
54
|
880 |
if ((_qClass(self) == ByteArray) && __isArray(counts)) {
|
|
155
|
881 |
/*
|
|
|
882 |
* zero counts
|
|
|
883 |
*/
|
|
|
884 |
for (index=0; index<256; index++) {
|
|
|
885 |
icounts[index] = 0;
|
|
|
886 |
}
|
|
1
|
887 |
|
|
155
|
888 |
/*
|
|
|
889 |
* count
|
|
|
890 |
*/
|
|
|
891 |
nByte = _qSize(self) - OHDR_SIZE;
|
|
|
892 |
cp = &(_ByteArrayInstPtr(self)->ba_element[0]);
|
|
|
893 |
while (nByte--) {
|
|
|
894 |
icounts[*cp++]++;
|
|
|
895 |
}
|
|
1
|
896 |
|
|
155
|
897 |
/*
|
|
|
898 |
* make it real counts
|
|
|
899 |
*/
|
|
|
900 |
for (index=0; index<256; index++) {
|
|
|
901 |
_ArrayInstPtr(counts)->a_element[index] = _MKSMALLINT(icounts[index]);
|
|
|
902 |
}
|
|
|
903 |
RETURN ( counts );
|
|
1
|
904 |
}
|
|
|
905 |
%}
|
|
|
906 |
.
|
|
|
907 |
self primitiveFailed
|
|
129
|
908 |
|
|
|
909 |
"
|
|
|
910 |
#[1 2 3 1 2 3 1 2 250 251 250 251 255] usageCounts
|
|
|
911 |
"
|
|
1
|
912 |
!
|
|
|
913 |
|
|
155
|
914 |
max
|
|
1
|
915 |
"return the maximum value in the receiver -
|
|
155
|
916 |
redefined to speedup image processing and sound-player
|
|
|
917 |
(which need a fast method for this on byteArrays)"
|
|
1
|
918 |
|
|
|
919 |
%{ /* NOCONTEXT */
|
|
|
920 |
|
|
|
921 |
REGISTER unsigned char *cp;
|
|
|
922 |
REGISTER int index, max;
|
|
|
923 |
int len;
|
|
|
924 |
|
|
|
925 |
if (_qClass(self) == ByteArray) {
|
|
155
|
926 |
max = 0;
|
|
|
927 |
index = 0;
|
|
|
928 |
len = _qSize(self) - OHDR_SIZE;
|
|
|
929 |
cp = &(_ByteArrayInstPtr(self)->ba_element[0]);
|
|
|
930 |
while (++index <= len) {
|
|
|
931 |
if (*cp > max) max = *cp;
|
|
|
932 |
cp++;
|
|
|
933 |
}
|
|
|
934 |
RETURN ( _MKSMALLINT(max) );
|
|
1
|
935 |
}
|
|
155
|
936 |
%}.
|
|
|
937 |
^ super max
|
|
129
|
938 |
|
|
|
939 |
"
|
|
155
|
940 |
#[1 2 3 1 2 3 1 2 19] max
|
|
129
|
941 |
"
|
|
1
|
942 |
! !
|
|
|
943 |
|
|
92
|
944 |
!ByteArray methodsFor:'copying'!
|
|
|
945 |
|
|
|
946 |
copyFrom:start to:stop
|
|
|
947 |
"return the subcollection starting at index start, anInteger and ending
|
|
|
948 |
at stop, anInteger.
|
|
|
949 |
- reimplemented here for speed"
|
|
|
950 |
|
|
|
951 |
%{ /* NOCONTEXT */
|
|
|
952 |
|
|
|
953 |
#if !defined(FAST_MEMCPY)
|
|
|
954 |
REGISTER unsigned char *srcp;
|
|
|
955 |
#endif
|
|
|
956 |
REGISTER unsigned char *dstp;
|
|
|
957 |
REGISTER int count;
|
|
|
958 |
int len, index1, index2, sz;
|
|
|
959 |
OBJ newByteArray;
|
|
|
960 |
|
|
|
961 |
if (__isByteArray(self)
|
|
|
962 |
&& _isSmallInteger(start)
|
|
|
963 |
&& _isSmallInteger(stop)) {
|
|
155
|
964 |
len = _byteArraySize(self);
|
|
|
965 |
index1 = _intVal(start);
|
|
|
966 |
index2 = _intVal(stop);
|
|
92
|
967 |
|
|
155
|
968 |
if ((index1 <= index2) && (index1 > 0)) {
|
|
|
969 |
if (index2 <= len) {
|
|
|
970 |
count = index2 - index1 + 1;
|
|
|
971 |
PROTECT_CONTEXT
|
|
|
972 |
sz = OHDR_SIZE + count;
|
|
|
973 |
_qNew(newByteArray, sz, SENDER);
|
|
|
974 |
UNPROTECT_CONTEXT
|
|
|
975 |
if (newByteArray != nil) {
|
|
|
976 |
_InstPtr(newByteArray)->o_class = ByteArray;
|
|
|
977 |
dstp = _ByteArrayInstPtr(newByteArray)->ba_element;
|
|
92
|
978 |
#ifdef FAST_MEMCPY
|
|
155
|
979 |
bcopy(_ByteArrayInstPtr(self)->ba_element + index1 - 1, dstp, count);
|
|
92
|
980 |
#else
|
|
155
|
981 |
srcp = _ByteArrayInstPtr(self)->ba_element + index1 - 1;
|
|
|
982 |
while (count--) {
|
|
|
983 |
*dstp++ = *srcp++;
|
|
|
984 |
}
|
|
92
|
985 |
#endif
|
|
155
|
986 |
RETURN ( newByteArray );
|
|
|
987 |
}
|
|
|
988 |
}
|
|
|
989 |
}
|
|
92
|
990 |
}
|
|
|
991 |
%}.
|
|
|
992 |
"
|
|
|
993 |
fall back in case of non-integer index or out-of-bound index;
|
|
|
994 |
will eventually lead to an out-of-bound signal raise
|
|
|
995 |
"
|
|
|
996 |
^ super copyFrom:start to:stop
|
|
|
997 |
! !
|
|
|
998 |
|
|
1
|
999 |
!ByteArray methodsFor:'filling and replacing'!
|
|
|
1000 |
|
|
155
|
1001 |
from:start to:stop put:aNumber
|
|
|
1002 |
"fill part of the receiver with aNumber.
|
|
|
1003 |
- reimplemented here for speed"
|
|
|
1004 |
|
|
|
1005 |
%{ /* NOCONTEXT */
|
|
|
1006 |
|
|
|
1007 |
#ifndef FAST_MEMSET
|
|
|
1008 |
REGISTER unsigned char *dstp;
|
|
|
1009 |
#endif
|
|
|
1010 |
REGISTER int count, value;
|
|
|
1011 |
int len, index1, index2, sz;
|
|
|
1012 |
|
|
|
1013 |
if (__isByteArray(self)
|
|
|
1014 |
&& _isSmallInteger(aNumber)
|
|
|
1015 |
&& _isSmallInteger(start)
|
|
|
1016 |
&& _isSmallInteger(stop)) {
|
|
|
1017 |
len = _byteArraySize(self);
|
|
|
1018 |
index1 = _intVal(start);
|
|
|
1019 |
index2 = _intVal(stop);
|
|
|
1020 |
|
|
|
1021 |
value = _intVal(aNumber);
|
|
|
1022 |
if ((value >= 0)
|
|
|
1023 |
&& (value <= 255)
|
|
|
1024 |
&& (index1 <= index2)
|
|
|
1025 |
&& (index1 > 0)) {
|
|
|
1026 |
if (index2 <= len) {
|
|
|
1027 |
count = index2 - index1 + 1;
|
|
|
1028 |
#ifdef FAST_MEMSET
|
|
|
1029 |
memset(_ByteArrayInstPtr(self)->ba_element + index1 - 1, count, value);
|
|
|
1030 |
#else
|
|
|
1031 |
dstp = _ByteArrayInstPtr(self)->ba_element + index1 - 1;
|
|
|
1032 |
while (count--) {
|
|
|
1033 |
*dstp++ = value;
|
|
|
1034 |
}
|
|
|
1035 |
#endif
|
|
|
1036 |
RETURN (self);
|
|
|
1037 |
}
|
|
|
1038 |
}
|
|
|
1039 |
}
|
|
|
1040 |
%}.
|
|
|
1041 |
"
|
|
|
1042 |
fall back in case of non-integer index or out-of-bound index/value;
|
|
|
1043 |
will eventually lead to an out-of-bound signal raise
|
|
|
1044 |
"
|
|
|
1045 |
^ super from:start to:stop put:aNumber
|
|
|
1046 |
!
|
|
|
1047 |
|
|
1
|
1048 |
replaceFrom:start to:stop with:aCollection startingAt:repStart
|
|
|
1049 |
"reimplemented for speed"
|
|
|
1050 |
|
|
54
|
1051 |
%{ /* NOCONTEXT */
|
|
1
|
1052 |
|
|
54
|
1053 |
int nIndex, repNIndex;
|
|
|
1054 |
int startIndex, stopIndex;
|
|
|
1055 |
REGISTER unsigned char *src;
|
|
|
1056 |
REGISTER int repStartIndex;
|
|
|
1057 |
int repStopIndex, count;
|
|
|
1058 |
REGISTER unsigned char *dst;
|
|
1
|
1059 |
|
|
54
|
1060 |
if ((_qClass(self) == ByteArray)
|
|
|
1061 |
&& (_Class(aCollection) == ByteArray)
|
|
|
1062 |
&& _isSmallInteger(start)
|
|
|
1063 |
&& _isSmallInteger(stop)
|
|
|
1064 |
&& _isSmallInteger(repStart)) {
|
|
155
|
1065 |
startIndex = _intVal(start) - 1;
|
|
|
1066 |
if (startIndex >= 0) {
|
|
|
1067 |
nIndex = _qSize(self) - OHDR_SIZE;
|
|
|
1068 |
stopIndex = _intVal(stop) - 1;
|
|
|
1069 |
count = stopIndex - startIndex + 1;
|
|
|
1070 |
if (count == 0) {
|
|
|
1071 |
RETURN ( self );
|
|
|
1072 |
}
|
|
|
1073 |
if ((count > 0) && (stopIndex < nIndex)) {
|
|
|
1074 |
repStartIndex = _intVal(repStart) - 1;
|
|
|
1075 |
if (repStartIndex >= 0) {
|
|
|
1076 |
repNIndex = _qSize(aCollection) - OHDR_SIZE;
|
|
|
1077 |
repStopIndex = repStartIndex + (stopIndex - startIndex);
|
|
|
1078 |
if (repStopIndex < repNIndex) {
|
|
|
1079 |
src = &(_ByteArrayInstPtr(aCollection)->ba_element[repStartIndex]);
|
|
|
1080 |
dst = &(_ByteArrayInstPtr(self)->ba_element[startIndex]);
|
|
1
|
1081 |
|
|
155
|
1082 |
if (aCollection == self) {
|
|
|
1083 |
/* take care of overlapping copy */
|
|
|
1084 |
if (src < dst) {
|
|
|
1085 |
/* must do a reverse copy */
|
|
|
1086 |
src += count;
|
|
|
1087 |
dst += count;
|
|
|
1088 |
while (count-- > 0) {
|
|
|
1089 |
*--dst = *--src;
|
|
|
1090 |
}
|
|
|
1091 |
RETURN ( self );
|
|
|
1092 |
}
|
|
|
1093 |
}
|
|
1
|
1094 |
#ifdef FAST_MEMCPY
|
|
166
|
1095 |
# ifdef bcopy4
|
|
|
1096 |
if (((src & 3) == 0)
|
|
|
1097 |
&& ((dst & 3) == 0)) {
|
|
|
1098 |
/* copy aligned part */
|
|
|
1099 |
bcopy4(src, dst, count//4);
|
|
|
1100 |
/* copy rest */
|
|
|
1101 |
if (count & 3) {
|
|
|
1102 |
src += (count & ~3);
|
|
|
1103 |
dst += (count & ~3);
|
|
|
1104 |
count = count & 3;
|
|
|
1105 |
while (count--) {
|
|
|
1106 |
*dst++ = *src++;
|
|
|
1107 |
}
|
|
|
1108 |
}
|
|
|
1109 |
} else
|
|
|
1110 |
# endif /* bcopy4 */
|
|
|
1111 |
bcopy(src, dst, count);
|
|
1
|
1112 |
#else
|
|
155
|
1113 |
while (count-- > 0) {
|
|
|
1114 |
*dst++ = *src++;
|
|
|
1115 |
}
|
|
1
|
1116 |
#endif
|
|
155
|
1117 |
RETURN ( self );
|
|
|
1118 |
}
|
|
|
1119 |
}
|
|
|
1120 |
}
|
|
|
1121 |
}
|
|
54
|
1122 |
}
|
|
1
|
1123 |
%}
|
|
|
1124 |
.
|
|
|
1125 |
^ super replaceFrom:start to:stop with:aCollection startingAt:repStart
|
|
|
1126 |
! !
|
|
|
1127 |
|
|
129
|
1128 |
!ByteArray methodsFor:'image manipulation support'!
|
|
1
|
1129 |
|
|
|
1130 |
invert
|
|
|
1131 |
"invert all bytes - used with image manipulations
|
|
54
|
1132 |
written as a primitive for speed.
|
|
|
1133 |
Q: is this really needed ?"
|
|
1
|
1134 |
|
|
|
1135 |
%{ /* NOCONTEXT */
|
|
|
1136 |
|
|
|
1137 |
REGISTER unsigned char *dst;
|
|
|
1138 |
REGISTER unsigned long *ldst;
|
|
|
1139 |
REGISTER int cnt;
|
|
|
1140 |
|
|
|
1141 |
if (_qClass(self) == ByteArray) {
|
|
155
|
1142 |
cnt = _qSize(self) - OHDR_SIZE;
|
|
|
1143 |
dst = _ByteArrayInstPtr(self)->ba_element;
|
|
|
1144 |
if (! ((int)dst & (sizeof(long)-1))) {
|
|
|
1145 |
ldst = (unsigned long *)dst;
|
|
|
1146 |
while (cnt >= sizeof(long)) {
|
|
|
1147 |
*ldst = ~(*ldst);
|
|
|
1148 |
ldst++;
|
|
|
1149 |
cnt -= sizeof(long);
|
|
|
1150 |
}
|
|
|
1151 |
dst = (unsigned char *)ldst;
|
|
|
1152 |
}
|
|
|
1153 |
while (cnt--) {
|
|
|
1154 |
*dst = ~(*dst);
|
|
|
1155 |
dst++;
|
|
|
1156 |
}
|
|
|
1157 |
RETURN ( self );
|
|
1
|
1158 |
}
|
|
|
1159 |
%}
|
|
|
1160 |
.
|
|
|
1161 |
self primitiveFailed
|
|
|
1162 |
!
|
|
|
1163 |
|
|
12
|
1164 |
reverse
|
|
|
1165 |
"reverse order of elements inplace -
|
|
129
|
1166 |
written as a primitive for speed on image manipulations (mirror)"
|
|
12
|
1167 |
|
|
|
1168 |
%{ /* NOCONTEXT */
|
|
|
1169 |
|
|
|
1170 |
REGISTER unsigned char *p1, *p2;
|
|
|
1171 |
REGISTER int cnt;
|
|
|
1172 |
REGISTER unsigned t;
|
|
|
1173 |
|
|
|
1174 |
if (_qClass(self) == ByteArray) {
|
|
155
|
1175 |
cnt = _qSize(self) - OHDR_SIZE;
|
|
|
1176 |
p1 = _ByteArrayInstPtr(self)->ba_element;
|
|
|
1177 |
p2 = _ByteArrayInstPtr(self)->ba_element + cnt - 1;
|
|
|
1178 |
while (cnt > 0) {
|
|
|
1179 |
t = *p1;
|
|
|
1180 |
*p1++ = *p2;
|
|
|
1181 |
*p2-- = t;
|
|
|
1182 |
cnt-=2;
|
|
|
1183 |
}
|
|
|
1184 |
RETURN ( self );
|
|
12
|
1185 |
}
|
|
|
1186 |
%}
|
|
|
1187 |
.
|
|
|
1188 |
^ super reverse
|
|
|
1189 |
!
|
|
|
1190 |
|
|
1
|
1191 |
expandPixels:nBitsPerPixel width:width height:height into:aByteArray
|
|
155
|
1192 |
mapping:aMapByteArray
|
|
54
|
1193 |
|
|
1
|
1194 |
"given the receiver with nBitsPerPixel-depth pixels, expand them into
|
|
|
1195 |
aByteArray with 8-bit pixels. The width/height-arguments are needed
|
|
|
1196 |
to skip any padded src-bits. On the fly, the destination pixels
|
|
129
|
1197 |
are translated using aMapByteArray (if non-nil).
|
|
|
1198 |
Input bits are read left-to right, i.e. the first byte in the output
|
|
|
1199 |
corresponds to the high bit(s) in the inputs first byte.
|
|
|
1200 |
This is used to display mono, 2-bit and 4-bit bitmaps on grey-scale/color
|
|
|
1201 |
machines. With nBitsPerPixel==8, this is a translate operation.
|
|
|
1202 |
Notice that smalltalk indexing begins at 1; thus the map-index for a byte
|
|
|
1203 |
value of n is found in map at:(n + 1).
|
|
|
1204 |
It can also be used to expand bit-arrays into byteArrays.
|
|
|
1205 |
This method is specialized for ByteArray arguments - it will not handle
|
|
|
1206 |
anything else."
|
|
1
|
1207 |
|
|
|
1208 |
%{ /* NOCONTEXT */
|
|
|
1209 |
|
|
54
|
1210 |
REGISTER unsigned char *src, *dst;
|
|
|
1211 |
REGISTER int wrun;
|
|
|
1212 |
unsigned char *srcNext;
|
|
|
1213 |
int bytesPerRow, mask, shift0, shift;
|
|
|
1214 |
int w, h, hrun;
|
|
|
1215 |
int srcBytes, dstBytes;
|
|
|
1216 |
int bitsPerPixel;
|
|
|
1217 |
int bits;
|
|
|
1218 |
int ncells;
|
|
|
1219 |
unsigned char *map;
|
|
1
|
1220 |
|
|
54
|
1221 |
if ((_qClass(self) == ByteArray)
|
|
|
1222 |
&& (_qClass(aByteArray) == ByteArray)
|
|
|
1223 |
&& _isSmallInteger(nBitsPerPixel)
|
|
|
1224 |
&& _isSmallInteger(height)
|
|
|
1225 |
&& _isSmallInteger(width)) {
|
|
155
|
1226 |
if ((aMapByteArray != nil)
|
|
|
1227 |
&& (_Class(aMapByteArray) == ByteArray)) {
|
|
|
1228 |
map = _ByteArrayInstPtr(aMapByteArray)->ba_element;
|
|
|
1229 |
} else {
|
|
|
1230 |
map = (unsigned char *)0;
|
|
|
1231 |
}
|
|
1
|
1232 |
|
|
155
|
1233 |
bitsPerPixel = _intVal(nBitsPerPixel);
|
|
|
1234 |
w = _intVal(width);
|
|
|
1235 |
h = _intVal(height);
|
|
|
1236 |
src = _ByteArrayInstPtr(self)->ba_element;
|
|
|
1237 |
dst = _ByteArrayInstPtr(aByteArray)->ba_element;
|
|
|
1238 |
switch (bitsPerPixel) {
|
|
|
1239 |
case 1:
|
|
|
1240 |
mask = 0x01;
|
|
|
1241 |
break;
|
|
|
1242 |
case 2:
|
|
|
1243 |
mask = 0x03;
|
|
|
1244 |
break;
|
|
|
1245 |
case 4:
|
|
|
1246 |
mask = 0x0F;
|
|
|
1247 |
break;
|
|
|
1248 |
case 8:
|
|
|
1249 |
mask = 0xFF;
|
|
|
1250 |
break;
|
|
|
1251 |
default:
|
|
|
1252 |
goto fail;
|
|
|
1253 |
}
|
|
|
1254 |
ncells = mask + 1;
|
|
|
1255 |
if (map) {
|
|
|
1256 |
/*
|
|
|
1257 |
* if a map is present, it must have the correct size
|
|
|
1258 |
* (i.e. 2 raisedTo:nBitsPerPixel)
|
|
|
1259 |
*/
|
|
|
1260 |
if ((_qSize(aMapByteArray) - OHDR_SIZE) < ncells)
|
|
|
1261 |
goto fail;
|
|
|
1262 |
}
|
|
1
|
1263 |
|
|
155
|
1264 |
bytesPerRow = (w * bitsPerPixel + 7) / 8;
|
|
|
1265 |
shift0 = 8 - bitsPerPixel;
|
|
|
1266 |
srcBytes = bytesPerRow * h;
|
|
|
1267 |
dstBytes = w * h;
|
|
1
|
1268 |
|
|
155
|
1269 |
if (((_qSize(self) - OHDR_SIZE) >= srcBytes)
|
|
|
1270 |
&& ((_qSize(aByteArray) - OHDR_SIZE) >= dstBytes)) {
|
|
|
1271 |
for (hrun=h; hrun; hrun--) {
|
|
|
1272 |
srcNext = src + bytesPerRow;
|
|
|
1273 |
shift = shift0;
|
|
|
1274 |
if (map) {
|
|
|
1275 |
for (wrun=w; wrun; wrun--) {
|
|
|
1276 |
if (shift == shift0) {
|
|
|
1277 |
bits = *src++;
|
|
|
1278 |
}
|
|
|
1279 |
*dst++ = map[(bits >> shift) & mask];
|
|
|
1280 |
shift -= bitsPerPixel;
|
|
|
1281 |
if (shift < 0) {
|
|
|
1282 |
shift = shift0;
|
|
|
1283 |
}
|
|
|
1284 |
}
|
|
|
1285 |
} else {
|
|
|
1286 |
for (wrun=w; wrun; wrun--) {
|
|
|
1287 |
if (shift == shift0) {
|
|
|
1288 |
bits = *src++;
|
|
|
1289 |
}
|
|
|
1290 |
*dst++ = (bits >> shift) & mask;
|
|
|
1291 |
shift -= bitsPerPixel;
|
|
|
1292 |
if (shift < 0) {
|
|
|
1293 |
shift = shift0;
|
|
|
1294 |
}
|
|
|
1295 |
}
|
|
|
1296 |
}
|
|
|
1297 |
src = srcNext;
|
|
|
1298 |
}
|
|
|
1299 |
RETURN ( self );
|
|
|
1300 |
}
|
|
1
|
1301 |
}
|
|
|
1302 |
fail: ;
|
|
|
1303 |
%}
|
|
|
1304 |
.
|
|
|
1305 |
self primitiveFailed
|
|
129
|
1306 |
|
|
|
1307 |
"Example1:
|
|
|
1308 |
expand 1-bit-per-pixel bitmap into a 1byte-per-pixel byteArray
|
|
|
1309 |
"
|
|
|
1310 |
"
|
|
|
1311 |
|inBits outBits|
|
|
|
1312 |
|
|
|
1313 |
inBits := #[2r11110000
|
|
155
|
1314 |
2r11001100
|
|
|
1315 |
2r01010101
|
|
|
1316 |
2r00001111].
|
|
129
|
1317 |
outBits := ByteArray new:(8*4).
|
|
|
1318 |
inBits expandPixels:1 width:8 height:4
|
|
155
|
1319 |
into:outBits mapping:nil.
|
|
129
|
1320 |
outBits inspect
|
|
|
1321 |
"
|
|
|
1322 |
|
|
|
1323 |
"Example2:
|
|
|
1324 |
expand bit-array into a byteArray, translating 0-bits to 99,
|
|
|
1325 |
1-bits to 176. (just a stupid example)
|
|
|
1326 |
"
|
|
|
1327 |
"
|
|
|
1328 |
|inBits outBits|
|
|
|
1329 |
|
|
|
1330 |
inBits := #[2r11110000 2r11001100].
|
|
|
1331 |
outBits := ByteArray new:16.
|
|
|
1332 |
inBits expandPixels:1 width:16 height:1
|
|
155
|
1333 |
into:outBits mapping:#[99 176].
|
|
129
|
1334 |
outBits inspect
|
|
|
1335 |
"
|
|
|
1336 |
!
|
|
|
1337 |
|
|
|
1338 |
compressPixels:nBitsPerPixel width:width height:height into:aByteArray
|
|
155
|
1339 |
mapping:aMapByteArray
|
|
129
|
1340 |
|
|
|
1341 |
"given the receiver with 8-bit pixels, compress them into aByteArray
|
|
|
1342 |
with nBitsPerPixel-depth pixels. The width/height-arguments are needed
|
|
|
1343 |
to allow for any padding. On the fly, the source bytes are translated
|
|
|
1344 |
using aMapByteArray (if non-nil).
|
|
|
1345 |
Notice that smalltalk indexing begins at 1; thus the map-index for a byte
|
|
|
1346 |
value of n is found in map at:(n + 1).
|
|
|
1347 |
Output bits are filled left-to right, i.e. the first byte in the input
|
|
|
1348 |
corresponds to the high bit(s) if the first byte in the input.
|
|
|
1349 |
This method can be used to convert 8-bit image data to mono, 2-bit and 4-bit
|
|
|
1350 |
bitmaps.
|
|
|
1351 |
It can also be used to compress byte-arrays into bitArrays."
|
|
|
1352 |
|
|
|
1353 |
%{ /* NOCONTEXT */
|
|
|
1354 |
|
|
|
1355 |
REGISTER unsigned char *src, *dst;
|
|
|
1356 |
REGISTER int wrun;
|
|
|
1357 |
unsigned char *dstNext;
|
|
|
1358 |
int bytesPerRow, mask, shift0, shift;
|
|
|
1359 |
int w, h, hrun;
|
|
|
1360 |
int srcBytes, dstBytes;
|
|
|
1361 |
int bitsPerPixel;
|
|
|
1362 |
int bits;
|
|
|
1363 |
int ncells;
|
|
|
1364 |
unsigned char *map;
|
|
|
1365 |
|
|
|
1366 |
if ((_qClass(self) == ByteArray)
|
|
|
1367 |
&& (_qClass(aByteArray) == ByteArray)
|
|
|
1368 |
&& _isSmallInteger(nBitsPerPixel)
|
|
|
1369 |
&& _isSmallInteger(height)
|
|
|
1370 |
&& _isSmallInteger(width)) {
|
|
155
|
1371 |
if ((aMapByteArray != nil)
|
|
|
1372 |
&& (_Class(aMapByteArray) == ByteArray)) {
|
|
|
1373 |
map = _ByteArrayInstPtr(aMapByteArray)->ba_element;
|
|
|
1374 |
} else {
|
|
|
1375 |
map = (unsigned char *)0;
|
|
|
1376 |
}
|
|
129
|
1377 |
|
|
155
|
1378 |
bitsPerPixel = _intVal(nBitsPerPixel);
|
|
|
1379 |
w = _intVal(width);
|
|
|
1380 |
h = _intVal(height);
|
|
|
1381 |
src = _ByteArrayInstPtr(self)->ba_element;
|
|
|
1382 |
dst = _ByteArrayInstPtr(aByteArray)->ba_element;
|
|
|
1383 |
switch (bitsPerPixel) {
|
|
|
1384 |
case 1:
|
|
|
1385 |
mask = 0x01;
|
|
|
1386 |
break;
|
|
|
1387 |
case 2:
|
|
|
1388 |
mask = 0x03;
|
|
|
1389 |
break;
|
|
|
1390 |
case 4:
|
|
|
1391 |
mask = 0x0F;
|
|
|
1392 |
break;
|
|
|
1393 |
case 8:
|
|
|
1394 |
mask = 0xFF;
|
|
|
1395 |
break;
|
|
|
1396 |
default:
|
|
|
1397 |
goto fail;
|
|
|
1398 |
}
|
|
|
1399 |
if (map) {
|
|
|
1400 |
/*
|
|
|
1401 |
* if a map is present, it must have entries for
|
|
|
1402 |
* all possible byte-values (i.e. its size must be >= 256)
|
|
|
1403 |
*/
|
|
|
1404 |
if ((_qSize(aMapByteArray) - OHDR_SIZE) < 256)
|
|
|
1405 |
goto fail;
|
|
|
1406 |
}
|
|
129
|
1407 |
|
|
155
|
1408 |
bytesPerRow = (w * bitsPerPixel + 7) / 8;
|
|
|
1409 |
dstBytes = bytesPerRow * h;
|
|
|
1410 |
srcBytes = w * h;
|
|
129
|
1411 |
|
|
155
|
1412 |
if (((_qSize(self) - OHDR_SIZE) >= srcBytes)
|
|
|
1413 |
&& ((_qSize(aByteArray) - OHDR_SIZE) >= dstBytes)) {
|
|
|
1414 |
for (hrun=h; hrun; hrun--) {
|
|
|
1415 |
dstNext = dst + bytesPerRow;
|
|
|
1416 |
bits = 0; shift = 8;
|
|
|
1417 |
if (map) {
|
|
|
1418 |
for (wrun=w; wrun; wrun--) {
|
|
|
1419 |
bits = (bits << bitsPerPixel) | (map[*src++] & mask);
|
|
|
1420 |
shift -= bitsPerPixel;
|
|
|
1421 |
if (shift == 0) {
|
|
|
1422 |
*dst++ = bits;
|
|
|
1423 |
bits = 0; shift = 8;
|
|
|
1424 |
}
|
|
|
1425 |
}
|
|
|
1426 |
} else {
|
|
|
1427 |
for (wrun=w; wrun; wrun--) {
|
|
|
1428 |
bits = (bits << bitsPerPixel) | (*src++ & mask);
|
|
|
1429 |
shift -= bitsPerPixel;
|
|
|
1430 |
if (shift == 0) {
|
|
|
1431 |
*dst++ = bits;
|
|
|
1432 |
bits = 0; shift = 8;
|
|
|
1433 |
}
|
|
|
1434 |
}
|
|
|
1435 |
}
|
|
|
1436 |
if (shift != 8) {
|
|
|
1437 |
*dst = bits;
|
|
|
1438 |
}
|
|
|
1439 |
dst = dstNext;
|
|
|
1440 |
}
|
|
|
1441 |
RETURN ( self );
|
|
|
1442 |
}
|
|
129
|
1443 |
}
|
|
|
1444 |
fail: ;
|
|
|
1445 |
%}
|
|
|
1446 |
.
|
|
|
1447 |
self primitiveFailed
|
|
|
1448 |
|
|
|
1449 |
"Example1:
|
|
|
1450 |
compress 1 byte-per-pixel bitmap to 1-bit-per-pixel bitmap
|
|
|
1451 |
"
|
|
|
1452 |
"
|
|
|
1453 |
|inBits outBits|
|
|
|
1454 |
|
|
|
1455 |
inBits := #[0 0 0 0 1 1 1 1
|
|
155
|
1456 |
0 0 1 1 0 0 1 1
|
|
|
1457 |
0 1 0 1 0 1 0 1
|
|
|
1458 |
1 1 1 1 0 0 0 0].
|
|
129
|
1459 |
outBits := ByteArray new:4.
|
|
|
1460 |
inBits compressPixels:1 width:8 height:4
|
|
155
|
1461 |
into:outBits mapping:nil.
|
|
129
|
1462 |
outBits inspect
|
|
|
1463 |
"
|
|
|
1464 |
|
|
|
1465 |
"Example2:
|
|
|
1466 |
compress byte-array into a bitArray, translating 99 to 0-bits,
|
|
|
1467 |
and 176 to 1-bits. (just a stupid example)
|
|
|
1468 |
"
|
|
|
1469 |
"
|
|
|
1470 |
|inBits outBits map|
|
|
|
1471 |
|
|
|
1472 |
inBits := #[176 176 176 176 99 99 99 99 176 176 99 99 176 99 176 99].
|
|
|
1473 |
map := ByteArray new:256.
|
|
|
1474 |
map at:176+1 put:1.
|
|
|
1475 |
|
|
|
1476 |
outBits := ByteArray new:2.
|
|
|
1477 |
inBits compressPixels:1 width:16 height:1
|
|
155
|
1478 |
into:outBits mapping:map.
|
|
129
|
1479 |
outBits inspect
|
|
|
1480 |
"
|
|
|
1481 |
|
|
|
1482 |
"Example3:
|
|
|
1483 |
compress byte-array into a bitArray, translating everything below 128 to 0-bits,
|
|
|
1484 |
and 128 to 255 to 1-bits.99 to 0-bits (another stupid example)
|
|
|
1485 |
"
|
|
|
1486 |
"
|
|
|
1487 |
|inBits outBits map|
|
|
|
1488 |
|
|
|
1489 |
inBits := #[176 176 176 176 99 99 99 99 176 176 99 99 176 99 176 99].
|
|
|
1490 |
map := ByteArray new:256.
|
|
|
1491 |
map atAll:(128+1 to:255+1) put:1.
|
|
|
1492 |
|
|
|
1493 |
outBits := ByteArray new:2.
|
|
|
1494 |
inBits compressPixels:1 width:16 height:1
|
|
155
|
1495 |
into:outBits mapping:map.
|
|
129
|
1496 |
outBits inspect
|
|
|
1497 |
"
|
|
1
|
1498 |
! !
|
|
129
|
1499 |
|
|
|
1500 |
|