Re: [HACKERS] [PATCH] Push limit to sort through a subquery
От | Tom Lane |
---|---|
Тема | Re: [HACKERS] [PATCH] Push limit to sort through a subquery |
Дата | |
Msg-id | 406.1503673121@sss.pgh.pa.us обсуждение исходный текст |
Ответ на | Re: [HACKERS] [PATCH] Push limit to sort through a subquery (Amit Kapila <amit.kapila16@gmail.com>) |
Список | pgsql-hackers |
Amit Kapila <amit.kapila16@gmail.com> writes: > On Fri, Aug 25, 2017 at 7:35 PM, Tom Lane <tgl@sss.pgh.pa.us> wrote: >> it would be stupid to put a filter on that node rather than its >> children, but I see this in both nodeGather.c and nodeGatherMerge.c: >> >> gatherstate->ps.qual = >> ExecInitQual(node->plan.qual, (PlanState *) gatherstate); >> >> It doesn't look like the qual is actually used anywhere in either node >> type. Am I right in thinking this is dead code? > I also think so. I think this was required in some initial versions > of gather node patch where we were thinking of having a single node > (instead of what we have now that Gather node and beneath there will > be partial scan node) to perform parallel scans. Thanks for confirming. I'll replace that with something like Assert(!node->plan.qual). I have some other code-review-ish fixes to do in nodeGatherMerge, too. regards, tom lane
В списке pgsql-hackers по дате отправления: