/
utils.c
776 lines (563 loc) · 16.1 KB
/
utils.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
/*
Copyright (C) 2001-2010, Parrot Foundation.
=head1 NAME
src/utils.c - Some utility functions
=head1 DESCRIPTION
Opcode helper functions that don't really fit elsewhere.
=head2 Functions
=over 4
=cut
*/
#include "parrot/parrot.h"
#include "parrot/extend.h"
#include "pmc/pmc_nci.h"
typedef unsigned short _rand_buf[3];
/* Parrot_util_register_move companion functions i and data */
typedef struct parrot_prm_context {
unsigned char *dest_regs;
unsigned char *src_regs;
unsigned char temp_reg;
int* nb_succ;
int* backup;
int* reg_to_index;
Interp *interp;
reg_move_func mov;
reg_move_func mov_alt;
void *info;
} parrot_prm_context;
/* HEADERIZER HFILE: include/parrot/misc.h */
/* HEADERIZER BEGIN: static */
/* Don't modify between HEADERIZER BEGIN / HEADERIZER END. Your changes will be lost. */
static FLOATVAL _drand48(void);
static FLOATVAL _erand48(_rand_buf buf);
static long _jrand48(_rand_buf buf);
static long _lrand48(void);
static long _mrand48(void);
static long _nrand48(_rand_buf buf);
static void _srand48(long seed);
static INTVAL COMPARE(PARROT_INTERP,
ARGIN(void *a),
ARGIN(void *b),
ARGIN(PMC *cmp),
ARGIN(const char * cmp_signature))
__attribute__nonnull__(1)
__attribute__nonnull__(2)
__attribute__nonnull__(3)
__attribute__nonnull__(4)
__attribute__nonnull__(5);
static void next_rand(_rand_buf X);
#define ASSERT_ARGS__drand48 __attribute__unused__ int _ASSERT_ARGS_CHECK = (0)
#define ASSERT_ARGS__erand48 __attribute__unused__ int _ASSERT_ARGS_CHECK = (0)
#define ASSERT_ARGS__jrand48 __attribute__unused__ int _ASSERT_ARGS_CHECK = (0)
#define ASSERT_ARGS__lrand48 __attribute__unused__ int _ASSERT_ARGS_CHECK = (0)
#define ASSERT_ARGS__mrand48 __attribute__unused__ int _ASSERT_ARGS_CHECK = (0)
#define ASSERT_ARGS__nrand48 __attribute__unused__ int _ASSERT_ARGS_CHECK = (0)
#define ASSERT_ARGS__srand48 __attribute__unused__ int _ASSERT_ARGS_CHECK = (0)
#define ASSERT_ARGS_COMPARE __attribute__unused__ int _ASSERT_ARGS_CHECK = (\
PARROT_ASSERT_ARG(interp) \
, PARROT_ASSERT_ARG(a) \
, PARROT_ASSERT_ARG(b) \
, PARROT_ASSERT_ARG(cmp) \
, PARROT_ASSERT_ARG(cmp_signature))
#define ASSERT_ARGS_next_rand __attribute__unused__ int _ASSERT_ARGS_CHECK = (0)
/* Don't modify between HEADERIZER BEGIN / HEADERIZER END. Your changes will be lost. */
/* HEADERIZER END: static */
#define move_reg(from, dest, c) (c)->mov((c)->interp, (unsigned char)(dest), \
(unsigned char)(from), (c)->info)
/*
=item C<INTVAL Parrot_util_intval_mod(INTVAL i2, INTVAL i3)>
NOTE: This "corrected mod" algorithm is based on the C code on page 70
of [1]. Assuming correct behavior of the built-in mod operator (%) with
positive arguments, this algorithm implements a mathematically
convenient version of mod, defined thus:
x mod y = x - y * floor(x / y)
For more information on this definition of mod, see section 3.4 of [2],
pages 81-85.
References:
[1] Donald E. Knuth, *MMIXware: A RISC Computer for the Third
Millennium* Springer, 1999.
[2] Ronald L. Graham, Donald E. Knuth and Oren Patashnik, *Concrete
Mathematics*, Second Edition. Addison-Wesley, 1994.
=cut
*/
PARROT_CONST_FUNCTION
PARROT_WARN_UNUSED_RESULT
INTVAL
Parrot_util_intval_mod(INTVAL i2, INTVAL i3)
{
ASSERT_ARGS(Parrot_util_intval_mod)
INTVAL z = i3;
if (z == 0)
return i2;
else {
INTVAL r;
INTVAL y;
int s = 0;
y = i2;
if (y < 0) { s += 2; y = -y; }
if (z < 0) { s += 1; z = -z; }
r = y % z;
if (r) { /* # 36003 */
switch (s) {
case 0: break;
case 1: r = r - z; break;
case 2: r = z - r; break;
case 3: r = -r; break;
default: break;
}
}
return r;
}
}
/*
=item C<FLOATVAL Parrot_util_floatval_mod(FLOATVAL n2, FLOATVAL n3)>
Returns C<n2 mod n3>.
Includes a workaround for buggy code generation in the C<lcc> compiler.
=cut
*/
PARROT_CONST_FUNCTION
PARROT_WARN_UNUSED_RESULT
FLOATVAL
Parrot_util_floatval_mod(FLOATVAL n2, FLOATVAL n3)
{
ASSERT_ARGS(Parrot_util_floatval_mod)
#ifdef __LCC__
/* Another workaround for buggy code generation in the lcc compiler-
* adding a temporary variable makes it pass the test.
*/
const FLOATVAL temp = n3 * floor(n2 / n3);
return !FLOAT_IS_ZERO(n3)
? (n2 - temp)
: n2;
#else
return !FLOAT_IS_ZERO(n3)
? (n2 - n3 * floor(n2 / n3))
: n2;
#endif
}
/*
=back
=head2 Random Number Generator
Based on the C<rand48()> family of functions.
=over 4
=cut
*/
/*
* currently undefined
*/
#ifndef PARROT_HAS_DRAND48
/*
* s. man drand48, SuS V2
*
* X(n+1) = ( aX(n) + c ) mod 2^48
*
*/
# define A_lo 0xE66D
# define A_mid 0xDEEC
# define A_hi 0x5
# define C 0xB
# define SEED_LO 0x330E
static _rand_buf a = { A_lo, A_mid, A_hi };
static _rand_buf last_rand;
static unsigned short c = C;
/*
=item C<static void next_rand(_rand_buf X)>
Returns the next random number in C<X>.
=cut
*/
static void
next_rand(_rand_buf X)
{
ASSERT_ARGS(next_rand)
unsigned short lo, mid, hi;
unsigned int t;
/* 48 bit mul, one short at a time */
t = X[0] * a[0] + c;
lo = t & 0xffff;
mid = (t >> 16) & 0xffff;
t = X[1] * a[0] + X[0] * a[1] + mid;
mid = t & 0xffff;
hi = (t >> 16) & 0xffff;
t = X[2] * a[0] + X[1] * a[1] + X[0] * a[2] + hi;
X[0] = lo;
X[1] = mid;
X[2] = t & 0xffff;
}
/*
=item C<static FLOATVAL _erand48(_rand_buf buf)>
Returns a C<double> in the interval C<[0.0, 1.0)>.
=cut
*/
static FLOATVAL
_erand48(_rand_buf buf)
{
ASSERT_ARGS(_erand48)
FLOATVAL r;
next_rand(buf);
r = ((buf[0] / 65536.0 + buf[1]) / 65536.0 + buf[2]) / 65536.0;
return r;
}
/*
=item C<static FLOATVAL _drand48(void)>
Returns a C<double> in the interval C<[0.0, 1.0)>.
=cut
*/
static FLOATVAL
_drand48(void)
{
ASSERT_ARGS(_drand48)
return _erand48(last_rand);
}
/*
=item C<static long _jrand48(_rand_buf buf)>
Returns a C<long> in the interval C<[-2^31, 2^31)>.
=cut
*/
static long
_jrand48(_rand_buf buf)
{
ASSERT_ARGS(_jrand48)
long ret;
next_rand(buf);
ret = buf[2] << 16 | buf[1];
return ret;
}
/*
=item C<static long _nrand48(_rand_buf buf)>
Returns a C<long> in the interval C<[0, 2^31)>.
=cut
*/
static long
_nrand48(_rand_buf buf)
{
ASSERT_ARGS(_nrand48)
return _jrand48(buf) & 0x7fffffff;
}
/*
=item C<static long _lrand48(void)>
Returns a C<long> in the interval C<[0, 2^31)>.
=cut
*/
static long
_lrand48(void)
{
ASSERT_ARGS(_lrand48)
return _nrand48(last_rand);
}
/*
=item C<static long _mrand48(void)>
Returns a C<long> in the interval C<[-2^31, 2^31)>.
=cut
*/
static long
_mrand48(void)
{
ASSERT_ARGS(_mrand48)
return _jrand48(last_rand);
}
/*
=item C<static void _srand48(long seed)>
Sets the high order 32 bits to the argument C<seed>. The low order 16
bits are set to the arbitrary value 0x330e.
=cut
*/
static void
_srand48(long seed)
{
ASSERT_ARGS(_srand48)
last_rand[0] = SEED_LO;
last_rand[1] = (unsigned short)(seed & 0xffff);
last_rand[2] = (unsigned short)((seed >> 16) & 0xffff);
/*
* reinit a, c if changed by lcong48()
*/
}
# undef A_lo
# undef A_mid
# undef A_hi
# undef C
#else
# define _drand48 drand48
# define _erand48(b) erand48(b)
# define _lrand48 lrand48
# define _nrand48(b) nrand48(b)
# define _mrand48 mrand48
# define _jrand48(b) jrand48(b)
# define _srand48 srand48
#endif
/*
=item C<FLOATVAL Parrot_util_float_rand(INTVAL how_random)>
Returns a C<FLOATVAL> uniformly distributed in the in the interval
C<[0.0, 1.0]>.
C<how_random> is currently ignored.
=cut
*/
PARROT_EXPORT
PARROT_WARN_UNUSED_RESULT
FLOATVAL
Parrot_util_float_rand(INTVAL how_random)
{
ASSERT_ARGS(Parrot_util_float_rand)
UNUSED(how_random);
return _drand48(); /* [0.0..1.0] */
}
/*
=item C<INTVAL Parrot_util_uint_rand(INTVAL how_random)>
Returns an C<INTVAL> uniformly distributed in the interval C<[0, 2^31)>.
C<how_random> is ignored.
=cut
*/
PARROT_EXPORT
PARROT_WARN_UNUSED_RESULT
INTVAL
Parrot_util_uint_rand(INTVAL how_random)
{
ASSERT_ARGS(Parrot_util_uint_rand)
UNUSED(how_random);
return _lrand48(); /* [0..2^31] */
}
/*
=item C<INTVAL Parrot_util_int_rand(INTVAL how_random)>
Returns an C<INTVAL> in the interval C<[-2^31, 2^31)>.
C<how_random> is ignored.
=cut
*/
PARROT_EXPORT
PARROT_WARN_UNUSED_RESULT
INTVAL
Parrot_util_int_rand(INTVAL how_random)
{
ASSERT_ARGS(Parrot_util_int_rand)
UNUSED(how_random);
return _mrand48(); /* [-2^31..2^31] */
}
/*
=item C<INTVAL Parrot_util_range_rand(INTVAL from, INTVAL to, INTVAL
how_random)>
Returns an C<INTVAL> in the range C<[from, to]>.
C<how_random> is ignored.
=cut
*/
PARROT_EXPORT
PARROT_WARN_UNUSED_RESULT
INTVAL
Parrot_util_range_rand(INTVAL from, INTVAL to, INTVAL how_random)
{
ASSERT_ARGS(Parrot_util_range_rand)
const double spread = (double)(to - from + 1);
const double randpart = Parrot_util_float_rand(how_random);
const INTVAL raw = from + (INTVAL)(spread * randpart);
return raw;
}
/*
=item C<void Parrot_util_srand(INTVAL seed)>
Seeds the random number generator with C<seed>.
=cut
*/
PARROT_EXPORT
void
Parrot_util_srand(INTVAL seed)
{
ASSERT_ARGS(Parrot_util_srand)
_srand48(seed);
}
/* &gen_from_enum(tm.pasm) */
typedef enum {
TM_SEC,
TM_MIN,
TM_HOUR,
TM_MDAY,
TM_MON,
TM_YEAR,
TM_WDAY,
TM_YDAY,
TM_ISDST
} tm_struct_enum;
/* &end_gen */
/*
=item C<PMC* Parrot_util_tm_to_array(PARROT_INTERP, const struct tm *tm)>
Helper to convert a B<struct tm *> to an Array
=cut
*/
PARROT_EXPORT
PARROT_WARN_UNUSED_RESULT
PARROT_CANNOT_RETURN_NULL
PMC*
Parrot_util_tm_to_array(PARROT_INTERP, ARGIN(const struct tm *tm))
{
ASSERT_ARGS(Parrot_util_tm_to_array)
PMC * const Array = Parrot_pmc_new(interp,
Parrot_hll_get_ctx_HLL_type(interp, enum_class_FixedIntegerArray));
VTABLE_set_integer_native(interp, Array, 9);
VTABLE_set_integer_keyed_int(interp, Array, 0, tm->tm_sec);
VTABLE_set_integer_keyed_int(interp, Array, 1, tm->tm_min);
VTABLE_set_integer_keyed_int(interp, Array, 2, tm->tm_hour);
VTABLE_set_integer_keyed_int(interp, Array, 3, tm->tm_mday);
VTABLE_set_integer_keyed_int(interp, Array, 4, tm->tm_mon + 1);
VTABLE_set_integer_keyed_int(interp, Array, 5, tm->tm_year + 1900);
VTABLE_set_integer_keyed_int(interp, Array, 6, tm->tm_wday);
VTABLE_set_integer_keyed_int(interp, Array, 7, tm->tm_yday);
VTABLE_set_integer_keyed_int(interp, Array, 8, tm->tm_isdst);
return Array;
}
/*
=item C<INTVAL Parrot_util_byte_index(PARROT_INTERP, const STRING *base, const
STRING *search, UINTVAL start_offset)>
Looks for the location of a substring within a longer string. Takes
pointers to the strings and the offset within the string at which
to start searching as arguments.
Returns an offset value if it is found, or -1 if no match.
=cut
*/
PARROT_EXPORT
PARROT_WARN_UNUSED_RESULT
PARROT_PURE_FUNCTION
INTVAL
Parrot_util_byte_index(SHIM_INTERP, ARGIN(const STRING *base),
ARGIN(const STRING *search), UINTVAL start_offset)
{
ASSERT_ARGS(Parrot_util_byte_index)
const char * const str_start = base->strstart;
const INTVAL str_len = base->strlen;
const char * const search_str = search->strstart;
const INTVAL search_len = search->strlen;
const char *str_pos = str_start + start_offset;
INTVAL len_remain = str_len - start_offset;
const char *search_pos;
/* find the next position of the first character in the search string
* Parrot strings can have NULLs, so strchr() won't work here */
while ((search_pos = (const char *)memchr(str_pos, *search_str, len_remain))) {
const INTVAL offset = search_pos - str_start;
/* now look for the entire string */
if (memcmp(search_pos, search_str, search_len) == 0)
return offset;
/* otherwise loop and memchr() with the rest of the string */
len_remain = str_len - offset;
str_pos = search_pos + 1;
if (len_remain < search_len)
return -1;
}
return -1;
}
/*
=item C<INTVAL Parrot_util_byte_rindex(PARROT_INTERP, const STRING *base, const
STRING *search, UINTVAL start_offset)>
Substring search (like Parrot_util_byte_index), but works backwards,
from the rightmost end of the string.
Returns offset value or -1 (if no match).
=cut
*/
PARROT_EXPORT
PARROT_WARN_UNUSED_RESULT
PARROT_PURE_FUNCTION
INTVAL
Parrot_util_byte_rindex(SHIM_INTERP, ARGIN(const STRING *base),
ARGIN(const STRING *search), UINTVAL start_offset)
{
ASSERT_ARGS(Parrot_util_byte_rindex)
const INTVAL searchlen = search->strlen;
const char * const search_start = (const char *)(search->strstart);
UINTVAL max_possible_offset = (base->strlen - search->strlen);
INTVAL current_offset;
if (start_offset && start_offset < max_possible_offset)
max_possible_offset = start_offset;
for (current_offset = max_possible_offset; current_offset >= 0;
current_offset--) {
const char * const base_start = (char *)(base->strstart) + current_offset;
if (memcmp(base_start, search_start, searchlen) == 0) {
return current_offset;
}
}
return -1;
}
typedef INTVAL (*sort_func_t)(PARROT_INTERP, void *, void *);
/*
=item C<static INTVAL COMPARE(PARROT_INTERP, void *a, void *b, PMC *cmp, const
char * cmp_signature)>
General PMC comparison function. Takes two PMCs. Returns 0 if they are equal,
returns 1 if C<a> is bigger, and returns -1 if C<b> is bigger.
=cut
*/
/* TODO: Macroize COMPARE */
/* This is an awfully expensive function to call, what with all the */
/* comparisons that never change. We ought to precompute everything. */
/* XXX We should be able to guarantee that *a and *b never change via const parameters. */
static INTVAL
COMPARE(PARROT_INTERP, ARGIN(void *a), ARGIN(void *b),
ARGIN(PMC *cmp),
ARGIN(const char * cmp_signature))
{
ASSERT_ARGS(COMPARE)
INTVAL result = 0;
if (PMC_IS_NULL(cmp))
return VTABLE_cmp(interp, (PMC *)a, (PMC *)b);
if (cmp->vtable->base_type == enum_class_NCI) {
const sort_func_t f = (sort_func_t)D2FPTR(PARROT_NCI(cmp)->func);
return f(interp, a, b);
}
Parrot_ext_call(interp, cmp, cmp_signature, a, b, &result);
return result;
}
/*
=item C<void Parrot_util_quicksort(PARROT_INTERP, void **data, UINTVAL n, PMC
*cmp, const char * cmp_signature)>
Perform a quicksort on a PMC array.
cmp_signature is PCC signature for C<cmp>. E.g. C<II->I> for FIA.
=cut
*/
void
Parrot_util_quicksort(PARROT_INTERP, ARGMOD(void **data), UINTVAL n,
ARGIN(PMC *cmp),
ARGIN(const char * cmp_signature))
{
ASSERT_ARGS(Parrot_util_quicksort)
while (n > 1) {
UINTVAL i, j, ln, rn;
void *temp;
/* Swap */
temp = data[0];
data[0] = data[n/2];
data[n/2] = temp;
for (i = 0, j = n; ;) {
do
--j;
while (j > 0 && COMPARE(interp, data[j], data[0], cmp, cmp_signature) > 0);
do
++i;
while (i < j && COMPARE(interp, data[i], data[0], cmp, cmp_signature) < 0);
if (i >= j)
break;
/* Swap */
temp = data[i];
data[i] = data[j];
data[j] = temp;
}
/* Swap */
temp = data[j];
data[j] = data[0];
data[0] = temp;
ln = j;
rn = n - ++j;
if (ln < rn) {
Parrot_util_quicksort(interp, data, ln, cmp, cmp_signature);
data += j;
n = rn;
}
else {
Parrot_util_quicksort(interp, data + j, rn, cmp, cmp_signature);
n = ln;
}
}
}
/*
=back
=head1 SEE ALSO
F<include/parrot/misc.h>
=cut
*/
/*
* Local variables:
* c-file-style: "parrot"
* End:
* vim: expandtab shiftwidth=4 cinoptions='\:2=2' :
*/