Re: [BUGS] BUG #14722: Segfault in tuplesort_heap_siftup, 32 bit overflow
От | Peter Geoghegan |
---|---|
Тема | Re: [BUGS] BUG #14722: Segfault in tuplesort_heap_siftup, 32 bit overflow |
Дата | |
Msg-id | CAH2-Wzn19GKyEyNr3dXeazbBSstEEtaBO3MCQWwFqZs_bb52Zw@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: [BUGS] BUG #14722: Segfault in tuplesort_heap_siftup, 32 bitoverflow (Andres Freund <andres@anarazel.de>) |
Ответы |
Re: [BUGS] BUG #14722: Segfault in tuplesort_heap_siftup, 32 bit overflow
|
Список | pgsql-bugs |
On Wed, Jul 5, 2017 at 3:14 PM, Andres Freund <andres@anarazel.de> wrote: > Isn't an added conditional likely going to be more costly than the > s/32/64/ bit calculations on the majority of machines pg runs on? I'm > quite doubtful that it's worth catering for the few cases where that's > really slow. I doubt that myself. Especially prior to Postgres 10, where merging will have tuplesort_heap_insert() as the bottleneck. In Postgres 10, tuplesort external sort run merging became much faster following commit 24598337c8d. It might be noticeable if such a machine were using Postgres 10 already, and really had something to lose, but that seems very unlikely. -- Peter Geoghegan -- Sent via pgsql-bugs mailing list (pgsql-bugs@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-bugs
В списке pgsql-bugs по дате отправления: