Refactor CTE level shifting logic in insert_select_planner.c to improve clarity and functionality

src/backend/distributed/planner/insert_select_planner.c

@@ -108,16 +108,25 @@ static void ProcessEntryPair(TargetEntry *insertEntry, TargetEntry *selectEntry,
 							 Form_pg_attribute attr, int targetEntryIndex,
 							 List **projectedEntries, List **nonProjectedEntries);
 
-typedef struct ShiftAllLevelsContext
+typedef struct ShiftReferencesWalkerContext
 {
-	int baseLevel;  /* we shift ctelevelsup if it’s >= this number */
+	/* current nesting depth, 0 for top-level query, increments each time we go one Query deeper */
-} ShiftAllLevelsContext;
+	int levelsup;
 
+	/* how much to shift ctelevelsup by if it matches levelsup+1 (typically -1) */
+	int offset;
+
+	/* optional: if we want to check ctename is in top-level list */
+	List *topLevelCteList;
+} ShiftReferencesWalkerContext;		 
 
 static bool
-ShiftAllLevelsWalker(Node *node, ShiftAllLevelsContext *ctx);
+inline_cte_walker(Node *node, ShiftReferencesWalkerContext *context);
+
 static void
-ShiftAllCteLevelsInQuery(Query *subquery, int baseLevel);
+DecrementInsertLevelReferences(Query *subquery, 
+							   int offset, /* typically -1 */
+							   List *topLevelCteList);
 
 
 /* depth of current insert/select planner. */
@@ -550,6 +559,8 @@ PrepareInsertSelectForCitusPlanner(Query *insertSelectQuery)
 		 */
 		elog(DEBUG1, "Unifying top-level cteList with subquery cteList");
 
+		List *topLevelCteListCopy = copyObject(insertSelectQuery->cteList);
+
 		selectRte->subquery->cteList =
 			list_concat(selectRte->subquery->cteList,
 						copyObject(insertSelectQuery->cteList));
@@ -558,73 +569,128 @@ PrepareInsertSelectForCitusPlanner(Query *insertSelectQuery)
 		/* Suppose we physically appended the top-level cteList into the subquery, 
    		so references are at ctelevelsup=1, 2, etc. We want them all to shift by -1. */
 
-		   ShiftAllCteLevelsInQuery(selectRte->subquery,
+		DecrementInsertLevelReferences(selectRte->subquery, -1, topLevelCteListCopy /* for ctename check */);
-			1       /* baseLevel => anything >= 1 is shifted */);
 
 		elog(DEBUG1, "Done shifting ctelevelsup X->X-1 for subquery references");
 	}
 }
 
 /*
- * ShiftAllLevelsWalker:
+ * inline_cte_walker
- *   Recursively visits each Query using QTW_EXAMINE_RTES_BEFORE so it
+ *
- *   receives RangeTblEntry nodes. If an RTE_CTE has ctelevelsup >= baseLevel,
+ *   If node is a Query, we increase context->levelsup by 1,
- *   do ctelevelsup -= 1.
+ *   recursively walk the Query, then restore it.
+ *
+ *   If node is a RangeTblEntry with RTE_CTE and ctelevelsup == (levelsup + 1),
+ *   we do ctelevelsup += offset (e.g. -1 => so k+1 → k).
+ *
+ *   We do expression_tree_walker for fallback on expressions.
  */
 static bool
