initsplan.c 10.1 KB
Newer Older
1 2 3 4 5 6 7 8 9
/*-------------------------------------------------------------------------
 *
 * initsplan.c--
 *    Target list, qualification, joininfo initialization routines
 *
 * Copyright (c) 1994, Regents of the University of California
 *
 *
 * IDENTIFICATION
Marc G. Fournier's avatar
Marc G. Fournier committed
10
 *    $Header: /cvsroot/pgsql/src/backend/optimizer/plan/initsplan.c,v 1.2 1996/10/31 10:59:13 scrappy Exp $
11 12 13
 *
 *-------------------------------------------------------------------------
 */
Marc G. Fournier's avatar
Marc G. Fournier committed
14 15
#include <sys/types.h>

16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393
#include "postgres.h"

#include "nodes/pg_list.h"
#include "nodes/plannodes.h"
#include "nodes/parsenodes.h"
#include "nodes/relation.h"
#include "nodes/makefuncs.h"

#include "utils/lsyscache.h"
#include "utils/palloc.h"

#include "optimizer/internal.h"
#include "optimizer/planmain.h"
#include "optimizer/joininfo.h"
#include "optimizer/pathnode.h"
#include "optimizer/tlist.h"
#include "optimizer/var.h"
#include "optimizer/clauses.h"
#include "optimizer/cost.h"

extern int Quiet;

static void add_clause_to_rels(Query *root, List *clause);
static void add_join_clause_info_to_rels(Query *root, CInfo *clauseinfo,
					 List *join_relids);
static void add_vars_to_rels(Query *root, List *vars, List *join_relids);

static MergeOrder *mergesortop(Expr *clause);
static Oid hashjoinop(Expr *clause);


/*****************************************************************************
 *
 *   TARGET LISTS
 *
 *****************************************************************************/

/*    
 * initialize_rel_nodes--
 *    Creates rel nodes for every relation mentioned in the target list
 *    'tlist' (if a node hasn't already been created) and adds them to
 *    *query-relation-list*.  Creates targetlist entries for each member of
 *    'tlist' and adds them to the tlist field of the appropriate rel node.
 *    
 *    Returns nothing.
 */
void
initialize_base_rels_list(Query *root, List *tlist)
{
    List *tlist_vars = NIL;
    List *l = NIL;
    List *tvar = NIL;
    
    foreach (l, tlist) {
	TargetEntry *entry = (TargetEntry *) lfirst(l);

        tlist_vars = append(tlist_vars, pull_var_clause(entry->expr)); 
    }

    /* now, the target list only contains Var nodes */
    foreach (tvar, tlist_vars) {
	Var 	*var;
	Index   varno;
	Rel	*result;
	
	var = (Var*)lfirst(tvar);
	varno = var->varno;
	result = get_base_rel(root, varno);

	add_tl_element(result, var);
    }
}

/*
 * add_missing_variables_to_base_rels -
 *    If we have range variable(s) in the FROM clause that does not appear
 *    in the target list nor qualifications, we add it to the base relation
 *    list. For instance, "select f.x from foo f, foo f2" is a join of f and
 *    f2. Note that if we have "select foo.x from foo f", it also gets turned
 *    into a join.
 */
void
add_missing_vars_to_base_rels(Query *root, List *tlist)
{
    List *l;
    int varno;
    
    varno = 1;
    foreach (l, root->rtable) {
	RangeTblEntry *rte = (RangeTblEntry *)lfirst(l);
	List *relids;
	Rel *result;
	Var *var;

	relids = lconsi(varno, NIL);
	if (rte->inFromCl &&
	    !rel_member(relids, root->base_relation_list_)) {

	    var = makeVar(varno, -2 , 26, varno, -2);
	    /* add it to base_relation_list_ */
	    result = get_base_rel(root, varno);
	    add_tl_element(result, var);
	}
	pfree(relids);
	varno++;
    }

    return;
}

