Re: Inlining comparators as a performance optimisation
От | Robert Haas |
---|---|
Тема | Re: Inlining comparators as a performance optimisation |
Дата | |
Msg-id | CA+TgmoaNFiuLFgguiHvXZ-Xz5BE9n6amGa7rqOEiiVC7jSfk3w@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: Inlining comparators as a performance optimisation (Tom Lane <tgl@sss.pgh.pa.us>) |
Ответы |
Re: Inlining comparators as a performance optimisation
|
Список | pgsql-hackers |
On Fri, Dec 2, 2011 at 12:16 AM, Tom Lane <tgl@sss.pgh.pa.us> wrote: > It should be the same or better. Right now, we are going through > FunctionCall2Coll to reach the FCI-style comparator. The shim function > would be more or less equivalent to that, and since it's quite special > purpose I would hope we could shave a cycle or two. For instance, we > could probably afford to set up a dedicated FunctionCallInfo struct > associated with the SortSupportInfo struct, and not have to reinitialize > one each time. OK, but I think it's also going to cost you an extra syscache lookup, no? You're going to have to check for this new support function first, and then if you don't find it, you'll have to check for the original one. I don't think there's any higher-level caching around opfamilies to save our bacon here, is there? -- Robert Haas EnterpriseDB: http://www.enterprisedb.com The Enterprise PostgreSQL Company
В списке pgsql-hackers по дате отправления: