-
Notifications
You must be signed in to change notification settings - Fork 1
/
utils.c
937 lines (676 loc) · 19.5 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
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
/*
Copyright (C) 2001-2008, The Perl Foundation.
$Id$
=head1 NAME
src/utils.c - Some utility functions
=head1 DESCRIPTION
Prototypes are in F<src/misc.h>.
Opcode helper functions that don't really fit elsewhere.
=head2 Functions
=over 4
=cut
*/
#include "parrot/parrot.h"
typedef unsigned short _rand_buf[3];
/* Parrot_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))
__attribute__nonnull__(1)
__attribute__nonnull__(2)
__attribute__nonnull__(3)
__attribute__nonnull__(4);
static void next_rand(_rand_buf X);
static void process_cycle_without_exit(
int node_index,
ARGIN(parrot_prm_context* c))
__attribute__nonnull__(2);
static void rec_climb_back_and_mark(
int node_index,
ARGIN(parrot_prm_context* c))
__attribute__nonnull__(2);
static void swap(ARGMOD(void **x), ARGMOD(void **y))
__attribute__nonnull__(1)
__attribute__nonnull__(2)
FUNC_MODIFIES(*x)
FUNC_MODIFIES(*y);
/* 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 intval_mod>
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
INTVAL
intval_mod(INTVAL i2, INTVAL i3)
{
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 floatval_mod>
Returns C<n2 mod n3>.
Includes a workaround for buggy code generation in the C<lcc> compiler.
=cut
*/
PARROT_CONST_FUNCTION
FLOATVAL
floatval_mod(FLOATVAL n2, FLOATVAL n3)
{
#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>
Returns the next random number in C<X>.
=cut
*/
static void
next_rand(_rand_buf X)
{
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>
Returns a C<double> in the interval C<[0.0, 1.0)>.
=cut
*/
static FLOATVAL
_erand48(_rand_buf buf)
{
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>
Returns a C<double> in the interval C<[0.0, 1.0)>.
=cut
*/
static FLOATVAL
_drand48(void)
{
return _erand48(last_rand);
}
/*
=item C<static long _jrand48>
Returns a C<long> in the interval C<[-2^31, 2^31)>.
=cut
*/
static long
_jrand48(_rand_buf buf)
{
long ret;
next_rand(buf);
ret = buf[2] << 16 | buf[1];
return ret;
}
/*
=item C<static long _nrand48>
Returns a C<long> in the interval C<[0, 2^31)>.
=cut
*/
static long
_nrand48(_rand_buf buf)
{
return _jrand48(buf) & 0x7fffffff;
}
/*
=item C<static long _lrand48>
Returns a C<long> in the interval C<[0, 2^31)>.
=cut
*/
static long
_lrand48(void)
{
return _nrand48(last_rand);
}
/*
=item C<static long _mrand48>
Returns a C<long> in the interval C<[-2^31, 2^31)>.
=cut
*/
static long
_mrand48(void)
{
return _jrand48(last_rand);
}
/*
=item C<static void _srand48>
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)
{
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_float_rand>
Returns a C<FLOATVAL> in the interval C<[0.0, 1.0)>.
C<how_random> is ignored.
=cut
*/
PARROT_EXPORT
FLOATVAL
Parrot_float_rand(INTVAL how_random)
{
UNUSED(how_random);
return _drand48(); /* [0.0..1.0] */
}
/*
=item C<INTVAL Parrot_uint_rand>
Returns an C<INTVAL> in the interval C<[0, 2^31)>.
C<how_random> is ignored.
=cut
*/
PARROT_EXPORT
INTVAL
Parrot_uint_rand(INTVAL how_random)
{
UNUSED(how_random);
return _lrand48(); /* [0..2^31] */
}
/*
=item C<INTVAL Parrot_int_rand>
Returns an C<INTVAL> in the interval C<[-2^31, 2^31)>.
C<how_random> is ignored.
=cut
*/
PARROT_EXPORT
INTVAL
Parrot_int_rand(INTVAL how_random)
{
UNUSED(how_random);
return _mrand48(); /* [-2^31..2^31] */
}
/*
=item C<INTVAL Parrot_range_rand>
Returns an C<INTVAL> in the range C<[from, to]>.
C<how_random> is ignored.
=cut
*/
PARROT_EXPORT
INTVAL
Parrot_range_rand(INTVAL from, INTVAL to, INTVAL how_random)
{
return (INTVAL)(from + ((double)(to - from))
* Parrot_float_rand(how_random));
}
/*
=item C<void Parrot_srand>
Seeds the random number generator with C<seed>.
=cut
*/
PARROT_EXPORT
void
Parrot_srand(INTVAL seed)
{
_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* tm_to_array>
Helper to convert a B<struct tm *> to an Array
=cut
*/
PARROT_WARN_UNUSED_RESULT
PARROT_CANNOT_RETURN_NULL
PMC*
tm_to_array(PARROT_INTERP, ARGIN(const struct tm *tm))
{
PMC * const Array = pmc_new(interp, enum_class_Array);
PARROT_ASSERT(tm);
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_byte_index>
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
INTVAL
Parrot_byte_index(SHIM_INTERP, ARGIN(const STRING *base),
ARGIN(const STRING *search), UINTVAL start_offset)
{
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_byte_rindex>
Substring search (like Parrot_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
INTVAL
Parrot_byte_rindex(SHIM_INTERP, ARGIN(const STRING *base),
ARGIN(const STRING *search), UINTVAL start_offset)
{
const INTVAL searchlen = search->strlen;
const char * const search_start = 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;
}
/*
=item C<static void rec_climb_back_and_mark>
Recursive function, used by Parrot_register_move to
climb back the graph of register moves operations.
The node must have a predecessor: it is implicit because if a node has
a node_index, it must have a predecessor because the node_index are the
index of registers in dest_regs[] array, so by definition they have
a corrsponding src_regs register.
Then it emits the move operation with its predecessor, or its backup
if already used/visited.
Then continues the climbing if the predecessor was not modified, anf in that
case marks it, and set node_index as its backup.
node_index ... the index of a destination (i.e. with a pred.) register
c ... the graph and all the needed params : the context
=cut
*/
static void
rec_climb_back_and_mark(int node_index, ARGIN(parrot_prm_context* c))
{
const int node = c->dest_regs[node_index];
const int pred = c->src_regs[node_index];
const int pred_index = c->reg_to_index[pred];
if (pred_index < 0) { /* pred has no predecessor */
move_reg(pred, node, c);
}
else { /* pred has a predecessor, so may be processed */
const int src = c->backup[pred_index];
if (src < 0) { /* not visited */
move_reg(pred, node, c);
c->backup[pred_index] = node; /* marks pred*/
rec_climb_back_and_mark(pred_index, c);
}
else { /* already visited, use backup instead */
move_reg(src, node, c);
}
}
}
/*
=item C<static void process_cycle_without_exit>
Recursive function, used by Parrot_register_move to handle the case
of cycles without exits, that are cycles of move ops between registers
where each register has exactly one predecessor and one successor
For instance: 1-->2, 2-->3, 3-->1
node_index ... the index of a destination (i.e. with a pred.) register
c ... the graph and all the needed params : the context
=cut
*/
static void
process_cycle_without_exit(int node_index, ARGIN(parrot_prm_context* c))
{
const int pred = c->src_regs[node_index];
/* let's try the alternate move function*/
const int alt =
c->mov_alt
? c->mov_alt(c->interp, c->dest_regs[node_index], pred, c->info)
: 0;
if (0 == alt) { /* use temp reg */
move_reg(c->dest_regs[node_index], c->temp_reg, c);
c->backup[node_index] = c->temp_reg;
}
else
c->backup[node_index] = c->dest_regs[node_index];
rec_climb_back_and_mark(node_index, c);
}
/*
=item C<void Parrot_register_move>
Move C<n_regs> from the given register list C<src_regs> to C<dest_regs>.
n_regs ... amount of registers to move
dest_regs ... list of register numbers 0..255
src_regs ... list of register numbers 0..255
temp_reg ... a register number not in one of these lists
mov ... a register move function to be called to move one register
mov_alt ... a register move function to be called to move one register
which triese fetching from an alternate src (or NULLfunc):
(void) (mov)(interp, dest, src, info);
moved = (mov_alt)(interp, dest, src, info);
Some C<dest_regs> might be the same as C<src_regs>, which makes this a bit
non-trivial, because if the destination is already clobbered, using it
later as source doesn"t work. E.g.
0 <- 1
1 <- 0 # register 0 already clobbered
or
2 <- 0
0 <- 1
3 <- 2 # register 2 already clobbered - reorder moves
To handle such cases, we do:
a) rearrange the order of moves (not possible in the first case)
and/or if that failed:
b) if an alternate move function is available, it may fetch the
source from a different (non-clobbered) location - call it.
if the function returns 0 also use c)
c) if no alternate move function is available, use the temp reg
The amount of register moves should of course be minimal.
TODO The current implementation will not work for following cases
Talked to Leo and he said those cases are not likely (Vishal Soni).
1. I0->I1 I1->I0 I0->I3
2. I1->I2 I3->I2
TODO: Add tests for the above conditions.
=cut
*/
PARROT_EXPORT
void
Parrot_register_move(PARROT_INTERP,
int n_regs,
ARGOUT(unsigned char *dest_regs),
ARGIN(unsigned char *src_regs),
unsigned char temp_reg,
reg_move_func mov,
reg_move_func mov_alt,
ARGIN(void *info))
{
int i;
int max_reg = 0;
int* nb_succ = NULL;
int* backup = NULL;
int* reg_to_index = NULL;
parrot_prm_context c;
if (n_regs == 0)
return;
if (n_regs == 1) {
if (src_regs[0] != dest_regs[0])
mov(interp, dest_regs[0], src_regs[0], info);
return;
}
c.interp = interp;
c.info = info;
c.mov = mov;
c.mov_alt = mov_alt;
c.src_regs = src_regs;
c.dest_regs = dest_regs;
c.temp_reg = temp_reg;
/* compute max_reg, the max reg number + 1 */
for (i = 0; i < n_regs; i++) {
if (src_regs[i] > max_reg)
max_reg = src_regs[i];
if (dest_regs[i] > max_reg)
max_reg = dest_regs[i];
}
++max_reg;
/* allocate space for data structures */
/* NOTA: data structures could be kept allocated somewhere waiting to get reused...*/
c.nb_succ = nb_succ = mem_allocate_n_zeroed_typed(n_regs, int);
c.backup = backup = mem_allocate_n_zeroed_typed(n_regs, int);
c.reg_to_index = reg_to_index = mem_allocate_n_zeroed_typed(max_reg, int);
/* init backup array */
for (i = 0; i < n_regs; i++)
backup[i] = -1;
/* fill in the conversion array between a register number and its index */
for (i = 0; i < max_reg; i++)
reg_to_index[i] = -1;
for (i = 0; i < n_regs; i++) {
const int index = dest_regs[i];
if (index != src_regs[i]) /* get rid of self-assignment */
reg_to_index[index] = i;
}
/* count the nb of successors for each reg index */
for (i = 0; i < n_regs; i++) {
const int index = reg_to_index[ src_regs[i] ];
if (index >= 0) /* not interested in the wells that have no preds */
nb_succ[ index ]++;
}
/* process each well if any */
for (i = 0; i < n_regs; i++) {
if (0 == nb_succ[i]) { /* a well */
rec_climb_back_and_mark(i, &c);
}
}
/* process remaining dest registers not processed */
/* remaining nodes are members of cycles without exits */
for (i = 0; i < n_regs; i++) {
if (0 < nb_succ[i] && 0 > backup[i]) { /* not a well nor visited*/
process_cycle_without_exit(i, &c);
}
}
mem_sys_free(nb_succ);
mem_sys_free(reg_to_index);
mem_sys_free(backup);
}
/* TODO: Macroize swap and COMPARE */
static void
swap(ARGMOD(void **x), ARGMOD(void **y))
{
void *t = *x;
*x = *y;
*y = t;
}
typedef INTVAL (*sort_func_t)(PARROT_INTERP, void *, void *);
static INTVAL
COMPARE(PARROT_INTERP, ARGIN(void *a), ARGIN(void *b), ARGIN(PMC *cmp))
{
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(PMC_struct_val(cmp));
return f(interp, a, b);
}
return Parrot_runops_fromc_args_reti(interp, cmp, "IPP", a, b);
}
void
Parrot_quicksort(PARROT_INTERP, ARGMOD(void **data), UINTVAL n, ARGIN(PMC *cmp))
{
while (n > 1) {
UINTVAL i, j, ln, rn;
swap(&data[0], &data[n / 2]);
for (i = 0, j = n; ;) {
do
--j;
while (j > 0 && COMPARE(interp, data[j], data[0], cmp) > 0);
do
++i;
while (i < j && COMPARE(interp, data[i], data[0], cmp) < 0);
if (i >= j)
break;
swap(&data[i], &data[j]);
}
swap(&data[j], &data[0]);
ln = j;
rn = n - ++j;
if (ln < rn) {
Parrot_quicksort(interp, data, ln, cmp);
data += j;
n = rn;
}
else {
Parrot_quicksort(interp, data + j, rn, cmp);
n = ln;
}
}
}
/*
=back
=head1 HISTORY
Initial version by leo 2003.09.09.
=cut
*/
/*
* Local variables:
* c-file-style: "parrot"
* End:
* vim: expandtab shiftwidth=4:
*/