/*****************************************************************************
 *
 *    QUALIFICATIONS
 *
 *****************************************************************************/



/*    
 * initialize-qualification--
 *    Initializes ClauseInfo and JoinInfo fields of relation entries for all
 *    relations appearing within clauses.  Creates new relation entries if
 *    necessary, adding them to *query-relation-list*.
 *    
 *    Returns nothing of interest.
 */
void
initialize_base_rels_jinfo(Query *root, List *clauses)
{
    List *clause;

    foreach (clause, clauses) {
	add_clause_to_rels(root, lfirst(clause));
    }
    return;
}

/*    
 * add-clause-to-rels--
 *    Add clause information to either the 'ClauseInfo' or 'JoinInfo' field
 *    of a relation entry(depending on whether or not the clause is a join)
 *    by creating a new ClauseInfo node and setting appropriate fields
 *    within the nodes.
 *    
 *    Returns nothing of interest.
 */
static void
add_clause_to_rels(Query *root, List *clause)
{
    List *relids;
    List *vars;
    CInfo *clauseinfo = makeNode(CInfo);

    /*
     * Retrieve all relids and vars contained within the clause.
     */
    clause_relids_vars((Node*)clause, &relids, &vars);


    clauseinfo->clause = (Expr*)clause;
    clauseinfo->notclause = contains_not((Node*)clause);
    clauseinfo->selectivity = 0;
    clauseinfo->indexids = NIL;
    clauseinfo->mergesortorder = (MergeOrder*)NULL;
    clauseinfo->hashjoinoperator = (Oid)0;
	


    if(length(relids) == 1) {
	Rel *rel = get_base_rel(root, lfirsti(relids));
	
	/*
	 * There is only one relation participating in 'clause',
	 * so 'clause' must be a restriction clause.
	 */

	/* the selectivity of the clause must be computed
	   regardless of whether it's a restriction or a join clause */
	if (is_funcclause((Node*)clause))
	    {
		/*
		 * XXX If we have a func clause set selectivity to 1/3, 
		 *     really need a true selectivity function.
		 */
		clauseinfo->selectivity = (Cost)0.3333333;
	    }
	else
	    {
		clauseinfo->selectivity =
		    compute_clause_selec(root, (Node*)clause,
					 NIL);
	    }
	rel->clauseinfo = lcons(clauseinfo,
			       rel->clauseinfo);
    } else {
	/*
	 * 'clause' is a join clause, since there is more than one
	 * atom in the relid list.
	 */
	
	if (is_funcclause((Node*)clause))
	    {
		/*
		 * XXX If we have a func clause set selectivity to 1/3, 
		 *     really need a true selectivity function.
		 */
		clauseinfo->selectivity = (Cost)0.3333333;
	    }
	else
	    {
		clauseinfo->selectivity =
		    compute_clause_selec(root, (Node*)clause,
					 NIL);
	    }
	add_join_clause_info_to_rels(root, clauseinfo, relids);
	add_vars_to_rels(root,vars, relids);
    }
}

/*    
 * add-join-clause-info-to-rels--
 *    For every relation participating in a join clause, add 'clauseinfo' to
 *    the appropriate joininfo node(creating a new one and adding it to the
 *    appropriate rel node if necessary).
 *    
 * 'clauseinfo' describes the join clause
 * 'join-relids' is the list of relations participating in the join clause
 *    
 * Returns nothing.
 *    
 */
static void
add_join_clause_info_to_rels(Query *root, CInfo *clauseinfo, List *join_relids)
{
    List *join_relid;

    foreach (join_relid, join_relids) {
	JInfo *joininfo = 
	    find_joininfo_node(get_base_rel(root, lfirsti(join_relid)),
			       intLispRemove((int)lfirst(join_relid),
					     join_relids));
	joininfo->jinfoclauseinfo =
	    lcons(clauseinfo, joininfo->jinfoclauseinfo);	

    }
}

