summaryrefslogtreecommitdiff
path: root/embed.h
diff options
context:
space:
mode:
authorJarkko Hietaniemi <jhi@iki.fi>2001-11-21 22:25:14 +0000
committerJarkko Hietaniemi <jhi@iki.fi>2001-11-21 22:25:14 +0000
commit84d4ea48280f6b54fdc70fe4c8b9494e3331071e (patch)
tree67eb1ba8c72d793358608e97b8bcb9aa431b1d71 /embed.h
parentc85707204c5d2a93ef021c88e43a92ba2d602304 (diff)
downloadperl-84d4ea48280f6b54fdc70fe4c8b9494e3331071e.tar.gz
Implement the sort pragma. Split sort code from pp_ctl.c
to pp_sort.c. Includes the quicksort stabilizing layer from John P. Linderman. -Msort=qsort or -Msort=fast is faster than without (or with -Msort=mergesort or -Msort=safe) for short random inputs, but for some reason not quite as fast as 5.6.1 qsort. More benchmarking, profiling, tuning, and optimizing definitely needed. p4raw-id: //depot/perl@13179
Diffstat (limited to 'embed.h')
-rw-r--r--embed.h2
1 files changed, 0 insertions, 2 deletions
diff --git a/embed.h b/embed.h
index 269a1178ac..fabd31c84e 100644
--- a/embed.h
+++ b/embed.h
@@ -399,7 +399,6 @@
#define mess Perl_mess
#define vmess Perl_vmess
#define qerror Perl_qerror
-#define sortsv Perl_sortsv
#define mg_clear Perl_mg_clear
#define mg_copy Perl_mg_copy
#define mg_find Perl_mg_find
@@ -1916,7 +1915,6 @@
#endif
#define vmess(a,b) Perl_vmess(aTHX_ a,b)
#define qerror(a) Perl_qerror(aTHX_ a)
-#define sortsv(a,b,c) Perl_sortsv(aTHX_ a,b,c)
#define mg_clear(a) Perl_mg_clear(aTHX_ a)
#define mg_copy(a,b,c,d) Perl_mg_copy(aTHX_ a,b,c,d)
#define mg_find(a,b) Perl_mg_find(aTHX_ a,b)