From 044d25c73ce10d2b29008b875209d414303ccff7 Mon Sep 17 00:00:00 2001 From: Tomasz Konojacki Date: Tue, 3 Mar 2020 00:45:05 +0100 Subject: optimize sort by inlining comparison functions This makes special-cased forms such as sort { $b <=> $a } even faster. Also, since this commit removes PL_sort_RealCmp, it fixes the issue with nested sort calls mentioned in gh #16129 --- embedvar.h | 1 - 1 file changed, 1 deletion(-) (limited to 'embedvar.h') diff --git a/embedvar.h b/embedvar.h index ce6ec27cba..dff0af64d4 100644 --- a/embedvar.h +++ b/embedvar.h @@ -296,7 +296,6 @@ #define PL_sighandlerp (vTHX->Isighandlerp) #define PL_signalhook (vTHX->Isignalhook) #define PL_signals (vTHX->Isignals) -#define PL_sort_RealCmp (vTHX->Isort_RealCmp) #define PL_sortcop (vTHX->Isortcop) #define PL_sortstash (vTHX->Isortstash) #define PL_splitstr (vTHX->Isplitstr) -- cgit v1.2.1