|
1
|
1 |
"
|
|
5
|
2 |
COPYRIGHT (c) 1988 by Claus Gittinger
|
|
1
|
3 |
All Rights Reserved
|
|
|
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 |
|
|
|
13 |
Integer subclass:#SmallInteger
|
|
|
14 |
instanceVariableNames:''
|
|
|
15 |
classVariableNames:''
|
|
|
16 |
poolDictionaries:''
|
|
|
17 |
category:'Magnitude-Numbers'
|
|
|
18 |
!
|
|
|
19 |
|
|
|
20 |
SmallInteger comment:'
|
|
|
21 |
|
|
5
|
22 |
COPYRIGHT (c) 1988 by Claus Gittinger
|
|
1
|
23 |
All Rights Reserved
|
|
|
24 |
|
|
85
|
25 |
$Header: /cvs/stx/stx/libbasic/SmallInteger.st,v 1.13 1994-06-02 11:21:37 claus Exp $
|
|
68
|
26 |
'!
|
|
|
27 |
|
|
|
28 |
!SmallInteger class methodsFor:'documentation'!
|
|
1
|
29 |
|
|
68
|
30 |
documentation
|
|
|
31 |
"
|
|
|
32 |
SmallIntegers are Integers in the range of +/- 2^30 (i.e. 31 bits, which is
|
|
|
33 |
not guaranteed).
|
|
|
34 |
These are no real objects - they have no instances (not even storage !!)
|
|
|
35 |
and cannot be subclassed.
|
|
|
36 |
|
|
|
37 |
The reason is to save both storage and runtime by not collecting
|
|
|
38 |
SmallIntegers in the system. SmallInts are marked by having the TAG_INT
|
|
|
39 |
bit set, in contrast to all other objects which do not. Since this knowledge
|
|
|
40 |
is hardwired into the system (an there is no class-field stored with
|
|
|
41 |
SmallIntegers) there can be no subclass of SmallInteger (sorry).
|
|
|
42 |
"
|
|
|
43 |
! !
|
|
1
|
44 |
|
|
|
45 |
!SmallInteger class methodsFor:'instance creation'!
|
|
|
46 |
|
|
|
47 |
basicNew
|
|
|
48 |
"catch instance creation
|
|
|
49 |
- SmallIntegers cannot be created with new"
|
|
|
50 |
|
|
|
51 |
self error:'instances of SmallInteger cannot be created with new'
|
|
|
52 |
!
|
|
|
53 |
|
|
|
54 |
basicNew:size
|
|
|
55 |
"catch instance creation
|
|
|
56 |
- SmallIntegers cannot be created with new"
|
|
|
57 |
|
|
|
58 |
self error:'instances of SmallInteger cannot be created with new'
|
|
|
59 |
! !
|
|
|
60 |
|
|
|
61 |
!SmallInteger class methodsFor:'constants'!
|
|
|
62 |
|
|
|
63 |
maxBits
|
|
68
|
64 |
"return the number of bits in instances of me.
|
|
|
65 |
For very special uses only - not constant across implementations"
|
|
1
|
66 |
|
|
|
67 |
%{ /* NOCONTEXT */
|
|
|
68 |
RETURN ( _MKSMALLINT(N_INT_BITS) );
|
|
|
69 |
%}
|
|
2
|
70 |
|
|
|
71 |
"SmallInteger maxBits"
|
|
1
|
72 |
!
|
|
|
73 |
|
|
|
74 |
maxBytes
|
|
68
|
75 |
"return the number of bytes in instances of me.
|
|
|
76 |
For very special uses only - not constant across implementations"
|
|
1
|
77 |
|
|
|
78 |
%{ /* NOCONTEXT */
|
|
|
79 |
RETURN ( _MKSMALLINT(N_INT_BITS / 8 + 1) );
|
|
|
80 |
%}
|
|
2
|
81 |
|
|
|
82 |
"SmallInteger maxBytes"
|
|
1
|
83 |
!
|
|
|
84 |
|
|
|
85 |
minVal
|
|
68
|
86 |
"return the smallest Integer representable as SmallInteger.
|
|
|
87 |
For very special uses only - not constant across implementations"
|
|
1
|
88 |
|
|
|
89 |
%{ /* NOCONTEXT */
|
|
|
90 |
RETURN ( _MKSMALLINT(_MIN_INT) );
|
|
|
91 |
%}
|
|
2
|
92 |
|
|
|
93 |
"SmallInteger minVal"
|
|
1
|
94 |
!
|
|
|
95 |
|
|
|
96 |
maxVal
|
|
68
|
97 |
"return the largest Integer representable as SmallInteger.
|
|
|
98 |
For very special uses only - not constant across implementations"
|
|
1
|
99 |
|
|
|
100 |
%{ /* NOCONTEXT */
|
|
|
101 |
RETURN ( _MKSMALLINT(_MAX_INT) );
|
|
|
102 |
%}
|
|
2
|
103 |
|
|
|
104 |
"SmallInteger maxVal"
|
|
1
|
105 |
! !
|
|
|
106 |
|
|
3
|
107 |
!SmallInteger class methodsFor:'queries'!
|
|
|
108 |
|
|
|
109 |
isBuiltInClass
|
|
|
110 |
"this class is known by the run-time-system"
|
|
|
111 |
|
|
|
112 |
^ true
|
|
50
|
113 |
!
|
|
|
114 |
|
|
|
115 |
canBeSubclassed
|
|
|
116 |
"return true, if its allowed to create subclasses of the receiver.
|
|
68
|
117 |
Return nil here - since it is NOT possible for SmallInteger"
|
|
50
|
118 |
|
|
|
119 |
^ false
|
|
3
|
120 |
! !
|
|
|
121 |
|
|
62
|
122 |
!SmallInteger methodsFor:'catching messages'!
|
|
1
|
123 |
|
|
|
124 |
basicAt:index
|
|
|
125 |
"catch indexed access - report an error
|
|
68
|
126 |
defined here since basicAt: in Object ommits the SmallInteger check."
|
|
1
|
127 |
|
|
|
128 |
self notIndexed
|
|
|
129 |
!
|
|
|
130 |
|
|
|
131 |
basicAt:index put:anObject
|
|
|
132 |
"catch indexed access - report an error
|
|
68
|
133 |
defined here since basicAt:put: in Object ommits the SmallInteger check."
|
|
1
|
134 |
|
|
|
135 |
self notIndexed
|
|
|
136 |
!
|
|
|
137 |
|
|
|
138 |
size
|
|
62
|
139 |
"return the number of indexed instvars - SmallIntegers have none."
|
|
1
|
140 |
|
|
|
141 |
^ 0
|
|
|
142 |
!
|
|
|
143 |
|
|
|
144 |
basicSize
|
|
62
|
145 |
"return the number of indexed instvars - SmallIntegers have none.
|
|
68
|
146 |
Defined here since basicSize in Object ommits the SmallInteger check."
|
|
1
|
147 |
|
|
|
148 |
^ 0
|
|
|
149 |
! !
|
|
|
150 |
|
|
|
151 |
!SmallInteger methodsFor:'copying'!
|
|
|
152 |
|
|
|
153 |
shallowCopy
|
|
|
154 |
"return a shallow copy of myself
|
|
2
|
155 |
- reimplemented here since smallintegers are unique"
|
|
1
|
156 |
|
|
|
157 |
^ self
|
|
|
158 |
!
|
|
|
159 |
|
|
13
|
160 |
simpleDeepCopy
|
|
|
161 |
"return a deep copy of myself
|
|
|
162 |
- reimplemented here since smallintegers are unique"
|
|
|
163 |
|
|
|
164 |
^ self
|
|
|
165 |
!
|
|
|
166 |
|
|
|
167 |
deepCopyUsing:aDictionary
|
|
|
168 |
"return a deep copy of myself
|
|
|
169 |
- reimplemented here since smallintegers are unique"
|
|
|
170 |
|
|
|
171 |
^ self
|
|
|
172 |
!
|
|
|
173 |
|
|
1
|
174 |
deepCopy
|
|
|
175 |
"return a deep copy of myself
|
|
2
|
176 |
- reimplemented here since smallintegers are unique"
|
|
1
|
177 |
|
|
|
178 |
^ self
|
|
|
179 |
! !
|
|
|
180 |
|
|
|
181 |
!SmallInteger methodsFor:'comparing'!
|
|
|
182 |
|
|
|
183 |
= aNumber
|
|
|
184 |
"return true, if the arguments value is equal to mine"
|
|
|
185 |
|
|
|
186 |
%{ /* NOCONTEXT */
|
|
|
187 |
|
|
|
188 |
if (aNumber == self) {
|
|
|
189 |
RETURN ( true );
|
|
|
190 |
}
|
|
|
191 |
if (! _isNonNilObject(aNumber)) {
|
|
62
|
192 |
/* a smallint or nil */
|
|
1
|
193 |
RETURN ( false );
|
|
|
194 |
}
|
|
|
195 |
|
|
|
196 |
if (_qClass(aNumber) == Float) {
|
|
|
197 |
RETURN ( ((double)_intVal(self) == _floatVal(aNumber)) ? true : false );
|
|
|
198 |
}
|
|
|
199 |
%}
|
|
|
200 |
.
|
|
|
201 |
aNumber respondsToArithmetic ifFalse:[^ false].
|
|
|
202 |
^ self retry:#= coercing:aNumber
|
|
|
203 |
!
|
|
|
204 |
|
|
|
205 |
~= aNumber
|
|
|
206 |
"return true, if the arguments value is not equal to mine"
|
|
|
207 |
|
|
|
208 |
%{ /* NOCONTEXT */
|
|
|
209 |
|
|
|
210 |
if (aNumber == self) {
|
|
|
211 |
RETURN ( false );
|
|
|
212 |
}
|
|
|
213 |
if (! _isNonNilObject(aNumber)) {
|
|
62
|
214 |
/* a smallint or nil */
|
|
1
|
215 |
RETURN ( true );
|
|
|
216 |
}
|
|
|
217 |
|
|
|
218 |
if (_qClass(aNumber) == Float) {
|
|
|
219 |
RETURN ( ((double)_intVal(self) == _floatVal(aNumber)) ? false : true );
|
|
|
220 |
}
|
|
|
221 |
%}
|
|
|
222 |
.
|
|
|
223 |
aNumber respondsToArithmetic ifFalse:[^ true].
|
|
|
224 |
^ self retry:#~= coercing:aNumber
|
|
|
225 |
!
|
|
|
226 |
|
|
|
227 |
< aNumber
|
|
|
228 |
"return true, if the argument is greater than the receiver"
|
|
|
229 |
|
|
|
230 |
%{ /* NOCONTEXT */
|
|
|
231 |
|
|
|
232 |
if (_isSmallInteger(aNumber)) {
|
|
|
233 |
#ifdef POSITIVE_ADDRESSES
|
|
|
234 |
RETURN ( (_intVal(self) < _intVal(aNumber)) ? true : false );
|
|
|
235 |
#else
|
|
|
236 |
/* tag bit does not change ordering */
|
|
|
237 |
RETURN ( ((INT)self < (INT)aNumber) ? true : false );
|
|
|
238 |
#endif
|
|
|
239 |
}
|
|
62
|
240 |
if (__isFloat(aNumber)) {
|
|
1
|
241 |
RETURN ( ((double)_intVal(self) < _floatVal(aNumber)) ? true : false );
|
|
|
242 |
}
|
|
|
243 |
%}
|
|
|
244 |
.
|
|
|
245 |
^ aNumber lessFromInteger:self
|
|
|
246 |
"^ self retry:#< coercing:aNumber"
|
|
|
247 |
!
|
|
|
248 |
|
|
|
249 |
> aNumber
|
|
|
250 |
"return true, if the argument is less than the receiver"
|
|
|
251 |
|
|
|
252 |
%{ /* NOCONTEXT */
|
|
|
253 |
|
|
|
254 |
if (_isSmallInteger(aNumber)) {
|
|
|
255 |
#ifdef POSITIVE_ADDRESSES
|
|
|
256 |
RETURN ( (_intVal(self) > _intVal(aNumber)) ? true : false );
|
|
|
257 |
#else
|
|
|
258 |
/* tag bit does not change ordering */
|
|
|
259 |
RETURN ( ((INT)self > (INT)aNumber) ? true : false );
|
|
|
260 |
#endif
|
|
|
261 |
}
|
|
62
|
262 |
if (__isFloat(aNumber)) {
|
|
1
|
263 |
RETURN ( ((double)_intVal(self) > _floatVal(aNumber)) ? true : false );
|
|
|
264 |
}
|
|
|
265 |
%}
|
|
|
266 |
.
|
|
|
267 |
^ self retry:#> coercing:aNumber
|
|
|
268 |
!
|
|
|
269 |
|
|
|
270 |
>= aNumber
|
|
|
271 |
"return true, if the argument is less or equal"
|
|
|
272 |
|
|
|
273 |
%{ /* NOCONTEXT */
|
|
|
274 |
|
|
|
275 |
if (_isSmallInteger(aNumber)) {
|
|
|
276 |
#ifdef POSITIVE_ADDRESSES
|
|
|
277 |
RETURN ( (_intVal(self) >= _intVal(aNumber)) ? true : false );
|
|
|
278 |
#else
|
|
|
279 |
/* tag bit does not change ordering */
|
|
|
280 |
RETURN ( ((INT)self >= (INT)aNumber) ? true : false );
|
|
|
281 |
#endif
|
|
|
282 |
}
|
|
62
|
283 |
if (__isFloat(aNumber)) {
|
|
1
|
284 |
RETURN ( ((double)_intVal(self) >= _floatVal(aNumber)) ? true : false );
|
|
|
285 |
}
|
|
|
286 |
%}
|
|
|
287 |
.
|
|
|
288 |
^ self retry:#>= coercing:aNumber
|
|
|
289 |
!
|
|
|
290 |
|
|
|
291 |
<= aNumber
|
|
|
292 |
"return true, if the argument is greater or equal"
|
|
|
293 |
|
|
|
294 |
%{ /* NOCONTEXT */
|
|
|
295 |
|
|
|
296 |
if (_isSmallInteger(aNumber)) {
|
|
|
297 |
#ifdef POSITIVE_ADDRESSES
|
|
|
298 |
RETURN ( (_intVal(self) <= _intVal(aNumber)) ? true : false );
|
|
|
299 |
#else
|
|
|
300 |
/* tag bit does not change ordering */
|
|
|
301 |
RETURN ( ((INT)self <= (INT)aNumber) ? true : false );
|
|
|
302 |
#endif
|
|
|
303 |
}
|
|
62
|
304 |
if (__isFloat(aNumber)) {
|
|
1
|
305 |
RETURN ( ((double)_intVal(self) <= _floatVal(aNumber)) ? true : false );
|
|
|
306 |
}
|
|
|
307 |
%}
|
|
|
308 |
.
|
|
|
309 |
^ self retry:#<= coercing:aNumber
|
|
|
310 |
!
|
|
|
311 |
|
|
|
312 |
identityHash
|
|
|
313 |
"return an integer useful for hashing on identity"
|
|
|
314 |
|
|
62
|
315 |
self >= 0 ifTrue:[^ self].
|
|
|
316 |
^ self negated
|
|
1
|
317 |
!
|
|
|
318 |
|
|
|
319 |
min:aNumber
|
|
|
320 |
"return the receiver or the argument, whichever is smaller"
|
|
|
321 |
|
|
|
322 |
%{ /* NOCONTEXT */
|
|
|
323 |
|
|
|
324 |
if (_isSmallInteger(aNumber)) {
|
|
|
325 |
#ifdef POSITIVE_ADDRESSES
|
|
|
326 |
if (_intVal(self) < _intVal(aNumber)) {
|
|
|
327 |
#else
|
|
|
328 |
/* tag bit does not change ordering */
|
|
|
329 |
if ((INT)(self) < (INT)(aNumber)) {
|
|
|
330 |
#endif
|
|
|
331 |
RETURN ( self );
|
|
|
332 |
}
|
|
|
333 |
RETURN ( aNumber );
|
|
|
334 |
}
|
|
62
|
335 |
if (__isFloat(aNumber)) {
|
|
1
|
336 |
if ( (double)_intVal(self) < _floatVal(aNumber) ) {
|
|
|
337 |
RETURN ( self );
|
|
|
338 |
}
|
|
|
339 |
RETURN ( aNumber );
|
|
|
340 |
}
|
|
|
341 |
%}
|
|
|
342 |
.
|
|
|
343 |
(self < aNumber) ifTrue:[^ self].
|
|
|
344 |
^ aNumber
|
|
|
345 |
!
|
|
|
346 |
|
|
|
347 |
max:aNumber
|
|
|
348 |
"return the receiver or the argument, whichever is greater"
|
|
|
349 |
|
|
|
350 |
%{ /* NOCONTEXT */
|
|
|
351 |
|
|
|
352 |
if (_isSmallInteger(aNumber)) {
|
|
|
353 |
#ifdef POSITIVE_ADDRESSES
|
|
|
354 |
if (_intVal(self) > _intVal(aNumber)) {
|
|
|
355 |
#else
|
|
|
356 |
/* tag bit does not change ordering */
|
|
|
357 |
if ((INT)(self) > (INT)(aNumber)) {
|
|
|
358 |
#endif
|
|
|
359 |
RETURN ( self );
|
|
|
360 |
}
|
|
|
361 |
RETURN ( aNumber );
|
|
|
362 |
}
|
|
62
|
363 |
if (__isFloat(aNumber)) {
|
|
1
|
364 |
if ( (double)_intVal(self) > _floatVal(aNumber) ) {
|
|
|
365 |
RETURN ( self );
|
|
|
366 |
}
|
|
|
367 |
RETURN ( aNumber );
|
|
|
368 |
}
|
|
|
369 |
%}
|
|
|
370 |
.
|
|
|
371 |
(self > aNumber) ifTrue:[^ self].
|
|
|
372 |
^ aNumber
|
|
|
373 |
! !
|
|
|
374 |
|
|
|
375 |
!SmallInteger methodsFor:'testing'!
|
|
|
376 |
|
|
|
377 |
negative
|
|
|
378 |
"return true, if the receiver is less than zero
|
|
|
379 |
reimplemented here for speed"
|
|
|
380 |
|
|
|
381 |
%{ /* NOCONTEXT */
|
|
|
382 |
|
|
|
383 |
#ifdef POSITIVE_ADDRESSES
|
|
|
384 |
RETURN ( (_intVal(self) < 0) ? true : false );
|
|
|
385 |
#else
|
|
|
386 |
/* tag bit does not change sign */
|
|
|
387 |
RETURN ( ((INT)(self) < 0) ? true : false );
|
|
|
388 |
#endif
|
|
|
389 |
%}
|
|
|
390 |
!
|
|
|
391 |
|
|
|
392 |
positive
|
|
|
393 |
"return true, if the receiver is not negative
|
|
|
394 |
reimplemented here for speed"
|
|
|
395 |
|
|
|
396 |
%{ /* NOCONTEXT */
|
|
|
397 |
|
|
|
398 |
#ifdef POSITIVE_ADDRESSES
|
|
|
399 |
RETURN ( (_intVal(self) >= 0) ? true : false );
|
|
|
400 |
#else
|
|
|
401 |
/* tag bit does not change sign */
|
|
|
402 |
RETURN ( ((INT)(self) >= 0) ? true : false );
|
|
|
403 |
#endif
|
|
|
404 |
%}
|
|
|
405 |
!
|
|
|
406 |
|
|
|
407 |
strictlyPositive
|
|
|
408 |
"return true, if the receiver is greater than zero
|
|
|
409 |
reimplemented here for speed"
|
|
|
410 |
|
|
|
411 |
%{ /* NOCONTEXT */
|
|
|
412 |
|
|
|
413 |
#ifdef POSITIVE_ADDRESSES
|
|
|
414 |
RETURN ( (_intVal(self) > 0) ? true : false );
|
|
|
415 |
#else
|
|
|
416 |
/* tag bit does not change sign */
|
|
|
417 |
RETURN ( ((INT)(self) > 0) ? true : false );
|
|
|
418 |
#endif
|
|
|
419 |
%}
|
|
|
420 |
!
|
|
|
421 |
|
|
|
422 |
sign
|
|
|
423 |
"return the sign of the receiver
|
|
|
424 |
reimplemented here for speed"
|
|
|
425 |
|
|
|
426 |
%{ /* NOCONTEXT */
|
|
|
427 |
|
|
|
428 |
INT val = _intVal(self);
|
|
|
429 |
|
|
|
430 |
if (val < 0) {
|
|
|
431 |
RETURN ( _MKSMALLINT(-1) );
|
|
|
432 |
}
|
|
|
433 |
if (val > 0) {
|
|
|
434 |
RETURN ( _MKSMALLINT(1) );
|
|
|
435 |
}
|
|
|
436 |
RETURN ( _MKSMALLINT(0) );
|
|
|
437 |
%}
|
|
|
438 |
!
|
|
|
439 |
|
|
|
440 |
between:min and:max
|
|
|
441 |
"return true if the receiver is less than or equal to the argument max
|
|
|
442 |
and greater than or equal to the argument min.
|
|
|
443 |
- reimplemented here for speed"
|
|
|
444 |
|
|
|
445 |
%{ /* NOCONTEXT */
|
|
|
446 |
|
|
|
447 |
if (_isSmallInteger(min) && _isSmallInteger(max)) {
|
|
2
|
448 |
REGISTER INT selfVal;
|
|
1
|
449 |
|
|
2
|
450 |
selfVal = _intVal(self);
|
|
1
|
451 |
if (selfVal < _intVal(min)) {
|
|
|
452 |
RETURN ( false );
|
|
|
453 |
}
|
|
|
454 |
if (selfVal > _intVal(max)) {
|
|
|
455 |
RETURN ( false );
|
|
|
456 |
}
|
|
|
457 |
RETURN ( true );
|
|
|
458 |
}
|
|
|
459 |
%}
|
|
|
460 |
.
|
|
|
461 |
(self < min) ifTrue:[^ false].
|
|
|
462 |
(self > max) ifTrue:[^ false].
|
|
|
463 |
^ true
|
|
|
464 |
!
|
|
|
465 |
|
|
|
466 |
even
|
|
|
467 |
"return true, if the receiver is even"
|
|
|
468 |
|
|
|
469 |
%{ /* NOCONTEXT */
|
|
|
470 |
|
|
|
471 |
#ifdef POSITIVE_ADDRESSES
|
|
|
472 |
RETURN ( ((INT)self & 1) ? false : true );
|
|
|
473 |
#else
|
|
|
474 |
RETURN ( ((INT)self & ((INT)_MKSMALLINT(1) & ~TAG_INT)) ? false : true );
|
|
|
475 |
#endif
|
|
|
476 |
%}
|
|
|
477 |
!
|
|
|
478 |
|
|
|
479 |
odd
|
|
|
480 |
"return true, if the receiver is odd"
|
|
|
481 |
|
|
|
482 |
%{ /* NOCONTEXT */
|
|
|
483 |
|
|
|
484 |
#ifdef POSITIVE_ADDRESSES
|
|
|
485 |
RETURN ( ((INT)self & 1) ? true : false );
|
|
|
486 |
#else
|
|
|
487 |
RETURN ( ((INT)self & ((INT)_MKSMALLINT(1) & ~TAG_INT)) ? true : false );
|
|
|
488 |
#endif
|
|
|
489 |
%}
|
|
|
490 |
! !
|
|
|
491 |
|
|
|
492 |
!SmallInteger methodsFor:'arithmetic'!
|
|
|
493 |
|
|
|
494 |
+ aNumber
|
|
|
495 |
"return the sum of the receivers value and the arguments value"
|
|
|
496 |
|
|
|
497 |
%{ /* NOCONTEXT */
|
|
|
498 |
|
|
|
499 |
if (_isSmallInteger(aNumber)) {
|
|
|
500 |
#ifdef _ADD_IO_IO
|
|
2
|
501 |
RETURN ( _ADD_IO_IO(self, aNumber) );
|
|
1
|
502 |
#else
|
|
|
503 |
REGISTER INT sum;
|
|
2
|
504 |
extern OBJ _makeLarge();
|
|
1
|
505 |
|
|
|
506 |
sum = _intVal(self) + _intVal(aNumber);
|
|
|
507 |
if ((sum >= _MIN_INT) && (sum <= _MAX_INT)) {
|
|
|
508 |
RETURN ( _MKSMALLINT(sum) );
|
|
|
509 |
}
|
|
2
|
510 |
RETURN ( _makeLarge(sum) );
|
|
1
|
511 |
#endif
|
|
|
512 |
}
|
|
|
513 |
if ((aNumber != nil) && (_qClass(aNumber) == Float)) {
|
|
|
514 |
OBJ newFloat;
|
|
2
|
515 |
double val;
|
|
1
|
516 |
|
|
2
|
517 |
val = _floatVal(aNumber);
|
|
62
|
518 |
_qMKFLOAT(newFloat, (double)(_intVal(self)) + val, SENDER);
|
|
1
|
519 |
RETURN ( newFloat );
|
|
|
520 |
}
|
|
|
521 |
%}
|
|
|
522 |
.
|
|
|
523 |
^ aNumber sumFromInteger:self
|
|
|
524 |
!
|
|
|
525 |
|
|
|
526 |
- aNumber
|
|
|
527 |
"return the difference of the receivers value and the arguments value"
|
|
|
528 |
|
|
|
529 |
%{ /* NOCONTEXT */
|
|
|
530 |
|
|
|
531 |
if (_isSmallInteger(aNumber)) {
|
|
|
532 |
#ifdef _SUB_IO_IO
|
|
2
|
533 |
RETURN ( _SUB_IO_IO(self, aNumber) );
|
|
1
|
534 |
#else
|
|
|
535 |
REGISTER INT diff;
|
|
2
|
536 |
extern OBJ _makeLarge();
|
|
1
|
537 |
|
|
|
538 |
diff = _intVal(self) - _intVal(aNumber);
|
|
|
539 |
if ((diff >= _MIN_INT) && (diff <= _MAX_INT)) {
|
|
|
540 |
RETURN ( _MKSMALLINT(diff) );
|
|
|
541 |
}
|
|
2
|
542 |
RETURN ( _makeLarge(diff) );
|
|
1
|
543 |
#endif
|
|
|
544 |
}
|
|
|
545 |
if ((aNumber != nil) && (_qClass(aNumber) == Float)) {
|
|
|
546 |
OBJ newFloat;
|
|
2
|
547 |
double val;
|
|
1
|
548 |
|
|
2
|
549 |
val = _floatVal(aNumber);
|
|
62
|
550 |
_qMKFLOAT(newFloat, (double)(_intVal(self)) - val, SENDER);
|
|
1
|
551 |
RETURN ( newFloat );
|
|
|
552 |
}
|
|
|
553 |
%}
|
|
|
554 |
.
|
|
|
555 |
^ aNumber differenceFromInteger:self
|
|
|
556 |
!
|
|
|
557 |
|
|
|
558 |
* aNumber
|
|
|
559 |
"return the product of the receivers value and the arguments value"
|
|
|
560 |
|
|
|
561 |
|aLarge|
|
|
|
562 |
|
|
|
563 |
%{ /* NOCONTEXT */
|
|
|
564 |
|
|
68
|
565 |
INT myValue, otherValue;
|
|
|
566 |
unsigned INT productLow, productHi;
|
|
|
567 |
int negative;
|
|
|
568 |
|
|
|
569 |
# define lowBits(foo) (foo & 0xFFFF)
|
|
|
570 |
# define hiBits(foo) (foo >> 16)
|
|
1
|
571 |
|
|
|
572 |
if (_isSmallInteger(aNumber)) {
|
|
13
|
573 |
myValue = _intVal(self);
|
|
|
574 |
otherValue = _intVal(aNumber);
|
|
44
|
575 |
#if defined(NOTDEF) && defined(__GNUC__) && (__GNUC__ >= 2)
|
|
68
|
576 |
/*
|
|
|
577 |
* commented, since long-long arithmetic seems to
|
|
|
578 |
* be buggy in some implementations ...
|
|
|
579 |
* (took me a while to find this out :-(
|
|
|
580 |
*/
|
|
41
|
581 |
{
|
|
|
582 |
long long product;
|
|
13
|
583 |
|
|
41
|
584 |
product = myValue * otherValue;
|
|
|
585 |
if ((product >= (long long)_MIN_INT)
|
|
|
586 |
&& (product <= (long long)_MAX_INT)) {
|
|
|
587 |
RETURN ( _MKSMALLINT((int)product) );
|
|
|
588 |
}
|
|
|
589 |
}
|
|
13
|
590 |
#else
|
|
68
|
591 |
negative = 0;
|
|
|
592 |
if (myValue < 0) {
|
|
|
593 |
negative = 1;
|
|
|
594 |
myValue = -myValue;
|
|
|
595 |
}
|
|
|
596 |
if (otherValue < 0) {
|
|
|
597 |
negative = (1 - negative);
|
|
|
598 |
otherValue = -otherValue;
|
|
|
599 |
}
|
|
|
600 |
|
|
|
601 |
# if defined(__GNUC__) && defined(mc68k)
|
|
|
602 |
asm ("mulu%.l %3,%1:%0"
|
|
|
603 |
: "=d" ((unsigned long)(productLow)),
|
|
|
604 |
"=d" ((unsigned long)(productHi))
|
|
|
605 |
: "%0" ((unsigned long)(myValue)),
|
|
|
606 |
"dmi" ((unsigned long)(otherValue)));
|
|
|
607 |
# else
|
|
|
608 |
# if defined (__GNUC__) && defined(i386)
|
|
|
609 |
asm ("mull %3"
|
|
|
610 |
: "=a" ((unsigned long)(productLow)),
|
|
|
611 |
"=d" ((unsigned long)(productHi))
|
|
|
612 |
: "%0" ((unsigned long)(myValue)),
|
|
|
613 |
"rm" ((unsigned long)(otherValue)));
|
|
|
614 |
# else
|
|
|
615 |
{
|
|
|
616 |
unsigned INT pHH, pHL, pLH, pLL;
|
|
|
617 |
unsigned INT low1, low2, hi1, hi2;
|
|
|
618 |
unsigned INT t;
|
|
|
619 |
|
|
|
620 |
/* unsigned multiply myValue * otherValue -> productHi, productLow
|
|
|
621 |
*
|
|
|
622 |
* this is too slow:
|
|
1
|
623 |
* since most machines can do 32*32 to 64 bit multiply,
|
|
|
624 |
* (or at least 32*32 with Overflow check)
|
|
68
|
625 |
* - need more assembler (inline) functions here
|
|
|
626 |
*/
|
|
|
627 |
low1 = lowBits(myValue);
|
|
|
628 |
hi1 = hiBits(myValue);
|
|
|
629 |
low2 = lowBits(otherValue);
|
|
|
630 |
hi2 = hiBits(otherValue);
|
|
|
631 |
|
|
|
632 |
pLH = low1 * hi2;
|
|
|
633 |
pHL = hi1 * low2;
|
|
|
634 |
pLL = low1 * low2;
|
|
|
635 |
|
|
|
636 |
/*
|
|
|
637 |
* the common case ...
|
|
1
|
638 |
*/
|
|
68
|
639 |
if ((pHL == 0)
|
|
|
640 |
&& (pLH == 0)
|
|
|
641 |
&& ((pLL & 0xC0000000) == 0)) {
|
|
|
642 |
if (negative) {
|
|
|
643 |
RETURN ( _MKSMALLINT(- ((INT)pLL)) );
|
|
|
644 |
}
|
|
|
645 |
RETURN ( _MKSMALLINT((INT)pLL) );
|
|
|
646 |
}
|
|
|
647 |
|
|
|
648 |
pHH = hi1 * hi2;
|
|
|
649 |
|
|
|
650 |
/*
|
|
|
651 |
* pHH |--------|--------|
|
|
|
652 |
* pLH |--------|--------|
|
|
|
653 |
* pHL |--------|--------|
|
|
|
654 |
* pLL |--------|--------|
|
|
|
655 |
*/
|
|
|
656 |
|
|
|
657 |
t = lowBits(pLH) + lowBits(pHL) + hiBits(pLL);
|
|
|
658 |
productLow = (t << 16) + lowBits(pLL);
|
|
|
659 |
productHi = pHH + hiBits(t) + hiBits(pHL) + hiBits(pLH);
|
|
|
660 |
}
|
|
|
661 |
|
|
|
662 |
# endif
|
|
|
663 |
# endif
|
|
|
664 |
|
|
|
665 |
if (productHi == 0) {
|
|
|
666 |
if (productLow < _MAX_INT) {
|
|
|
667 |
if (negative) {
|
|
|
668 |
RETURN ( _MKSMALLINT(-((INT)productLow)) );
|
|
|
669 |
}
|
|
|
670 |
RETURN ( _MKSMALLINT(productLow) );
|
|
|
671 |
}
|
|
|
672 |
}
|
|
|
673 |
{
|
|
|
674 |
extern OBJ LargeInteger, _sign_value16_value16_value16_value16_;
|
|
|
675 |
static struct inlineCache val = _ILC5;
|
|
|
676 |
OBJ aLarge;
|
|
|
677 |
|
|
77
|
678 |
aLarge = (*val.ilc_func)(LargeInteger,
|
|
|
679 |
@symbol(sign:value16:value16:value16:value16:),
|
|
|
680 |
CON_COMMA nil, &val,
|
|
|
681 |
negative ? _MKSMALLINT(-1) : _MKSMALLINT(1),
|
|
|
682 |
_MKSMALLINT(lowBits(productLow)),
|
|
|
683 |
_MKSMALLINT(hiBits(productLow)),
|
|
|
684 |
_MKSMALLINT(lowBits(productHi)),
|
|
|
685 |
_MKSMALLINT(hiBits(productHi)) );
|
|
68
|
686 |
RETURN(aLarge);
|
|
1
|
687 |
}
|
|
13
|
688 |
#endif
|
|
1
|
689 |
} else if ((aNumber != nil) && (_qClass(aNumber) == Float)) {
|
|
|
690 |
OBJ newFloat;
|
|
2
|
691 |
double val;
|
|
1
|
692 |
|
|
2
|
693 |
val = _floatVal(aNumber);
|
|
62
|
694 |
_qMKFLOAT(newFloat, (double)(_intVal(self)) * val, SENDER);
|
|
1
|
695 |
RETURN ( newFloat );
|
|
|
696 |
}
|
|
|
697 |
%}
|
|
|
698 |
.
|
|
|
699 |
^ aNumber productFromInteger:self
|
|
|
700 |
!
|
|
|
701 |
|
|
|
702 |
/ aNumber
|
|
|
703 |
"return the quotient of the receivers value and the arguments value"
|
|
|
704 |
|
|
|
705 |
%{ /* NOCONTEXT */
|
|
|
706 |
|
|
|
707 |
INT me, t, val;
|
|
|
708 |
double dval;
|
|
|
709 |
|
|
|
710 |
if (_isSmallInteger(aNumber)) {
|
|
|
711 |
val = _intVal(aNumber);
|
|
|
712 |
if (val != 0) {
|
|
|
713 |
me = _intVal(self);
|
|
|
714 |
t = me / val;
|
|
|
715 |
#ifdef GOOD_OPTIMIZER
|
|
|
716 |
if (me % val) {
|
|
|
717 |
#else
|
|
|
718 |
/* this is stupid - all I want is to look for a remainder ...
|
|
|
719 |
but most compilers are too stupid and generate an extra mod instr.
|
|
|
720 |
for "if (me % val)" even if most div instructions also compute
|
|
|
721 |
the remainder.
|
|
68
|
722 |
Therefore I use a multiplication which is faster than a modulu
|
|
|
723 |
on most machines. Hint to GNU people :-)
|
|
1
|
724 |
*/
|
|
|
725 |
if ((t * val) == me) {
|
|
|
726 |
#endif
|
|
|
727 |
RETURN ( _MKSMALLINT(t) );
|
|
|
728 |
}
|
|
|
729 |
}
|
|
|
730 |
} else {
|
|
62
|
731 |
if (__isFloat(aNumber)) {
|
|
1
|
732 |
dval = _floatVal(aNumber);
|
|
|
733 |
if (dval != 0.0) {
|
|
62
|
734 |
OBJ newFloat;
|
|
|
735 |
|
|
1
|
736 |
me = _intVal(self);
|
|
62
|
737 |
|
|
|
738 |
_qMKFLOAT(newFloat, (double)me / dval, SENDER);
|
|
|
739 |
RETURN ( newFloat );
|
|
1
|
740 |
}
|
|
3
|
741 |
}
|
|
1
|
742 |
}
|
|
|
743 |
%}
|
|
|
744 |
.
|
|
|
745 |
aNumber isInteger ifTrue:[
|
|
|
746 |
aNumber = 0 ifTrue:[
|
|
|
747 |
DivisionByZeroSignal raise.
|
|
|
748 |
^ self
|
|
|
749 |
].
|
|
|
750 |
^ Fraction numerator:self denominator:aNumber
|
|
|
751 |
].
|
|
|
752 |
^ aNumber quotientFromInteger:self
|
|
|
753 |
!
|
|
|
754 |
|
|
2
|
755 |
// aNumber
|
|
1
|
756 |
"return the integer part of the quotient of the receivers value
|
|
|
757 |
and the arguments value"
|
|
|
758 |
|
|
|
759 |
%{ /* NOCONTEXT */
|
|
|
760 |
INT val;
|
|
|
761 |
|
|
2
|
762 |
if (_isSmallInteger(aNumber)) {
|
|
|
763 |
val = _intVal(aNumber);
|
|
1
|
764 |
if (val != 0) {
|
|
|
765 |
RETURN ( _MKSMALLINT(_intVal(self) / val) );
|
|
|
766 |
}
|
|
2
|
767 |
} else {
|
|
62
|
768 |
if (__isFraction(aNumber)) {
|
|
3
|
769 |
OBJ t;
|
|
|
770 |
INT num, den;
|
|
2
|
771 |
|
|
3
|
772 |
t = _FractionInstPtr(aNumber)->f_numerator;
|
|
|
773 |
if (_isSmallInteger(t)) {
|
|
|
774 |
num = _intVal(t);
|
|
|
775 |
t = _FractionInstPtr(aNumber)->f_denominator;
|
|
|
776 |
if (_isSmallInteger(t)) {
|
|
|
777 |
den = _intVal(t);
|
|
|
778 |
RETURN ( _MKSMALLINT(_intVal(self) * den / num ));
|
|
|
779 |
}
|
|
|
780 |
}
|
|
|
781 |
}
|
|
1
|
782 |
}
|
|
|
783 |
%}
|
|
|
784 |
.
|
|
2
|
785 |
(aNumber = 0) ifTrue:[
|
|
1
|
786 |
DivisionByZeroSignal raise.
|
|
|
787 |
^ self
|
|
|
788 |
].
|
|
2
|
789 |
^ self retry:#// coercing:aNumber
|
|
1
|
790 |
!
|
|
|
791 |
|
|
2
|
792 |
\\ aNumber
|
|
1
|
793 |
"return the integer rest of the receivers value
|
|
|
794 |
divided by the arguments value"
|
|
|
795 |
|
|
|
796 |
%{ /* NOCONTEXT */
|
|
|
797 |
INT mySelf, val;
|
|
|
798 |
|
|
2
|
799 |
if (_isSmallInteger(aNumber)) {
|
|
1
|
800 |
mySelf = _intVal(self);
|
|
|
801 |
if (mySelf < 0) mySelf = -mySelf;
|
|
2
|
802 |
val = _intVal(aNumber);
|
|
1
|
803 |
if (val != 0) {
|
|
|
804 |
if (val < 0) {
|
|
|
805 |
RETURN ( _MKSMALLINT(-(mySelf % -val)) );
|
|
|
806 |
}
|
|
|
807 |
RETURN ( _MKSMALLINT(mySelf % val) );
|
|
|
808 |
}
|
|
|
809 |
}
|
|
|
810 |
%}
|
|
|
811 |
.
|
|
2
|
812 |
(aNumber = 0) ifTrue:[
|
|
1
|
813 |
DivisionByZeroSignal raise.
|
|
|
814 |
^ self
|
|
|
815 |
].
|
|
2
|
816 |
^ self retry:#\\ coercing:aNumber
|
|
1
|
817 |
!
|
|
|
818 |
|
|
|
819 |
abs
|
|
|
820 |
"return the absolute value of the receiver
|
|
|
821 |
reimplemented here for speed"
|
|
|
822 |
|
|
|
823 |
%{ /* NOCONTEXT */
|
|
|
824 |
|
|
|
825 |
INT val = _intVal(self);
|
|
|
826 |
|
|
62
|
827 |
if (val >= 0) {
|
|
|
828 |
RETURN (self);
|
|
|
829 |
}
|
|
1
|
830 |
if (val != _MIN_INT) {
|
|
62
|
831 |
RETURN ( _MKSMALLINT(-val) );
|
|
1
|
832 |
}
|
|
|
833 |
%}
|
|
|
834 |
.
|
|
|
835 |
"only reached for minVal"
|
|
|
836 |
^ self negated
|
|
|
837 |
!
|
|
|
838 |
|
|
|
839 |
negated
|
|
|
840 |
"return the negative value of the receiver
|
|
|
841 |
reimplemented here for speed"
|
|
|
842 |
|
|
|
843 |
%{ /* NOCONTEXT */
|
|
|
844 |
|
|
|
845 |
INT val = _intVal(self);
|
|
|
846 |
|
|
|
847 |
if (val != _MIN_INT) {
|
|
|
848 |
RETURN ( _MKSMALLINT(- val) );
|
|
|
849 |
}
|
|
|
850 |
%}
|
|
|
851 |
.
|
|
|
852 |
^ (LargeInteger value:(SmallInteger maxVal)) + 1
|
|
|
853 |
! !
|
|
|
854 |
|
|
|
855 |
!SmallInteger methodsFor:'modulu arithmetic'!
|
|
|
856 |
|
|
|
857 |
times:aNumber
|
|
62
|
858 |
"return the product of the receiver and the argument, as SmallInteger.
|
|
|
859 |
The argument must be another SmallInteger.
|
|
|
860 |
If the result overflows the smallInteger range, the value modulu the
|
|
|
861 |
smallInteger range is returned (i.e. the low bits of the product).
|
|
1
|
862 |
This is of course not always correct, but some code does a modulu anyway
|
|
|
863 |
and can therefore speed things up by not going through LargeIntegers."
|
|
|
864 |
|
|
|
865 |
%{ /* NOCONTEXT */
|
|
|
866 |
|
|
|
867 |
if (_isSmallInteger(aNumber)) {
|
|
|
868 |
RETURN ( _MKSMALLINT((_intVal(self) * _intVal(aNumber)) & 0x7FFFFFFF) );
|
|
|
869 |
}
|
|
|
870 |
%}
|
|
|
871 |
.
|
|
|
872 |
self primitiveFailed
|
|
|
873 |
!
|
|
|
874 |
|
|
|
875 |
plus:aNumber
|
|
62
|
876 |
"return the sum of the receiver and the argument, as SmallInteger.
|
|
|
877 |
The argument must be another SmallInteger.
|
|
|
878 |
If the result overflows the smallInteger range, the value modulu the
|
|
|
879 |
smallInteger range is returned (i.e. the low bits of the sum).
|
|
1
|
880 |
This is of course not always correct, but some code does a modulu anyway
|
|
|
881 |
and can therefore speed things up by not going through LargeIntegers."
|
|
|
882 |
|
|
|
883 |
%{ /* NOCONTEXT */
|
|
|
884 |
|
|
|
885 |
if (_isSmallInteger(aNumber)) {
|
|
|
886 |
RETURN ( _MKSMALLINT((_intVal(self) + _intVal(aNumber)) & 0x7FFFFFFF) );
|
|
|
887 |
}
|
|
|
888 |
%}
|
|
|
889 |
.
|
|
|
890 |
self primitiveFailed
|
|
62
|
891 |
!
|
|
|
892 |
|
|
|
893 |
subtract:aNumber
|
|
|
894 |
"return the difference of the receiver and the argument, as SmallInteger.
|
|
|
895 |
The argument must be another SmallInteger.
|
|
|
896 |
If the result overflows the smallInteger range, the value modulu the
|
|
|
897 |
smallInteger range is returned (i.e. the low bits of the sum).
|
|
|
898 |
This is of course not always correct, but some code does a modulu anyway
|
|
|
899 |
and can therefore speed things up by not going through LargeIntegers."
|
|
|
900 |
|
|
|
901 |
%{ /* NOCONTEXT */
|
|
|
902 |
|
|
|
903 |
if (_isSmallInteger(aNumber)) {
|
|
|
904 |
RETURN ( _MKSMALLINT((_intVal(self) - _intVal(aNumber)) & 0x7FFFFFFF) );
|
|
|
905 |
}
|
|
|
906 |
%}
|
|
|
907 |
.
|
|
|
908 |
self primitiveFailed
|
|
1
|
909 |
! !
|
|
|
910 |
|
|
|
911 |
!SmallInteger class methodsFor:'bit mask constants'!
|
|
|
912 |
|
|
|
913 |
bitMaskFor:index
|
|
|
914 |
"return a bitmask for the index's bit (index starts at 1)"
|
|
|
915 |
|
|
|
916 |
(index between:1 and:SmallInteger maxBits) ifFalse:[
|
|
|
917 |
^ self error:'index out of bounds'
|
|
|
918 |
].
|
|
|
919 |
^ 1 bitShift:(index - 1)
|
|
|
920 |
! !
|
|
|
921 |
|
|
|
922 |
!SmallInteger methodsFor:'bit operators'!
|
|
|
923 |
|
|
|
924 |
bitAt:index
|
|
|
925 |
"return the value of the index's bit (index starts at 1)"
|
|
|
926 |
|
|
|
927 |
|mask|
|
|
|
928 |
|
|
|
929 |
(index between:1 and:SmallInteger maxBits) ifFalse:[
|
|
|
930 |
^ self error:'index out of bounds'
|
|
|
931 |
].
|
|
|
932 |
mask := 1 bitShift:(index - 1).
|
|
|
933 |
((self bitAnd:mask) == 0) ifTrue:[^ 0].
|
|
|
934 |
^ 1
|
|
|
935 |
!
|
|
|
936 |
|
|
|
937 |
allMask:anInteger
|
|
62
|
938 |
"return true if all 1-bits in anInteger are also 1 in the receiver"
|
|
|
939 |
|
|
|
940 |
^ (self bitAnd:anInteger) == anInteger
|
|
1
|
941 |
|
|
62
|
942 |
"2r00001111 allMask:2r00000001"
|
|
|
943 |
"2r00001111 allMask:2r00011110"
|
|
|
944 |
"2r00001111 allMask:2r00000000"
|
|
1
|
945 |
!
|
|
|
946 |
|
|
|
947 |
anyMask:anInteger
|
|
62
|
948 |
"return true if any 1-bits in anInteger is also 1 in the receiver.
|
|
|
949 |
(somewhat incorrect, if the mask is zero)"
|
|
1
|
950 |
|
|
62
|
951 |
^ (self bitAnd:anInteger) ~~ 0
|
|
|
952 |
|
|
|
953 |
"2r00001111 anyMask:2r00000001"
|
|
|
954 |
"2r00001111 anyMask:2r11110000"
|
|
1
|
955 |
!
|
|
|
956 |
|
|
|
957 |
noMask:anInteger
|
|
62
|
958 |
"return true if no 1-bit in anInteger is 1 in the receiver"
|
|
1
|
959 |
|
|
62
|
960 |
^ (self bitAnd:anInteger) == 0
|
|
|
961 |
|
|
|
962 |
"2r00001111 noMask:2r00000001"
|
|
|
963 |
"2r00001111 noMask:2r11110000"
|
|
1
|
964 |
!
|
|
|
965 |
|
|
|
966 |
highBit
|
|
62
|
967 |
"return the bitIndex of the highest bit set. The returned bitIndex
|
|
|
968 |
starts at 1 for the least significant bit. Returns -1 if no bit is set."
|
|
1
|
969 |
|
|
|
970 |
%{ /* NOCONTEXT */
|
|
|
971 |
|
|
|
972 |
INT mask, index, bits;
|
|
|
973 |
|
|
|
974 |
bits = _intVal(self);
|
|
|
975 |
if (bits == 0) {
|
|
|
976 |
RETURN ( _MKSMALLINT(-1) );
|
|
|
977 |
}
|
|
|
978 |
#ifdef alpha
|
|
|
979 |
mask = 0x2000000000000000;
|
|
|
980 |
index = 62;
|
|
|
981 |
#else
|
|
|
982 |
mask = 0x20000000;
|
|
|
983 |
index = 30;
|
|
|
984 |
#endif
|
|
|
985 |
while (index) {
|
|
|
986 |
if (bits & mask) break;
|
|
|
987 |
mask = mask >> 1;
|
|
|
988 |
index--;
|
|
|
989 |
}
|
|
|
990 |
RETURN ( _MKSMALLINT(index) );
|
|
|
991 |
%}
|
|
62
|
992 |
"2r000100 highBit"
|
|
|
993 |
"2r010100 highBit"
|
|
|
994 |
"2r000001 highBit"
|
|
|
995 |
"0 highBit"
|
|
|
996 |
"SmallInteger maxVal highBit"
|
|
1
|
997 |
!
|
|
|
998 |
|
|
|
999 |
lowBit
|
|
62
|
1000 |
"return the bitIndex of the lowest bit set. The returned bitIndex
|
|
|
1001 |
starts at 1 for the least significant bit. Returns -1 if no bit is set."
|
|
|
1002 |
|
|
1
|
1003 |
%{ /* NOCONTEXT */
|
|
|
1004 |
|
|
|
1005 |
INT mask, index, bits;
|
|
|
1006 |
|
|
|
1007 |
bits = _intVal(self);
|
|
|
1008 |
if (bits == 0) {
|
|
|
1009 |
RETURN ( _MKSMALLINT(-1) );
|
|
|
1010 |
}
|
|
|
1011 |
mask = 1;
|
|
|
1012 |
index = 1;
|
|
|
1013 |
#ifdef alpha
|
|
|
1014 |
while (index != 63) {
|
|
|
1015 |
#else
|
|
|
1016 |
while (index != 31) {
|
|
|
1017 |
#endif
|
|
|
1018 |
if (bits & mask) {
|
|
|
1019 |
RETURN ( _MKSMALLINT(index) );
|
|
|
1020 |
}
|
|
|
1021 |
mask = mask << 1;
|
|
|
1022 |
index++;
|
|
|
1023 |
}
|
|
|
1024 |
RETURN ( _MKSMALLINT(-1) );
|
|
|
1025 |
%}
|
|
62
|
1026 |
"2r000100 lowBit"
|
|
|
1027 |
"2r010010 lowBit"
|
|
|
1028 |
"2r100001 lowBit"
|
|
|
1029 |
"0 lowBit"
|
|
1
|
1030 |
!
|
|
|
1031 |
|
|
|
1032 |
bitShift:shiftCount
|
|
|
1033 |
"return the value of the receiver shifted by shiftCount bits;
|
|
62
|
1034 |
leftShift if shiftCount > 0; rightShift otherwise.
|
|
|
1035 |
This method is (currently) not handling largeInteger overflow"
|
|
1
|
1036 |
|
|
|
1037 |
%{ /* NOCONTEXT */
|
|
|
1038 |
|
|
|
1039 |
INT bits, count;
|
|
|
1040 |
|
|
|
1041 |
if (_isSmallInteger(shiftCount)) {
|
|
|
1042 |
count = _intVal(shiftCount);
|
|
|
1043 |
bits = _intVal(self);
|
|
|
1044 |
if (count > 0) {
|
|
85
|
1045 |
/*
|
|
|
1046 |
* check for overflow
|
|
|
1047 |
*/
|
|
|
1048 |
if (count < (N_INT_BITS-1)) {
|
|
|
1049 |
if (! (bits >> (N_INT_BITS - 1 - count))) {
|
|
|
1050 |
RETURN ( _MKSMALLINT(bits << count) );
|
|
|
1051 |
}
|
|
|
1052 |
/*
|
|
|
1053 |
* so, there is an overflow ...
|
|
|
1054 |
* handle it as largeInteger
|
|
|
1055 |
*/
|
|
|
1056 |
/* FALL THROUGH */
|
|
|
1057 |
}
|
|
|
1058 |
} else {
|
|
|
1059 |
/*
|
|
|
1060 |
* right shifts cannot overflow
|
|
|
1061 |
*/
|
|
|
1062 |
if (count < 0) {
|
|
|
1063 |
RETURN ( _MKSMALLINT(bits >> -count) );
|
|
|
1064 |
}
|
|
|
1065 |
RETURN (self );
|
|
|
1066 |
}
|
|
1
|
1067 |
}
|
|
85
|
1068 |
%}.
|
|
|
1069 |
(shiftCount isMemberOf:SmallInteger) ifTrue:[
|
|
|
1070 |
^ (LargeInteger value:self) bitShift:shiftCount
|
|
|
1071 |
].
|
|
1
|
1072 |
^ self bitShift:(shiftCount coerce:1)
|
|
|
1073 |
!
|
|
|
1074 |
|
|
|
1075 |
bitOr:anInteger
|
|
13
|
1076 |
"return the bitwise-or of the receiver and the argument, anInteger"
|
|
1
|
1077 |
|
|
|
1078 |
%{ /* NOCONTEXT */
|
|
|
1079 |
|
|
|
1080 |
/* oring the tags doesn't change it */
|
|
|
1081 |
if (_isSmallInteger(anInteger)) {
|
|
|
1082 |
RETURN ( ((OBJ) ((INT)self | (INT)anInteger)) );
|
|
|
1083 |
}
|
|
|
1084 |
%}
|
|
|
1085 |
.
|
|
|
1086 |
^ self retry:#bitOr coercing:anInteger
|
|
62
|
1087 |
|
|
|
1088 |
"(2r000000100 bitOr:2r00000011) radixPrintStringRadix:2"
|
|
1
|
1089 |
!
|
|
|
1090 |
|
|
|
1091 |
bitAnd:anInteger
|
|
13
|
1092 |
"return the bitwise-and of the receiver and the argument, anInteger"
|
|
1
|
1093 |
|
|
|
1094 |
%{ /* NOCONTEXT */
|
|
|
1095 |
|
|
|
1096 |
/* anding the tags doesn't change it */
|
|
|
1097 |
if (_isSmallInteger(anInteger)) {
|
|
|
1098 |
RETURN ( ((OBJ) ((INT)self & (INT)anInteger)) );
|
|
|
1099 |
}
|
|
|
1100 |
%}
|
|
|
1101 |
.
|
|
|
1102 |
^ self retry:#bitAnd coercing:anInteger
|
|
62
|
1103 |
|
|
|
1104 |
"(2r001010100 bitAnd:2r00001111) radixPrintStringRadix:2"
|
|
1
|
1105 |
!
|
|
|
1106 |
|
|
|
1107 |
bitXor:anInteger
|
|
13
|
1108 |
"return the bitwise-exclusive-or of the receiver and the argument, anInteger"
|
|
1
|
1109 |
|
|
|
1110 |
%{ /* NOCONTEXT */
|
|
|
1111 |
|
|
|
1112 |
/* xoring the tags turns it off - or it in again */
|
|
|
1113 |
if (_isSmallInteger(anInteger)) {
|
|
|
1114 |
RETURN ( (OBJ)( ((INT)self ^ (INT)anInteger) | TAG_INT) );
|
|
|
1115 |
}
|
|
|
1116 |
%}
|
|
|
1117 |
.
|
|
|
1118 |
^ self retry:#bitXor coercing:anInteger
|
|
|
1119 |
!
|
|
|
1120 |
|
|
|
1121 |
bitInvert
|
|
|
1122 |
"return the value of the receiver with all bits inverted"
|
|
|
1123 |
|
|
|
1124 |
%{ /* NOCONTEXT */
|
|
|
1125 |
|
|
|
1126 |
/* invert anything except tag bits */
|
|
|
1127 |
RETURN ( ((OBJ) ((INT)self ^ ~TAG_MASK)) );
|
|
|
1128 |
%}
|
|
|
1129 |
!
|
|
|
1130 |
|
|
|
1131 |
bitTest:aMask
|
|
|
1132 |
"return true, if any bit from aMask is set in the receiver"
|
|
|
1133 |
|
|
|
1134 |
%{ /* NOCONTEXT */
|
|
|
1135 |
|
|
|
1136 |
/* and all bits except tag */
|
|
|
1137 |
if (_isSmallInteger(aMask)) {
|
|
|
1138 |
RETURN ( ((INT)self & ((INT)aMask & ~TAG_MASK)) ? true : false );
|
|
|
1139 |
}
|
|
|
1140 |
%}
|
|
|
1141 |
.
|
|
|
1142 |
^ self retry:#bitTest coercing:aMask
|
|
|
1143 |
! !
|
|
|
1144 |
|
|
|
1145 |
!SmallInteger methodsFor:'byte access'!
|
|
|
1146 |
|
|
|
1147 |
digitLength
|
|
|
1148 |
"return the number bytes used by this Integer"
|
|
|
1149 |
|
|
|
1150 |
^ self abs highBit - 1 // 8 + 1
|
|
|
1151 |
!
|
|
|
1152 |
|
|
|
1153 |
digitAt:index
|
|
|
1154 |
"return 8 bits of value, starting at byte index"
|
|
|
1155 |
|
|
|
1156 |
%{ /* NOCONTEXT */
|
|
|
1157 |
|
|
|
1158 |
INT val;
|
|
|
1159 |
|
|
|
1160 |
if (_isSmallInteger(index)) {
|
|
|
1161 |
val = _intVal(self);
|
|
|
1162 |
if (val < 0)
|
|
|
1163 |
val = -val;
|
|
|
1164 |
switch (_intVal(index)) {
|
|
|
1165 |
case 1:
|
|
|
1166 |
RETURN ( _MKSMALLINT( val & 0xFF) );
|
|
|
1167 |
case 2:
|
|
|
1168 |
RETURN ( _MKSMALLINT( (val >> 8) & 0xFF) );
|
|
|
1169 |
case 3:
|
|
|
1170 |
RETURN ( _MKSMALLINT( (val >> 16) & 0xFF) );
|
|
|
1171 |
case 4:
|
|
|
1172 |
RETURN ( _MKSMALLINT( (val >> 24) & 0xFF) );
|
|
|
1173 |
#ifdef alpha
|
|
|
1174 |
case 5:
|
|
|
1175 |
RETURN ( _MKSMALLINT( (val >> 32) & 0xFF) );
|
|
|
1176 |
case 6:
|
|
|
1177 |
RETURN ( _MKSMALLINT( (val >> 40) & 0xFF) );
|
|
|
1178 |
case 7:
|
|
|
1179 |
RETURN ( _MKSMALLINT( (val >> 48) & 0xFF) );
|
|
|
1180 |
case 8:
|
|
|
1181 |
RETURN ( _MKSMALLINT( (val >> 56) & 0xFF) );
|
|
|
1182 |
#endif
|
|
|
1183 |
}
|
|
|
1184 |
}
|
|
77
|
1185 |
%}.
|
|
|
1186 |
index > 0 ifFalse:[
|
|
|
1187 |
self primitiveFailed
|
|
|
1188 |
].
|
|
|
1189 |
^ 0
|
|
62
|
1190 |
|
|
|
1191 |
"(16r12345678 digitAt:1) printStringRadix:16"
|
|
|
1192 |
"(16r12345678 digitAt:3) printStringRadix:16"
|
|
1
|
1193 |
! !
|
|
|
1194 |
|
|
|
1195 |
!SmallInteger methodsFor:'misc math functions'!
|
|
|
1196 |
|
|
|
1197 |
gcd:anInteger
|
|
|
1198 |
"return the greatest common divisor (Euclid's algorithm).
|
|
|
1199 |
This has been redefined here for more speed since due to the
|
|
|
1200 |
use of gcd in Fraction code, it has become time-critical for
|
|
|
1201 |
some code. (thanx to MessageTally)"
|
|
|
1202 |
|
|
|
1203 |
%{ /* NOCONTEXT */
|
|
|
1204 |
|
|
|
1205 |
if (_isSmallInteger(anInteger)) {
|
|
|
1206 |
INT orgArg, ttt, selfInt, temp;
|
|
|
1207 |
|
|
|
1208 |
ttt = orgArg = _intVal(anInteger);
|
|
2
|
1209 |
if (ttt) {
|
|
1
|
1210 |
selfInt = _intVal(self);
|
|
|
1211 |
while (ttt != 0) {
|
|
|
1212 |
temp = selfInt % ttt;
|
|
|
1213 |
selfInt = ttt;
|
|
|
1214 |
ttt = temp;
|
|
|
1215 |
}
|
|
2
|
1216 |
/*
|
|
|
1217 |
* since its not defined in what the sign of
|
|
|
1218 |
* a modulu result is when the arg is negative,
|
|
|
1219 |
* change it explicitely here ...
|
|
|
1220 |
*/
|
|
|
1221 |
if (orgArg < 0) {
|
|
|
1222 |
/* result should be negative */
|
|
1
|
1223 |
if (selfInt > 0) selfInt = -selfInt;
|
|
2
|
1224 |
} else {
|
|
|
1225 |
/* result should be positive */
|
|
|
1226 |
if (selfInt < 0) selfInt = -selfInt;
|
|
|
1227 |
}
|
|
1
|
1228 |
RETURN ( _MKSMALLINT(selfInt) );
|
|
|
1229 |
}
|
|
|
1230 |
}
|
|
|
1231 |
%}
|
|
|
1232 |
.
|
|
|
1233 |
^ super gcd:anInteger
|
|
|
1234 |
!
|
|
|
1235 |
|
|
|
1236 |
intlog10
|
|
|
1237 |
"return the truncation of log10 of the receiver -
|
|
|
1238 |
stupid implementation; used to find out the number of digits needed
|
|
|
1239 |
to print a number/and for conversion to a LargeInteger"
|
|
|
1240 |
|
|
|
1241 |
self <= 0 ifTrue:[
|
|
|
1242 |
self error:'logarithm of negative integer'
|
|
|
1243 |
].
|
|
|
1244 |
self < 10 ifTrue:[^ 1].
|
|
|
1245 |
self < 100 ifTrue:[^ 2].
|
|
|
1246 |
self < 1000 ifTrue:[^ 3].
|
|
|
1247 |
self < 10000 ifTrue:[^ 4].
|
|
|
1248 |
self < 100000 ifTrue:[^ 5].
|
|
|
1249 |
self < 1000000 ifTrue:[^ 6].
|
|
|
1250 |
self < 10000000 ifTrue:[^ 7].
|
|
|
1251 |
self < 100000000 ifTrue:[^ 8].
|
|
|
1252 |
self < 1000000000 ifTrue:[^ 9].
|
|
|
1253 |
^ 10
|
|
|
1254 |
! !
|
|
|
1255 |
|
|
|
1256 |
!SmallInteger methodsFor:'coercing and converting'!
|
|
|
1257 |
|
|
|
1258 |
coerce:aNumber
|
|
41
|
1259 |
"return aNumber converted into receivers type"
|
|
|
1260 |
|
|
1
|
1261 |
^ aNumber asInteger
|
|
|
1262 |
!
|
|
|
1263 |
|
|
|
1264 |
generality
|
|
41
|
1265 |
"return the generality value - see ArithmeticValue>>retry:coercing:"
|
|
|
1266 |
|
|
1
|
1267 |
^ 20
|
|
|
1268 |
!
|
|
|
1269 |
|
|
|
1270 |
asFloat
|
|
|
1271 |
"return a Float with same value as receiver"
|
|
|
1272 |
|
|
|
1273 |
%{ /* NOCONTEXT */
|
|
|
1274 |
|
|
|
1275 |
OBJ newFloat;
|
|
|
1276 |
|
|
62
|
1277 |
_qMKFLOAT(newFloat, (double)_intVal(self), SENDER);
|
|
|
1278 |
/*
|
|
|
1279 |
_qNew(newFloat, sizeof(struct floatstruct), SENDER);
|
|
1
|
1280 |
_InstPtr(newFloat)->o_class = Float;
|
|
|
1281 |
_FloatInstPtr(newFloat)->f_floatvalue = _intVal(self);
|
|
62
|
1282 |
*/
|
|
1
|
1283 |
RETURN ( newFloat );
|
|
|
1284 |
%}
|
|
|
1285 |
!
|
|
|
1286 |
|
|
|
1287 |
asLargeInteger
|
|
|
1288 |
"return a LargeInteger with same value as receiver"
|
|
|
1289 |
|
|
|
1290 |
^ LargeInteger value:self
|
|
|
1291 |
!
|
|
|
1292 |
|
|
|
1293 |
asCharacter
|
|
62
|
1294 |
"Return a character with the receiver as ascii value"
|
|
1
|
1295 |
|
|
|
1296 |
^ Character value:self
|
|
|
1297 |
! !
|
|
|
1298 |
|
|
|
1299 |
!SmallInteger methodsFor:'iterators'!
|
|
|
1300 |
|
|
|
1301 |
timesRepeat:aBlock
|
|
|
1302 |
"evaluate the argument, aBlock self times"
|
|
|
1303 |
|
|
|
1304 |
|count "{ Class: SmallInteger }" |
|
|
|
1305 |
|
|
|
1306 |
count := self.
|
|
|
1307 |
[count > 0] whileTrue:[
|
|
|
1308 |
aBlock value.
|
|
|
1309 |
count := count - 1
|
|
|
1310 |
]
|
|
|
1311 |
!
|
|
|
1312 |
|
|
|
1313 |
to:stop do:aBlock
|
|
62
|
1314 |
"evaluate aBlock for every integer between (and including) the receiver
|
|
|
1315 |
and the argument, stop.
|
|
|
1316 |
Reimplemented for speed"
|
|
1
|
1317 |
|
|
77
|
1318 |
|home|
|
|
1
|
1319 |
%{
|
|
|
1320 |
REGISTER INT tmp;
|
|
|
1321 |
INT final;
|
|
|
1322 |
REGISTER OBJFUNC code;
|
|
|
1323 |
extern OBJ Block, _value_;
|
|
|
1324 |
static struct inlineCache blockVal = _ILC1;
|
|
2
|
1325 |
REGISTER OBJ rHome;
|
|
1
|
1326 |
|
|
|
1327 |
if (_isSmallInteger(stop)) {
|
|
|
1328 |
tmp = _intVal(self);
|
|
|
1329 |
final = _intVal(stop);
|
|
2
|
1330 |
if (__isBlock(aBlock)
|
|
1
|
1331 |
&& ((code = _BlockInstPtr(aBlock)->b_code) != (OBJFUNC)nil)
|
|
|
1332 |
&& (_BlockInstPtr(aBlock)->b_nargs == _MKSMALLINT(1))) {
|
|
13
|
1333 |
#ifdef NEW_BLOCK_CALL
|
|
|
1334 |
while (tmp <= final) {
|
|
|
1335 |
if (InterruptPending != nil) interrupt(CONARG);
|
|
|
1336 |
(*code)(aBlock, CON_COMMA _MKSMALLINT(tmp));
|
|
|
1337 |
tmp++;
|
|
|
1338 |
}
|
|
77
|
1339 |
#else /* old BLOCK_CALL */
|
|
1
|
1340 |
/*
|
|
2
|
1341 |
* arg is a compiled block -
|
|
1
|
1342 |
* directly call it without going through "Block-value"
|
|
|
1343 |
*/
|
|
|
1344 |
home = _BlockInstPtr(aBlock)->b_home;
|
|
2
|
1345 |
rHome = home;
|
|
|
1346 |
if ((rHome == nil) || (_qSpace(rHome) >= STACKSPACE)) {
|
|
|
1347 |
/*
|
|
|
1348 |
* home will not move - keep in in a register
|
|
|
1349 |
*/
|
|
|
1350 |
while (tmp <= final) {
|
|
|
1351 |
if (InterruptPending != nil) interrupt(CONARG);
|
|
|
1352 |
(*code)(rHome, CON_COMMA _MKSMALLINT(tmp));
|
|
|
1353 |
tmp++;
|
|
|
1354 |
}
|
|
10
|
1355 |
} else {
|
|
2
|
1356 |
while (tmp <= final) {
|
|
|
1357 |
if (InterruptPending != nil) interrupt(CONARG);
|
|
|
1358 |
(*code)(home, CON_COMMA _MKSMALLINT(tmp));
|
|
|
1359 |
tmp++;
|
|
|
1360 |
}
|
|
1
|
1361 |
}
|
|
77
|
1362 |
#endif /* NEW_BLOCK_CALL */
|
|
1
|
1363 |
} else {
|
|
|
1364 |
/*
|
|
77
|
1365 |
* arg is something else - call it with value"
|
|
1
|
1366 |
*/
|
|
|
1367 |
while (tmp <= final) {
|
|
|
1368 |
if (InterruptPending != nil) interrupt(CONARG);
|
|
|
1369 |
|
|
77
|
1370 |
(*blockVal.ilc_func)(aBlock,
|
|
|
1371 |
@symbol(value:),
|
|
|
1372 |
CON_COMMA nil, &blockVal,
|
|
|
1373 |
_MKSMALLINT(tmp));
|
|
1
|
1374 |
tmp++;
|
|
|
1375 |
}
|
|
|
1376 |
}
|
|
|
1377 |
RETURN ( self );
|
|
|
1378 |
}
|
|
|
1379 |
%}
|
|
|
1380 |
.
|
|
62
|
1381 |
^ super to:stop do:aBlock
|
|
|
1382 |
|
|
|
1383 |
"1 to:10 do:[:i | i printNewline]"
|
|
1
|
1384 |
!
|
|
|
1385 |
|
|
|
1386 |
to:stop by:incr do:aBlock
|
|
|
1387 |
"reimplemented for speed"
|
|
|
1388 |
|
|
77
|
1389 |
|home|
|
|
1
|
1390 |
%{
|
|
|
1391 |
REGISTER INT tmp, step;
|
|
|
1392 |
REGISTER INT final;
|
|
|
1393 |
REGISTER OBJFUNC code;
|
|
|
1394 |
extern OBJ Block, _value_;
|
|
|
1395 |
static struct inlineCache blockVal = _ILC1;
|
|
2
|
1396 |
REGISTER OBJ rHome;
|
|
1
|
1397 |
|
|
|
1398 |
if (_isSmallInteger(incr)
|
|
|
1399 |
&& _isSmallInteger(stop)) {
|
|
|
1400 |
tmp = _intVal(self);
|
|
|
1401 |
final = _intVal(stop);
|
|
|
1402 |
step = _intVal(incr);
|
|
2
|
1403 |
if (__isBlock(aBlock)
|
|
1
|
1404 |
&& ((code = _BlockInstPtr(aBlock)->b_code) != (OBJFUNC)nil)
|
|
|
1405 |
&& (_BlockInstPtr(aBlock)->b_nargs == _MKSMALLINT(1))) {
|
|
13
|
1406 |
#ifdef NEW_BLOCK_CALL
|
|
|
1407 |
if (step < 0) {
|
|
|
1408 |
while (tmp >= final) {
|
|
|
1409 |
if (InterruptPending != nil) interrupt(CONARG);
|
|
|
1410 |
(*code)(aBlock, CON_COMMA _MKSMALLINT(tmp));
|
|
|
1411 |
tmp += step;
|
|
|
1412 |
}
|
|
41
|
1413 |
} else {
|
|
13
|
1414 |
while (tmp <= final) {
|
|
|
1415 |
if (InterruptPending != nil) interrupt(CONARG);
|
|
|
1416 |
(*code)(aBlock, CON_COMMA _MKSMALLINT(tmp));
|
|
|
1417 |
tmp += step;
|
|
|
1418 |
}
|
|
|
1419 |
}
|
|
|
1420 |
#else
|
|
1
|
1421 |
/*
|
|
2
|
1422 |
* arg is a compiled block -
|
|
1
|
1423 |
* directly call it without going through "Block-value"
|
|
|
1424 |
*/
|
|
|
1425 |
home = _BlockInstPtr(aBlock)->b_home;
|
|
10
|
1426 |
rHome = home;
|
|
2
|
1427 |
if (step < 0) {
|
|
|
1428 |
if ((rHome == nil) || (_qSpace(rHome) >= STACKSPACE)) {
|
|
13
|
1429 |
/*
|
|
|
1430 |
* home is on stack - will not move
|
|
|
1431 |
*/
|
|
2
|
1432 |
while (tmp >= final) {
|
|
|
1433 |
if (InterruptPending != nil) interrupt(CONARG);
|
|
|
1434 |
(*code)(rHome, CON_COMMA _MKSMALLINT(tmp));
|
|
|
1435 |
tmp += step;
|
|
|
1436 |
}
|
|
10
|
1437 |
} else {
|
|
2
|
1438 |
while (tmp >= final) {
|
|
|
1439 |
if (InterruptPending != nil) interrupt(CONARG);
|
|
|
1440 |
(*code)(home, CON_COMMA _MKSMALLINT(tmp));
|
|
|
1441 |
tmp += step;
|
|
|
1442 |
}
|
|
|
1443 |
}
|
|
|
1444 |
} else {
|
|
|
1445 |
if ((rHome == nil) || (_qSpace(rHome) >= STACKSPACE)) {
|
|
13
|
1446 |
/*
|
|
|
1447 |
* home is on stack - will not move
|
|
|
1448 |
*/
|
|
2
|
1449 |
while (tmp <= final) {
|
|
|
1450 |
if (InterruptPending != nil) interrupt(CONARG);
|
|
|
1451 |
(*code)(rHome, CON_COMMA _MKSMALLINT(tmp));
|
|
|
1452 |
tmp += step;
|
|
|
1453 |
}
|
|
10
|
1454 |
} else {
|
|
2
|
1455 |
while (tmp <= final) {
|
|
|
1456 |
if (InterruptPending != nil) interrupt(CONARG);
|
|
|
1457 |
(*code)(home, CON_COMMA _MKSMALLINT(tmp));
|
|
|
1458 |
tmp += step;
|
|
|
1459 |
}
|
|
|
1460 |
}
|
|
|
1461 |
}
|
|
13
|
1462 |
#endif
|
|
2
|
1463 |
} else {
|
|
|
1464 |
/*
|
|
77
|
1465 |
* arg is something else - call it with value"
|
|
2
|
1466 |
*/
|
|
|
1467 |
if (step < 0) {
|
|
1
|
1468 |
while (tmp >= final) {
|
|
|
1469 |
if (InterruptPending != nil) interrupt(CONARG);
|
|
|
1470 |
|
|
77
|
1471 |
(*blockVal.ilc_func)(aBlock,
|
|
|
1472 |
@symbol(value:),
|
|
|
1473 |
CON_COMMA nil, &blockVal,
|
|
|
1474 |
_MKSMALLINT(tmp));
|
|
1
|
1475 |
tmp += step;
|
|
|
1476 |
}
|
|
2
|
1477 |
} else {
|
|
1
|
1478 |
while (tmp <= final) {
|
|
|
1479 |
if (InterruptPending != nil) interrupt(CONARG);
|
|
|
1480 |
|
|
77
|
1481 |
(*blockVal.ilc_func)(aBlock,
|
|
|
1482 |
@symbol(value:),
|
|
|
1483 |
CON_COMMA nil, &blockVal,
|
|
|
1484 |
_MKSMALLINT(tmp));
|
|
1
|
1485 |
tmp += step;
|
|
|
1486 |
}
|
|
|
1487 |
}
|
|
|
1488 |
}
|
|
|
1489 |
RETURN ( self );
|
|
|
1490 |
}
|
|
|
1491 |
%}
|
|
|
1492 |
.
|
|
2
|
1493 |
^ super to:stop do:aBlock
|
|
62
|
1494 |
|
|
|
1495 |
"1 to:10 by:3 do:[:i | i printNewline]"
|
|
2
|
1496 |
! !
|
|
|
1497 |
|
|
|
1498 |
!SmallInteger class methodsFor:'binary storage'!
|
|
|
1499 |
|
|
|
1500 |
binaryDefinitionFrom: stream manager: manager
|
|
|
1501 |
"read the binary representation as stored in storeBinaryOn:"
|
|
|
1502 |
|
|
|
1503 |
| value |
|
|
|
1504 |
|
|
|
1505 |
value := stream next bitAnd: 16r7F.
|
|
|
1506 |
value > 16r3F ifTrue: [
|
|
|
1507 |
value := value - 16r80
|
|
|
1508 |
].
|
|
|
1509 |
value := (value bitShift: 8) bitOr: stream next.
|
|
|
1510 |
value := (value bitShift: 8) bitOr: stream next.
|
|
|
1511 |
value := (value bitShift: 8) bitOr: stream next.
|
|
|
1512 |
^ value
|
|
|
1513 |
! !
|
|
|
1514 |
|
|
|
1515 |
!SmallInteger methodsFor:'binary storage'!
|
|
|
1516 |
|
|
|
1517 |
hasSpecialBinaryRepresentation
|
|
41
|
1518 |
"return true, if the receiver has a special binary representation"
|
|
|
1519 |
|
|
2
|
1520 |
^ true
|
|
|
1521 |
!
|
|
|
1522 |
|
|
|
1523 |
storeBinaryOn: stream manager: manager
|
|
41
|
1524 |
"append a binary representation onto stream.
|
|
|
1525 |
Redefined since SmallIntegers are stored as their value with the 32nd bit
|
|
|
1526 |
set as a tag.
|
|
|
1527 |
To make the binary file a bit more compact, zeros and single byte ints
|
|
|
1528 |
are stored with a more compact representation (using special type-codes)."
|
|
2
|
1529 |
|
|
3
|
1530 |
self == 0 ifTrue:[
|
|
|
1531 |
stream nextPut: manager codeForZero.
|
|
|
1532 |
^ self
|
|
|
1533 |
].
|
|
|
1534 |
(self between:0 and:255) ifTrue:[
|
|
|
1535 |
stream nextPut: manager codeForByteInteger.
|
|
|
1536 |
stream nextPut: self.
|
|
|
1537 |
^ self
|
|
|
1538 |
].
|
|
2
|
1539 |
stream nextPut: (((self bitShift: -24) bitAnd: 16rFF) bitOr: 16r80).
|
|
|
1540 |
stream nextPut: ((self bitShift: -16) bitAnd: 16rFF).
|
|
|
1541 |
stream nextPut: ((self bitShift: -8) bitAnd: 16rFF).
|
|
|
1542 |
stream nextPut: (self bitAnd: 16rFF)
|
|
1
|
1543 |
! !
|
|
|
1544 |
|
|
|
1545 |
!SmallInteger methodsFor:'printing & storing'!
|
|
|
1546 |
|
|
62
|
1547 |
printOn:aStream
|
|
68
|
1548 |
"append my printstring (base 10) to aStream."
|
|
62
|
1549 |
|
|
|
1550 |
aStream nextPutAll:(self printString)
|
|
|
1551 |
!
|
|
|
1552 |
|
|
1
|
1553 |
printString
|
|
|
1554 |
"return my printstring (base 10)"
|
|
|
1555 |
|
|
68
|
1556 |
"since printf knows pretty good how to do this,
|
|
|
1557 |
here is an exception to the rule of basing printString
|
|
|
1558 |
upon the printOn: method."
|
|
|
1559 |
|
|
1
|
1560 |
%{ /* NOCONTEXT */
|
|
|
1561 |
|
|
|
1562 |
char buffer[30];
|
|
|
1563 |
OBJ newString;
|
|
13
|
1564 |
#ifdef THISCONTEXT_IN_REGISTER
|
|
1
|
1565 |
OBJ sav = __thisContext;
|
|
|
1566 |
#endif
|
|
|
1567 |
|
|
|
1568 |
sprintf(buffer, "%d", _intVal(self));
|
|
13
|
1569 |
#ifdef THISCONTEXT_IN_REGISTER
|
|
1
|
1570 |
__thisContext = sav;
|
|
|
1571 |
#endif
|
|
|
1572 |
_qNew(newString, sizeof(struct stringheader) + strlen(buffer) + 1, SENDER);
|
|
|
1573 |
_InstPtr(newString)->o_class = String;
|
|
|
1574 |
strcpy(_stringVal(newString), buffer);
|
|
|
1575 |
RETURN (newString);
|
|
|
1576 |
%}
|
|
|
1577 |
!
|
|
|
1578 |
|
|
68
|
1579 |
printOn:aStream base:radix
|
|
|
1580 |
"append my printstring in any number base to aStream.
|
|
|
1581 |
The radix argument should be between 2 and 36."
|
|
|
1582 |
|
|
|
1583 |
aStream nextPutAll:(self printStringRadix:radix)
|
|
|
1584 |
!
|
|
|
1585 |
|
|
1
|
1586 |
printStringRadix:radix
|
|
62
|
1587 |
"return my printstring (optimized for bases 16, 10 and 8)"
|
|
1
|
1588 |
|
|
|
1589 |
%{ /* NOCONTEXT */
|
|
|
1590 |
|
|
|
1591 |
char *format = (char *)0;
|
|
|
1592 |
char buffer[30];
|
|
|
1593 |
OBJ newString;
|
|
|
1594 |
|
|
|
1595 |
if (_isSmallInteger(radix)) {
|
|
|
1596 |
switch (_intVal(radix)) {
|
|
2
|
1597 |
case 10:
|
|
|
1598 |
format = "%d";
|
|
|
1599 |
break;
|
|
|
1600 |
case 16:
|
|
|
1601 |
format = "%x";
|
|
|
1602 |
break;
|
|
|
1603 |
case 8:
|
|
|
1604 |
format = "%o";
|
|
|
1605 |
break;
|
|
|
1606 |
}
|
|
1
|
1607 |
}
|
|
|
1608 |
|
|
|
1609 |
if (format) {
|
|
13
|
1610 |
#ifdef THISCONTEXT_IN_REGISTER
|
|
1
|
1611 |
OBJ sav = __thisContext;
|
|
|
1612 |
#endif
|
|
|
1613 |
sprintf(buffer, format, _intVal(self));
|
|
13
|
1614 |
#ifdef THISCONTEXT_IN_REGISTER
|
|
1
|
1615 |
__thisContext = sav;
|
|
|
1616 |
#endif
|
|
|
1617 |
_qNew(newString, sizeof(struct stringheader) + strlen(buffer) + 1, SENDER);
|
|
|
1618 |
_InstPtr(newString)->o_class = String;
|
|
|
1619 |
strcpy(_stringVal(newString), buffer);
|
|
|
1620 |
RETURN (newString);
|
|
|
1621 |
}
|
|
|
1622 |
%}
|
|
|
1623 |
.
|
|
62
|
1624 |
"fall back for seldom used bases"
|
|
1
|
1625 |
^ super printStringRadix:radix
|
|
62
|
1626 |
|
|
|
1627 |
"123 printStringRadix:16"
|
|
|
1628 |
"123 printStringRadix:8"
|
|
|
1629 |
"123 printStringRadix:2"
|
|
|
1630 |
"123 printStringRadix:3"
|
|
|
1631 |
"123 printStringRadix:1"
|
|
1
|
1632 |
!
|
|
|
1633 |
|
|
|
1634 |
printfPrintString:formatString
|
|
|
1635 |
"non-portable, but sometimes useful.
|
|
|
1636 |
return a printed representation of the receiver
|
|
62
|
1637 |
as specified by formatString, which is defined by the C-
|
|
|
1638 |
function 'printf'.
|
|
|
1639 |
No checking for string overrun - the resulting string
|
|
|
1640 |
must be shorter than 256 chars or else ...
|
|
|
1641 |
This method is NONSTANDARD and may be removed without notice."
|
|
1
|
1642 |
|
|
13
|
1643 |
%{ /* STACK: 400 */
|
|
1
|
1644 |
|
|
|
1645 |
char buffer[256];
|
|
|
1646 |
|
|
62
|
1647 |
if (__isString(formatString)) {
|
|
13
|
1648 |
#ifdef THISCONTEXT_IN_REGISTER
|
|
1
|
1649 |
OBJ sav = __thisContext;
|
|
|
1650 |
#endif
|
|
|
1651 |
sprintf(buffer, _stringVal(formatString), _intVal(self));
|
|
13
|
1652 |
#ifdef THISCONTEXT_IN_REGISTER
|
|
1
|
1653 |
__thisContext = sav;
|
|
|
1654 |
#endif
|
|
|
1655 |
RETURN ( _MKSTRING(buffer COMMA_SND) );
|
|
|
1656 |
}
|
|
|
1657 |
%}
|
|
|
1658 |
.
|
|
|
1659 |
self primitiveFailed
|
|
|
1660 |
|
|
|
1661 |
"123 printfPrintString:'%%d -> %d'"
|
|
|
1662 |
"123 printfPrintString:'%%6d -> %6d'"
|
|
|
1663 |
"123 printfPrintString:'%%x -> %x'"
|
|
|
1664 |
"123 printfPrintString:'%%4x -> %4x'"
|
|
|
1665 |
"123 printfPrintString:'%%04x -> %04x'"
|
|
|
1666 |
! !
|