-ShiftAllLevelsWalker(Node *node, ShiftAllLevelsContext *ctx)
+inline_cte_walker(Node *node, ShiftReferencesWalkerContext *context)
 {
 	if (node == NULL)
 		return false;
 
-    if (IsA(node, RangeTblEntry))
+	if (IsA(node, Query))
+	{
+		Query *query = (Query *) node;
+
+		/* descend one query level deeper */
+		context->levelsup++;
+
+		/*
+		 * Use QTW_EXAMINE_RTES_AFTER or QTW_EXAMINE_RTES_BEFORE – your snippet
+		 * used AFTER, so let's keep that. This means we'll handle the rtable
+		 * after the rest, which is okay. 
+		 *
+		 * Or we can do QTW_EXAMINE_RTES_BEFORE so we see RangeTblEntry first.
+		 * The key is being consistent with your scenario.
+		 */
+		query_tree_walker(query,
+						  inline_cte_walker,
+						  context,
+						  QTW_EXAMINE_RTES_AFTER);
+
+		context->levelsup--;
+
+		return false;
+	}
+	else if (IsA(node, RangeTblEntry))
 	{
 		RangeTblEntry *rte = (RangeTblEntry *) node;
 
-        if (rte->rtekind == RTE_CTE &&
+		if (rte->rtekind == RTE_CTE)
-            rte->ctelevelsup >= ctx->baseLevel)
 		{
-            elog(DEBUG2, "Shifting ctelevelsup from %d to %d",
+			/*
-                 rte->ctelevelsup, rte->ctelevelsup - 1);
+			 * If RTE_CTE's ctelevelsup == (current nesting level + 1),
-            rte->ctelevelsup -= 1;
+			 * we do ctelevelsup += offset. 
-        }
+			 * e.g. if offset=-1, and ctelevelsup= (levelsup + 1), 
-
+			 * that effectively does "k+1 → k".
-        return false;
-    }
-    else if (IsA(node, Query))
-    {
-        /* For each Query, we call query_tree_walker with QTW_EXAMINE_RTES_BEFORE */
-        Query *query = (Query *) node;
-
-        query_tree_walker(query,
-                          ShiftAllLevelsWalker,
-                          (void *) ctx,
-                          QTW_EXAMINE_RTES_BEFORE);
-
-        return false;
-    }
-
-    /* fallback for expressions, etc. */
-    return expression_tree_walker(node, ShiftAllLevelsWalker, (void *) ctx);
-}
-
-/*
- * ShiftAllCteLevelsInQuery
- *   A convenience wrapper to shift ctelevelsup by 1 for any references >= baseLevel
 			 */
-static void
+			if (rte->ctelevelsup == (context->levelsup + 1))
-ShiftAllCteLevelsInQuery(Query *subquery, int baseLevel)
+			{
-{
+				/* optionally verify ctename is in topLevelCteList */
-    ShiftAllLevelsContext ctx;
+				bool foundName = false;
-    ctx.baseLevel = baseLevel;
+				if (context->topLevelCteList != NULL)
+				{
+					ListCell *lc = NULL;
+					foreach(lc, context->topLevelCteList)
+					{
+						CommonTableExpr *cte = (CommonTableExpr *) lfirst(lc);
+						if (strcmp(cte->ctename, rte->ctename) == 0)
+						{
+							foundName = true;
+							break;
+						}
+					}
+				}
+				else
+				{
+					foundName = true; /* if we don't need a name check */
+				}
 
-    (void) query_tree_walker(subquery,
+				if (foundName)
-                             ShiftAllLevelsWalker,
+				{
-                             (void *) &ctx,
+					int oldSup = rte->ctelevelsup;
-                             QTW_EXAMINE_RTES_BEFORE);
+					rte->ctelevelsup += context->offset; /* e.g. -1 => (k+1) → k */
+					elog(DEBUG2, "Shifting ctelevelsup for ctename=%s from %d to %d",
+						 rte->ctename, oldSup, rte->ctelevelsup);
+				}
+				else
+				{
+					elog(DEBUG2, "ctename=%s not found in top-level list, skipping shift",
+						 rte->ctename);
+				}
+			}
+		}
+
+		return false;
+	}
+
+	/* fallback for expressions, e.g. scanning function calls, sublinks, etc. */
+	return expression_tree_walker(node, inline_cte_walker, (void *) context);
 }
 
 
+static void
+DecrementInsertLevelReferences(Query *subquery, 
+							   int offset, /* typically -1 */
+							   List *topLevelCteList)
+{
+	ShiftReferencesWalkerContext ctx;
+	ctx.levelsup = 0;  /* so that top-level query => 0, subquery => 1, etc. */
+	ctx.offset = offset;
+	ctx.topLevelCteList = topLevelCteList;
+
+	query_tree_walker(subquery,
+					  inline_cte_walker,
+					  (void *) &ctx,
+					  QTW_EXAMINE_RTES_AFTER /* or BEFORE, but snippet used AFTER */);
+}
+
+
+
 
 
 /*