/*    
 * add-vars-to-rels--
 *    For each variable appearing in a clause,
 *    (1) If a targetlist entry for the variable is not already present in
 *        the appropriate relation's target list, add one.
 *    (2) If a targetlist entry is already present, but the var is part of a
 *        join clause, add the relids of the join relations to the JoinList
 *        entry of the targetlist entry.
 *    
 *    'vars' is the list of var nodes
 *    'join-relids' is the list of relids appearing in the join clause
 *    	(if this is a join clause)
 *    
 *    Returns nothing.
 */
static void
add_vars_to_rels(Query *root, List *vars, List *join_relids)
{
    Var *var;
    List *temp = NIL;
    Rel *rel = (Rel*)NULL;
    TargetEntry *tlistentry;
    
    foreach (temp, vars) {
	var = (Var*)lfirst(temp);
	rel = get_base_rel(root, var->varno);
	tlistentry = tlistentry_member(var, rel->targetlist);
	if(tlistentry==NULL)
	    /*   add a new entry */
	    add_tl_element(rel, var);
    }
}

/*****************************************************************************
 *
 *   JOININFO
 *
 *****************************************************************************/

/*    
 * initialize-join-clause-info--
 *    Set the MergeSortable or HashJoinable field for every joininfo node
 *    (within a rel node) and the MergeSortOrder or HashJoinOp field for
 *    each clauseinfo node(within a joininfo node) for all relations in a
 *    query.
 *    
 *    Returns nothing.
 */
void
initialize_join_clause_info(List *rel_list)
{
    List *x, *y, *z;
    Rel *rel;
    JInfo *joininfo;
    CInfo *clauseinfo;
    Expr *clause;

    foreach (x, rel_list) {
	rel = (Rel*)lfirst(x);
	foreach (y, rel->joininfo) {
	    joininfo = (JInfo*)lfirst(y);
	    foreach (z, joininfo->jinfoclauseinfo) {
		clauseinfo = (CInfo*)lfirst(z);
		clause = clauseinfo->clause;
		if(join_clause_p((Node*)clause)) {
		    MergeOrder *sortop = (MergeOrder*)NULL;
		    Oid hashop = (Oid)NULL;

		    if (_enable_mergesort_) 
			sortop = mergesortop(clause);
		    if (_enable_hashjoin_) 
			hashop = hashjoinop(clause);

		    if (sortop) {
			clauseinfo->mergesortorder = sortop;
			joininfo->mergesortable = true;
		    }
		    if (hashop) {
			clauseinfo->hashjoinoperator = hashop;
			joininfo->hashjoinable = true;
		    }
		}
	    }
	}
    }
}

/*    
 * mergesortop--
 *    Returns the mergesort operator of an operator iff 'clause' is
 *    mergesortable, i.e., both operands are single vars and the operator is
 *    a mergesortable operator.
 */
static MergeOrder *
mergesortop(Expr *clause)
{
    Oid leftOp, rightOp;
    bool sortable;

    sortable = op_mergesortable(((Oper*)clause->oper)->opno,
				(get_leftop(clause))->vartype,
				(get_rightop(clause))->vartype,
				&leftOp,
				&rightOp);
    
    if (sortable) {
	MergeOrder *morder = makeNode(MergeOrder);

	morder->join_operator = ((Oper*)clause->oper)->opno;
	morder->left_operator = leftOp;
	morder->right_operator = rightOp;
	morder->left_type = (get_leftop(clause))->vartype;
	morder->right_type = (get_rightop(clause))->vartype;
	return (morder);
    } else 
	return(NULL);
}

/*    
 * hashjoinop--
 *    Returns the hashjoin operator of an operator iff 'clause' is
 *    hashjoinable, i.e., both operands are single vars and the operator is
 *    a hashjoinable operator.
 */
static Oid
hashjoinop(Expr *clause)
{
    return(op_hashjoinable(((Oper*)clause->oper)->opno,
			   (get_leftop(clause))->vartype,
			   (get_rightop(clause))->vartype));
}