newrte->eref=newrte->alias;

for (intrti=1;rti <=list_length(rte2->subquery->rtable);rti++)

{

RangeTblEntry*e=rt_fetch(rti,rte2->subquery->rtable);

if (e->rtekind==RTE_CTE&&strcmp(cte->ctename,e->ctename)==0)

if (e->rtekind==RTE_CTE&&

strcmp(cte->ctename,e->ctename)==0&&

e->ctelevelsup==2)

{

cte_rtindex=rti;

break;

}

}

Assert(cte_rtindex>0);

if (cte_rtindex <=0)

ereport(ERROR,

(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),

errmsg("with a SEARCH or CYCLE clause, the recursive reference to WITH query \"%s\" must be at the top level of its right-hand SELECT",

cte->ctename)));

newsubquery=copyObject(rte2->subquery);

IncrementVarSublevelsUp((Node*)newsubquery,1,1);

) search depth first by f, t set seq

select * from search_graph order by seq;

ERROR: with a SEARCH or CYCLE clause, the right side of the UNION must be a SELECT

-- check that we distinguish same CTE name used at different levels

-- (this case could be supported, perhaps, but it isn't today)

with recursive x(col) as (

select 1

union

(with x as (select * from x)

select * from x)

) search depth first by col set seq

select * from x;

ERROR: with a SEARCH or CYCLE clause, the recursive reference to WITH query "x" must be at the top level of its right-hand SELECT

-- test ruleutils and view expansion

create temp view v_search as

with recursive search_graph(f, t, label) as (

) search depth first by f, tset seq

select*from search_graphorder by seq;

with recursive x(col)as (

(with xas (select*from x)

select*from x)

) search depth first by colset seq

select*from x;

create temp view v_searchas

with recursive search_graph(f, t, label)as (