3348 lines
88 KiB
C
3348 lines
88 KiB
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* namespace.c
|
|
* code to support accessing and searching namespaces
|
|
*
|
|
* This is separate from pg_namespace.c, which contains the routines that
|
|
* directly manipulate the pg_namespace system catalog. This module
|
|
* provides routines associated with defining a "namespace search path"
|
|
* and implementing search-path-controlled searches.
|
|
*
|
|
*
|
|
* Portions Copyright (c) 1996-2008, PostgreSQL Global Development Group
|
|
* Portions Copyright (c) 1994, Regents of the University of California
|
|
*
|
|
* IDENTIFICATION
|
|
* $PostgreSQL: pgsql/src/backend/catalog/namespace.c,v 1.113 2008/12/04 17:51:26 petere Exp $
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
#include "postgres.h"
|
|
|
|
#include "access/xact.h"
|
|
#include "catalog/dependency.h"
|
|
#include "catalog/namespace.h"
|
|
#include "catalog/pg_authid.h"
|
|
#include "catalog/pg_conversion.h"
|
|
#include "catalog/pg_conversion_fn.h"
|
|
#include "catalog/pg_namespace.h"
|
|
#include "catalog/pg_opclass.h"
|
|
#include "catalog/pg_operator.h"
|
|
#include "catalog/pg_opfamily.h"
|
|
#include "catalog/pg_proc.h"
|
|
#include "catalog/pg_ts_config.h"
|
|
#include "catalog/pg_ts_dict.h"
|
|
#include "catalog/pg_ts_parser.h"
|
|
#include "catalog/pg_ts_template.h"
|
|
#include "catalog/pg_type.h"
|
|
#include "commands/dbcommands.h"
|
|
#include "miscadmin.h"
|
|
#include "nodes/makefuncs.h"
|
|
#include "parser/parse_func.h"
|
|
#include "storage/backendid.h"
|
|
#include "storage/ipc.h"
|
|
#include "utils/acl.h"
|
|
#include "utils/builtins.h"
|
|
#include "utils/guc.h"
|
|
#include "utils/inval.h"
|
|
#include "utils/lsyscache.h"
|
|
#include "utils/memutils.h"
|
|
#include "utils/rel.h"
|
|
#include "utils/syscache.h"
|
|
|
|
|
|
/*
|
|
* The namespace search path is a possibly-empty list of namespace OIDs.
|
|
* In addition to the explicit list, implicitly-searched namespaces
|
|
* may be included:
|
|
*
|
|
* 1. If a TEMP table namespace has been initialized in this session, it
|
|
* is implicitly searched first. (The only time this doesn't happen is
|
|
* when we are obeying an override search path spec that says not to use the
|
|
* temp namespace, or the temp namespace is included in the explicit list.)
|
|
*
|
|
* 2. The system catalog namespace is always searched. If the system
|
|
* namespace is present in the explicit path then it will be searched in
|
|
* the specified order; otherwise it will be searched after TEMP tables and
|
|
* *before* the explicit list. (It might seem that the system namespace
|
|
* should be implicitly last, but this behavior appears to be required by
|
|
* SQL99. Also, this provides a way to search the system namespace first
|
|
* without thereby making it the default creation target namespace.)
|
|
*
|
|
* For security reasons, searches using the search path will ignore the temp
|
|
* namespace when searching for any object type other than relations and
|
|
* types. (We must allow types since temp tables have rowtypes.)
|
|
*
|
|
* The default creation target namespace is always the first element of the
|
|
* explicit list. If the explicit list is empty, there is no default target.
|
|
*
|
|
* The textual specification of search_path can include "$user" to refer to
|
|
* the namespace named the same as the current user, if any. (This is just
|
|
* ignored if there is no such namespace.) Also, it can include "pg_temp"
|
|
* to refer to the current backend's temp namespace. This is usually also
|
|
* ignorable if the temp namespace hasn't been set up, but there's a special
|
|
* case: if "pg_temp" appears first then it should be the default creation
|
|
* target. We kluge this case a little bit so that the temp namespace isn't
|
|
* set up until the first attempt to create something in it. (The reason for
|
|
* klugery is that we can't create the temp namespace outside a transaction,
|
|
* but initial GUC processing of search_path happens outside a transaction.)
|
|
* activeTempCreationPending is TRUE if "pg_temp" appears first in the string
|
|
* but is not reflected in activeCreationNamespace because the namespace isn't
|
|
* set up yet.
|
|
*
|
|
* In bootstrap mode, the search path is set equal to "pg_catalog", so that
|
|
* the system namespace is the only one searched or inserted into.
|
|
* initdb is also careful to set search_path to "pg_catalog" for its
|
|
* post-bootstrap standalone backend runs. Otherwise the default search
|
|
* path is determined by GUC. The factory default path contains the PUBLIC
|
|
* namespace (if it exists), preceded by the user's personal namespace
|
|
* (if one exists).
|
|
*
|
|
* We support a stack of "override" search path settings for use within
|
|
* specific sections of backend code. namespace_search_path is ignored
|
|
* whenever the override stack is nonempty. activeSearchPath is always
|
|
* the actually active path; it points either to the search list of the
|
|
* topmost stack entry, or to baseSearchPath which is the list derived
|
|
* from namespace_search_path.
|
|
*
|
|
* If baseSearchPathValid is false, then baseSearchPath (and other
|
|
* derived variables) need to be recomputed from namespace_search_path.
|
|
* We mark it invalid upon an assignment to namespace_search_path or receipt
|
|
* of a syscache invalidation event for pg_namespace. The recomputation
|
|
* is done during the next non-overridden lookup attempt. Note that an
|
|
* override spec is never subject to recomputation.
|
|
*
|
|
* Any namespaces mentioned in namespace_search_path that are not readable
|
|
* by the current user ID are simply left out of baseSearchPath; so
|
|
* we have to be willing to recompute the path when current userid changes.
|
|
* namespaceUser is the userid the path has been computed for.
|
|
*
|
|
* Note: all data pointed to by these List variables is in TopMemoryContext.
|
|
*/
|
|
|
|
/* These variables define the actually active state: */
|
|
|
|
static List *activeSearchPath = NIL;
|
|
|
|
/* default place to create stuff; if InvalidOid, no default */
|
|
static Oid activeCreationNamespace = InvalidOid;
|
|
|
|
/* if TRUE, activeCreationNamespace is wrong, it should be temp namespace */
|
|
static bool activeTempCreationPending = false;
|
|
|
|
/* These variables are the values last derived from namespace_search_path: */
|
|
|
|
static List *baseSearchPath = NIL;
|
|
|
|
static Oid baseCreationNamespace = InvalidOid;
|
|
|
|
static bool baseTempCreationPending = false;
|
|
|
|
static Oid namespaceUser = InvalidOid;
|
|
|
|
/* The above four values are valid only if baseSearchPathValid */
|
|
static bool baseSearchPathValid = true;
|
|
|
|
/* Override requests are remembered in a stack of OverrideStackEntry structs */
|
|
|
|
typedef struct
|
|
{
|
|
List *searchPath; /* the desired search path */
|
|
Oid creationNamespace; /* the desired creation namespace */
|
|
int nestLevel; /* subtransaction nesting level */
|
|
} OverrideStackEntry;
|
|
|
|
static List *overrideStack = NIL;
|
|
|
|
/*
|
|
* myTempNamespace is InvalidOid until and unless a TEMP namespace is set up
|
|
* in a particular backend session (this happens when a CREATE TEMP TABLE
|
|
* command is first executed). Thereafter it's the OID of the temp namespace.
|
|
*
|
|
* myTempToastNamespace is the OID of the namespace for my temp tables' toast
|
|
* tables. It is set when myTempNamespace is, and is InvalidOid before that.
|
|
*
|
|
* myTempNamespaceSubID shows whether we've created the TEMP namespace in the
|
|
* current subtransaction. The flag propagates up the subtransaction tree,
|
|
* so the main transaction will correctly recognize the flag if all
|
|
* intermediate subtransactions commit. When it is InvalidSubTransactionId,
|
|
* we either haven't made the TEMP namespace yet, or have successfully
|
|
* committed its creation, depending on whether myTempNamespace is valid.
|
|
*/
|
|
static Oid myTempNamespace = InvalidOid;
|
|
|
|
static Oid myTempToastNamespace = InvalidOid;
|
|
|
|
static SubTransactionId myTempNamespaceSubID = InvalidSubTransactionId;
|
|
|
|
/*
|
|
* This is the user's textual search path specification --- it's the value
|
|
* of the GUC variable 'search_path'.
|
|
*/
|
|
char *namespace_search_path = NULL;
|
|
|
|
|
|
/* Local functions */
|
|
static void recomputeNamespacePath(void);
|
|
static void InitTempTableNamespace(void);
|
|
static void RemoveTempRelations(Oid tempNamespaceId);
|
|
static void RemoveTempRelationsCallback(int code, Datum arg);
|
|
static void NamespaceCallback(Datum arg, int cacheid, ItemPointer tuplePtr);
|
|
|
|
/* These don't really need to appear in any header file */
|
|
Datum pg_table_is_visible(PG_FUNCTION_ARGS);
|
|
Datum pg_type_is_visible(PG_FUNCTION_ARGS);
|
|
Datum pg_function_is_visible(PG_FUNCTION_ARGS);
|
|
Datum pg_operator_is_visible(PG_FUNCTION_ARGS);
|
|
Datum pg_opclass_is_visible(PG_FUNCTION_ARGS);
|
|
Datum pg_conversion_is_visible(PG_FUNCTION_ARGS);
|
|
Datum pg_ts_parser_is_visible(PG_FUNCTION_ARGS);
|
|
Datum pg_ts_dict_is_visible(PG_FUNCTION_ARGS);
|
|
Datum pg_ts_template_is_visible(PG_FUNCTION_ARGS);
|
|
Datum pg_ts_config_is_visible(PG_FUNCTION_ARGS);
|
|
Datum pg_my_temp_schema(PG_FUNCTION_ARGS);
|
|
Datum pg_is_other_temp_schema(PG_FUNCTION_ARGS);
|
|
|
|
|
|
/*
|
|
* RangeVarGetRelid
|
|
* Given a RangeVar describing an existing relation,
|
|
* select the proper namespace and look up the relation OID.
|
|
*
|
|
* If the relation is not found, return InvalidOid if failOK = true,
|
|
* otherwise raise an error.
|
|
*/
|
|
Oid
|
|
RangeVarGetRelid(const RangeVar *relation, bool failOK)
|
|
{
|
|
Oid namespaceId;
|
|
Oid relId;
|
|
|
|
/*
|
|
* We check the catalog name and then ignore it.
|
|
*/
|
|
if (relation->catalogname)
|
|
{
|
|
if (strcmp(relation->catalogname, get_database_name(MyDatabaseId)) != 0)
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
|
|
errmsg("cross-database references are not implemented: \"%s.%s.%s\"",
|
|
relation->catalogname, relation->schemaname,
|
|
relation->relname)));
|
|
}
|
|
|
|
/*
|
|
* If istemp is set, this is a reference to a temp relation. The parser
|
|
* never generates such a RangeVar in simple DML, but it can happen in
|
|
* contexts such as "CREATE TEMP TABLE foo (f1 int PRIMARY KEY)". Such a
|
|
* command will generate an added CREATE INDEX operation, which must be
|
|
* careful to find the temp table, even when pg_temp is not first in the
|
|
* search path.
|
|
*/
|
|
if (relation->istemp)
|
|
{
|
|
if (relation->schemaname)
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_INVALID_TABLE_DEFINITION),
|
|
errmsg("temporary tables cannot specify a schema name")));
|
|
if (OidIsValid(myTempNamespace))
|
|
relId = get_relname_relid(relation->relname, myTempNamespace);
|
|
else /* this probably can't happen? */
|
|
relId = InvalidOid;
|
|
}
|
|
else if (relation->schemaname)
|
|
{
|
|
/* use exact schema given */
|
|
namespaceId = LookupExplicitNamespace(relation->schemaname);
|
|
relId = get_relname_relid(relation->relname, namespaceId);
|
|
}
|
|
else
|
|
{
|
|
/* search the namespace path */
|
|
relId = RelnameGetRelid(relation->relname);
|
|
}
|
|
|
|
if (!OidIsValid(relId) && !failOK)
|
|
{
|
|
if (relation->schemaname)
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_UNDEFINED_TABLE),
|
|
errmsg("relation \"%s.%s\" does not exist",
|
|
relation->schemaname, relation->relname)));
|
|
else
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_UNDEFINED_TABLE),
|
|
errmsg("relation \"%s\" does not exist",
|
|
relation->relname)));
|
|
}
|
|
return relId;
|
|
}
|
|
|
|
/*
|
|
* RangeVarGetCreationNamespace
|
|
* Given a RangeVar describing a to-be-created relation,
|
|
* choose which namespace to create it in.
|
|
*
|
|
* Note: calling this may result in a CommandCounterIncrement operation.
|
|
* That will happen on the first request for a temp table in any particular
|
|
* backend run; we will need to either create or clean out the temp schema.
|
|
*/
|
|
Oid
|
|
RangeVarGetCreationNamespace(const RangeVar *newRelation)
|
|
{
|
|
Oid namespaceId;
|
|
|
|
/*
|
|
* We check the catalog name and then ignore it.
|
|
*/
|
|
if (newRelation->catalogname)
|
|
{
|
|
if (strcmp(newRelation->catalogname, get_database_name(MyDatabaseId)) != 0)
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
|
|
errmsg("cross-database references are not implemented: \"%s.%s.%s\"",
|
|
newRelation->catalogname, newRelation->schemaname,
|
|
newRelation->relname)));
|
|
}
|
|
|
|
if (newRelation->istemp)
|
|
{
|
|
/* TEMP tables are created in our backend-local temp namespace */
|
|
if (newRelation->schemaname)
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_INVALID_TABLE_DEFINITION),
|
|
errmsg("temporary tables cannot specify a schema name")));
|
|
/* Initialize temp namespace if first time through */
|
|
if (!OidIsValid(myTempNamespace))
|
|
InitTempTableNamespace();
|
|
return myTempNamespace;
|
|
}
|
|
|
|
if (newRelation->schemaname)
|
|
{
|
|
/* check for pg_temp alias */
|
|
if (strcmp(newRelation->schemaname, "pg_temp") == 0)
|
|
{
|
|
/* Initialize temp namespace if first time through */
|
|
if (!OidIsValid(myTempNamespace))
|
|
InitTempTableNamespace();
|
|
return myTempNamespace;
|
|
}
|
|
/* use exact schema given */
|
|
namespaceId = GetSysCacheOid(NAMESPACENAME,
|
|
CStringGetDatum(newRelation->schemaname),
|
|
0, 0, 0);
|
|
if (!OidIsValid(namespaceId))
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_UNDEFINED_SCHEMA),
|
|
errmsg("schema \"%s\" does not exist",
|
|
newRelation->schemaname)));
|
|
/* we do not check for USAGE rights here! */
|
|
}
|
|
else
|
|
{
|
|
/* use the default creation namespace */
|
|
recomputeNamespacePath();
|
|
if (activeTempCreationPending)
|
|
{
|
|
/* Need to initialize temp namespace */
|
|
InitTempTableNamespace();
|
|
return myTempNamespace;
|
|
}
|
|
namespaceId = activeCreationNamespace;
|
|
if (!OidIsValid(namespaceId))
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_UNDEFINED_SCHEMA),
|
|
errmsg("no schema has been selected to create in")));
|
|
}
|
|
|
|
/* Note: callers will check for CREATE rights when appropriate */
|
|
|
|
return namespaceId;
|
|
}
|
|
|
|
/*
|
|
* RelnameGetRelid
|
|
* Try to resolve an unqualified relation name.
|
|
* Returns OID if relation found in search path, else InvalidOid.
|
|
*/
|
|
Oid
|
|
RelnameGetRelid(const char *relname)
|
|
{
|
|
Oid relid;
|
|
ListCell *l;
|
|
|
|
recomputeNamespacePath();
|
|
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
|
|
relid = get_relname_relid(relname, namespaceId);
|
|
if (OidIsValid(relid))
|
|
return relid;
|
|
}
|
|
|
|
/* Not found in path */
|
|
return InvalidOid;
|
|
}
|
|
|
|
|
|
/*
|
|
* RelationIsVisible
|
|
* Determine whether a relation (identified by OID) is visible in the
|
|
* current search path. Visible means "would be found by searching
|
|
* for the unqualified relation name".
|
|
*/
|
|
bool
|
|
RelationIsVisible(Oid relid)
|
|
{
|
|
HeapTuple reltup;
|
|
Form_pg_class relform;
|
|
Oid relnamespace;
|
|
bool visible;
|
|
|
|
reltup = SearchSysCache(RELOID,
|
|
ObjectIdGetDatum(relid),
|
|
0, 0, 0);
|
|
if (!HeapTupleIsValid(reltup))
|
|
elog(ERROR, "cache lookup failed for relation %u", relid);
|
|
relform = (Form_pg_class) GETSTRUCT(reltup);
|
|
|
|
recomputeNamespacePath();
|
|
|
|
/*
|
|
* Quick check: if it ain't in the path at all, it ain't visible. Items in
|
|
* the system namespace are surely in the path and so we needn't even do
|
|
* list_member_oid() for them.
|
|
*/
|
|
relnamespace = relform->relnamespace;
|
|
if (relnamespace != PG_CATALOG_NAMESPACE &&
|
|
!list_member_oid(activeSearchPath, relnamespace))
|
|
visible = false;
|
|
else
|
|
{
|
|
/*
|
|
* If it is in the path, it might still not be visible; it could be
|
|
* hidden by another relation of the same name earlier in the path. So
|
|
* we must do a slow check for conflicting relations.
|
|
*/
|
|
char *relname = NameStr(relform->relname);
|
|
ListCell *l;
|
|
|
|
visible = false;
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == relnamespace)
|
|
{
|
|
/* Found it first in path */
|
|
visible = true;
|
|
break;
|
|
}
|
|
if (OidIsValid(get_relname_relid(relname, namespaceId)))
|
|
{
|
|
/* Found something else first in path */
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
ReleaseSysCache(reltup);
|
|
|
|
return visible;
|
|
}
|
|
|
|
|
|
/*
|
|
* TypenameGetTypid
|
|
* Try to resolve an unqualified datatype name.
|
|
* Returns OID if type found in search path, else InvalidOid.
|
|
*
|
|
* This is essentially the same as RelnameGetRelid.
|
|
*/
|
|
Oid
|
|
TypenameGetTypid(const char *typname)
|
|
{
|
|
Oid typid;
|
|
ListCell *l;
|
|
|
|
recomputeNamespacePath();
|
|
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
|
|
typid = GetSysCacheOid(TYPENAMENSP,
|
|
PointerGetDatum(typname),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0);
|
|
if (OidIsValid(typid))
|
|
return typid;
|
|
}
|
|
|
|
/* Not found in path */
|
|
return InvalidOid;
|
|
}
|
|
|
|
/*
|
|
* TypeIsVisible
|
|
* Determine whether a type (identified by OID) is visible in the
|
|
* current search path. Visible means "would be found by searching
|
|
* for the unqualified type name".
|
|
*/
|
|
bool
|
|
TypeIsVisible(Oid typid)
|
|
{
|
|
HeapTuple typtup;
|
|
Form_pg_type typform;
|
|
Oid typnamespace;
|
|
bool visible;
|
|
|
|
typtup = SearchSysCache(TYPEOID,
|
|
ObjectIdGetDatum(typid),
|
|
0, 0, 0);
|
|
if (!HeapTupleIsValid(typtup))
|
|
elog(ERROR, "cache lookup failed for type %u", typid);
|
|
typform = (Form_pg_type) GETSTRUCT(typtup);
|
|
|
|
recomputeNamespacePath();
|
|
|
|
/*
|
|
* Quick check: if it ain't in the path at all, it ain't visible. Items in
|
|
* the system namespace are surely in the path and so we needn't even do
|
|
* list_member_oid() for them.
|
|
*/
|
|
typnamespace = typform->typnamespace;
|
|
if (typnamespace != PG_CATALOG_NAMESPACE &&
|
|
!list_member_oid(activeSearchPath, typnamespace))
|
|
visible = false;
|
|
else
|
|
{
|
|
/*
|
|
* If it is in the path, it might still not be visible; it could be
|
|
* hidden by another type of the same name earlier in the path. So we
|
|
* must do a slow check for conflicting types.
|
|
*/
|
|
char *typname = NameStr(typform->typname);
|
|
ListCell *l;
|
|
|
|
visible = false;
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == typnamespace)
|
|
{
|
|
/* Found it first in path */
|
|
visible = true;
|
|
break;
|
|
}
|
|
if (SearchSysCacheExists(TYPENAMENSP,
|
|
PointerGetDatum(typname),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0))
|
|
{
|
|
/* Found something else first in path */
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
ReleaseSysCache(typtup);
|
|
|
|
return visible;
|
|
}
|
|
|
|
|
|
/*
|
|
* FuncnameGetCandidates
|
|
* Given a possibly-qualified function name and argument count,
|
|
* retrieve a list of the possible matches.
|
|
*
|
|
* If nargs is -1, we return all functions matching the given name,
|
|
* regardless of argument count. (expand_variadic must be false in this case.)
|
|
*
|
|
* If expand_variadic is true, then variadic functions having the same number
|
|
* or fewer arguments will be retrieved, with the variadic argument and any
|
|
* additional argument positions filled with the variadic element type.
|
|
* nvargs in the returned struct is set to the number of such arguments.
|
|
* If expand_variadic is false, variadic arguments are not treated specially,
|
|
* and the returned nvargs will always be zero.
|
|
*
|
|
* If expand_variadic is true, functions with argument default values
|
|
* will also be retrieved. If expand_variadic is false, default
|
|
* values will not be taken into account and functions that do not
|
|
* have exactly nargs arguments in total will not be considered.
|
|
*
|
|
* We search a single namespace if the function name is qualified, else
|
|
* all namespaces in the search path. The return list will never contain
|
|
* multiple entries with identical argument lists --- in the multiple-
|
|
* namespace case, we arrange for entries in earlier namespaces to mask
|
|
* identical entries in later namespaces. We also arrange for non-variadic
|
|
* functions to mask variadic ones if the expanded argument list is the same.
|
|
*/
|
|
FuncCandidateList
|
|
FuncnameGetCandidates(List *names, int nargs, bool expand_variadic)
|
|
{
|
|
FuncCandidateList resultList = NULL;
|
|
bool any_variadic = false;
|
|
char *schemaname;
|
|
char *funcname;
|
|
Oid namespaceId;
|
|
CatCList *catlist;
|
|
int i;
|
|
|
|
/* check for caller error */
|
|
Assert(nargs >= 0 || !expand_variadic);
|
|
|
|
/* deconstruct the name list */
|
|
DeconstructQualifiedName(names, &schemaname, &funcname);
|
|
|
|
if (schemaname)
|
|
{
|
|
/* use exact schema given */
|
|
namespaceId = LookupExplicitNamespace(schemaname);
|
|
}
|
|
else
|
|
{
|
|
/* flag to indicate we need namespace search */
|
|
namespaceId = InvalidOid;
|
|
recomputeNamespacePath();
|
|
}
|
|
|
|
/* Search syscache by name only */
|
|
catlist = SearchSysCacheList(PROCNAMEARGSNSP, 1,
|
|
CStringGetDatum(funcname),
|
|
0, 0, 0);
|
|
|
|
for (i = 0; i < catlist->n_members; i++)
|
|
{
|
|
HeapTuple proctup = &catlist->members[i]->tuple;
|
|
Form_pg_proc procform = (Form_pg_proc) GETSTRUCT(proctup);
|
|
int pronargs = procform->pronargs;
|
|
int effective_nargs;
|
|
int pathpos = 0;
|
|
bool variadic;
|
|
Oid va_elem_type;
|
|
List *defaults = NIL;
|
|
FuncCandidateList newResult;
|
|
|
|
/*
|
|
* Check if function has some parameter defaults if some
|
|
* parameters are missing.
|
|
*/
|
|
if (pronargs > nargs && expand_variadic)
|
|
{
|
|
bool isnull;
|
|
Datum proargdefaults;
|
|
char *str;
|
|
|
|
/* skip when not enough default expressions */
|
|
if (nargs + procform->pronargdefaults < pronargs)
|
|
continue;
|
|
|
|
proargdefaults = SysCacheGetAttr(PROCOID, proctup,
|
|
Anum_pg_proc_proargdefaults, &isnull);
|
|
Assert(!isnull);
|
|
str = TextDatumGetCString(proargdefaults);
|
|
defaults = (List *) stringToNode(str);
|
|
|
|
Assert(IsA(defaults, List));
|
|
|
|
/*
|
|
* If we don't have to use all default parameters, we skip
|
|
* some cells from the left.
|
|
*/
|
|
defaults = list_copy_tail(defaults, procform->pronargdefaults - pronargs + nargs);
|
|
|
|
pfree(str);
|
|
}
|
|
|
|
/*
|
|
* Check if function is variadic, and get variadic element type if so.
|
|
* If expand_variadic is false, we should just ignore variadic-ness.
|
|
*/
|
|
if (pronargs <= nargs && expand_variadic)
|
|
{
|
|
va_elem_type = procform->provariadic;
|
|
variadic = OidIsValid(va_elem_type);
|
|
}
|
|
else
|
|
{
|
|
va_elem_type = InvalidOid;
|
|
variadic = false;
|
|
}
|
|
|
|
Assert(!variadic || !defaults);
|
|
|
|
/* Ignore if it doesn't match requested argument count */
|
|
if (nargs >= 0 &&
|
|
(variadic ? (pronargs > nargs) : (defaults ? (pronargs < nargs) : (pronargs != nargs))))
|
|
continue;
|
|
|
|
Assert(!variadic || (pronargs <= nargs));
|
|
Assert(!defaults || (pronargs > nargs));
|
|
|
|
if (OidIsValid(namespaceId))
|
|
{
|
|
/* Consider only procs in specified namespace */
|
|
if (procform->pronamespace != namespaceId)
|
|
continue;
|
|
}
|
|
else
|
|
{
|
|
/*
|
|
* Consider only procs that are in the search path and are not in
|
|
* the temp namespace.
|
|
*/
|
|
ListCell *nsp;
|
|
|
|
foreach(nsp, activeSearchPath)
|
|
{
|
|
if (procform->pronamespace == lfirst_oid(nsp) &&
|
|
procform->pronamespace != myTempNamespace)
|
|
break;
|
|
pathpos++;
|
|
}
|
|
if (nsp == NULL)
|
|
continue; /* proc is not in search path */
|
|
}
|
|
|
|
/*
|
|
* We must compute the effective argument list so that we can easily
|
|
* compare it to earlier results. We waste a palloc cycle if it gets
|
|
* masked by an earlier result, but really that's a pretty infrequent
|
|
* case so it's not worth worrying about.
|
|
*/
|
|
effective_nargs = Max(pronargs, nargs);
|
|
newResult = (FuncCandidateList)
|
|
palloc(sizeof(struct _FuncCandidateList) - sizeof(Oid)
|
|
+ effective_nargs * sizeof(Oid));
|
|
newResult->pathpos = pathpos;
|
|
newResult->oid = HeapTupleGetOid(proctup);
|
|
newResult->nargs = effective_nargs;
|
|
newResult->argdefaults = defaults;
|
|
memcpy(newResult->args, procform->proargtypes.values,
|
|
pronargs * sizeof(Oid));
|
|
if (variadic)
|
|
{
|
|
int i;
|
|
|
|
newResult->nvargs = effective_nargs - pronargs + 1;
|
|
/* Expand variadic argument into N copies of element type */
|
|
for (i = pronargs - 1; i < effective_nargs; i++)
|
|
newResult->args[i] = va_elem_type;
|
|
}
|
|
else
|
|
newResult->nvargs = 0;
|
|
|
|
any_variadic = variadic || defaults;
|
|
|
|
/*
|
|
* Does it have the same arguments as something we already accepted?
|
|
* If so, decide which one to keep. We can skip this check for the
|
|
* single-namespace case if no variadic match has been made, since
|
|
* then the unique index on pg_proc guarantees all the matches have
|
|
* different argument lists.
|
|
*/
|
|
if (any_variadic || !OidIsValid(namespaceId))
|
|
{
|
|
if (defaults)
|
|
effective_nargs = nargs;
|
|
|
|
/*
|
|
* If we have an ordered list from SearchSysCacheList (the normal
|
|
* case), then any conflicting proc must immediately adjoin this
|
|
* one in the list, so we only need to look at the newest result
|
|
* item. If we have an unordered list, we have to scan the whole
|
|
* result list. Also, if either the current candidate or any
|
|
* previous candidate is a variadic match, we can't assume that
|
|
* conflicts are adjacent.
|
|
*/
|
|
if (resultList)
|
|
{
|
|
FuncCandidateList prevResult;
|
|
|
|
if (catlist->ordered && !any_variadic)
|
|
{
|
|
if (effective_nargs == resultList->nargs &&
|
|
memcmp(newResult->args,
|
|
resultList->args,
|
|
effective_nargs * sizeof(Oid)) == 0)
|
|
prevResult = resultList;
|
|
else
|
|
prevResult = NULL;
|
|
}
|
|
else
|
|
{
|
|
for (prevResult = resultList;
|
|
prevResult;
|
|
prevResult = prevResult->next)
|
|
{
|
|
if (!defaults)
|
|
{
|
|
if (effective_nargs == prevResult->nargs &&
|
|
memcmp(newResult->args,
|
|
prevResult->args,
|
|
effective_nargs * sizeof(Oid)) == 0)
|
|
break;
|
|
}
|
|
else
|
|
{
|
|
if (memcmp(newResult->args,
|
|
prevResult->args,
|
|
effective_nargs * sizeof(Oid)) == 0)
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
if (prevResult)
|
|
{
|
|
/*
|
|
* We have a match with a previous result. Prefer the
|
|
* one that's earlier in the search path.
|
|
*/
|
|
if (pathpos > prevResult->pathpos)
|
|
{
|
|
pfree(newResult);
|
|
continue; /* keep previous result */
|
|
}
|
|
else if (pathpos == prevResult->pathpos)
|
|
{
|
|
/*
|
|
* With variadic functions we could have, for example,
|
|
* both foo(numeric) and foo(variadic numeric[]) in
|
|
* the same namespace; if so we prefer the
|
|
* non-variadic match on efficiency grounds. It's
|
|
* also possible to have conflicting variadic
|
|
* functions, such as foo(numeric, variadic numeric[])
|
|
* and foo(variadic numeric[]). If you're silly
|
|
* enough to do that, we throw an error. (XXX It'd be
|
|
* better to detect such conflicts when the functions
|
|
* are created.)
|
|
*/
|
|
if (variadic)
|
|
{
|
|
if (prevResult->nvargs > 0)
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_AMBIGUOUS_FUNCTION),
|
|
errmsg("variadic function %s conflicts with another",
|
|
func_signature_string(names, pronargs,
|
|
procform->proargtypes.values))));
|
|
/* else, previous result wasn't variadic */
|
|
pfree(newResult);
|
|
continue; /* keep previous result */
|
|
}
|
|
|
|
if (defaults)
|
|
{
|
|
if (prevResult->argdefaults != NIL)
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_AMBIGUOUS_FUNCTION),
|
|
errmsg("functions with parameter defaults %s and %s are ambiguous",
|
|
func_signature_string(names, pronargs, procform->proargtypes.values),
|
|
func_signature_string(names, prevResult->nargs, prevResult->args))));
|
|
/* else, previous result didn't have defaults */
|
|
pfree(newResult);
|
|
continue; /* keep previous result */
|
|
}
|
|
|
|
/* non-variadic can replace a previous variadic */
|
|
Assert(prevResult->nvargs > 0);
|
|
}
|
|
/* replace previous result */
|
|
prevResult->pathpos = pathpos;
|
|
prevResult->oid = newResult->oid;
|
|
prevResult->nvargs = newResult->nvargs;
|
|
prevResult->argdefaults = newResult->argdefaults;
|
|
pfree(newResult);
|
|
continue; /* args are same, of course */
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Okay to add it to result list
|
|
*/
|
|
newResult->next = resultList;
|
|
resultList = newResult;
|
|
}
|
|
|
|
ReleaseSysCacheList(catlist);
|
|
|
|
return resultList;
|
|
}
|
|
|
|
/*
|
|
* FunctionIsVisible
|
|
* Determine whether a function (identified by OID) is visible in the
|
|
* current search path. Visible means "would be found by searching
|
|
* for the unqualified function name with exact argument matches".
|
|
*/
|
|
bool
|
|
FunctionIsVisible(Oid funcid)
|
|
{
|
|
HeapTuple proctup;
|
|
Form_pg_proc procform;
|
|
Oid pronamespace;
|
|
bool visible;
|
|
|
|
proctup = SearchSysCache(PROCOID,
|
|
ObjectIdGetDatum(funcid),
|
|
0, 0, 0);
|
|
if (!HeapTupleIsValid(proctup))
|
|
elog(ERROR, "cache lookup failed for function %u", funcid);
|
|
procform = (Form_pg_proc) GETSTRUCT(proctup);
|
|
|
|
recomputeNamespacePath();
|
|
|
|
/*
|
|
* Quick check: if it ain't in the path at all, it ain't visible. Items in
|
|
* the system namespace are surely in the path and so we needn't even do
|
|
* list_member_oid() for them.
|
|
*/
|
|
pronamespace = procform->pronamespace;
|
|
if (pronamespace != PG_CATALOG_NAMESPACE &&
|
|
!list_member_oid(activeSearchPath, pronamespace))
|
|
visible = false;
|
|
else
|
|
{
|
|
/*
|
|
* If it is in the path, it might still not be visible; it could be
|
|
* hidden by another proc of the same name and arguments earlier in
|
|
* the path. So we must do a slow check to see if this is the same
|
|
* proc that would be found by FuncnameGetCandidates.
|
|
*/
|
|
char *proname = NameStr(procform->proname);
|
|
int nargs = procform->pronargs;
|
|
FuncCandidateList clist;
|
|
|
|
visible = false;
|
|
|
|
clist = FuncnameGetCandidates(list_make1(makeString(proname)),
|
|
nargs, false);
|
|
|
|
for (; clist; clist = clist->next)
|
|
{
|
|
if (memcmp(clist->args, procform->proargtypes.values,
|
|
nargs * sizeof(Oid)) == 0)
|
|
{
|
|
/* Found the expected entry; is it the right proc? */
|
|
visible = (clist->oid == funcid);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
ReleaseSysCache(proctup);
|
|
|
|
return visible;
|
|
}
|
|
|
|
|
|
/*
|
|
* OpernameGetOprid
|
|
* Given a possibly-qualified operator name and exact input datatypes,
|
|
* look up the operator. Returns InvalidOid if not found.
|
|
*
|
|
* Pass oprleft = InvalidOid for a prefix op, oprright = InvalidOid for
|
|
* a postfix op.
|
|
*
|
|
* If the operator name is not schema-qualified, it is sought in the current
|
|
* namespace search path.
|
|
*/
|
|
Oid
|
|
OpernameGetOprid(List *names, Oid oprleft, Oid oprright)
|
|
{
|
|
char *schemaname;
|
|
char *opername;
|
|
CatCList *catlist;
|
|
ListCell *l;
|
|
|
|
/* deconstruct the name list */
|
|
DeconstructQualifiedName(names, &schemaname, &opername);
|
|
|
|
if (schemaname)
|
|
{
|
|
/* search only in exact schema given */
|
|
Oid namespaceId;
|
|
HeapTuple opertup;
|
|
|
|
namespaceId = LookupExplicitNamespace(schemaname);
|
|
opertup = SearchSysCache(OPERNAMENSP,
|
|
CStringGetDatum(opername),
|
|
ObjectIdGetDatum(oprleft),
|
|
ObjectIdGetDatum(oprright),
|
|
ObjectIdGetDatum(namespaceId));
|
|
if (HeapTupleIsValid(opertup))
|
|
{
|
|
Oid result = HeapTupleGetOid(opertup);
|
|
|
|
ReleaseSysCache(opertup);
|
|
return result;
|
|
}
|
|
return InvalidOid;
|
|
}
|
|
|
|
/* Search syscache by name and argument types */
|
|
catlist = SearchSysCacheList(OPERNAMENSP, 3,
|
|
CStringGetDatum(opername),
|
|
ObjectIdGetDatum(oprleft),
|
|
ObjectIdGetDatum(oprright),
|
|
0);
|
|
|
|
if (catlist->n_members == 0)
|
|
{
|
|
/* no hope, fall out early */
|
|
ReleaseSysCacheList(catlist);
|
|
return InvalidOid;
|
|
}
|
|
|
|
/*
|
|
* We have to find the list member that is first in the search path, if
|
|
* there's more than one. This doubly-nested loop looks ugly, but in
|
|
* practice there should usually be few catlist members.
|
|
*/
|
|
recomputeNamespacePath();
|
|
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
int i;
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
for (i = 0; i < catlist->n_members; i++)
|
|
{
|
|
HeapTuple opertup = &catlist->members[i]->tuple;
|
|
Form_pg_operator operform = (Form_pg_operator) GETSTRUCT(opertup);
|
|
|
|
if (operform->oprnamespace == namespaceId)
|
|
{
|
|
Oid result = HeapTupleGetOid(opertup);
|
|
|
|
ReleaseSysCacheList(catlist);
|
|
return result;
|
|
}
|
|
}
|
|
}
|
|
|
|
ReleaseSysCacheList(catlist);
|
|
return InvalidOid;
|
|
}
|
|
|
|
/*
|
|
* OpernameGetCandidates
|
|
* Given a possibly-qualified operator name and operator kind,
|
|
* retrieve a list of the possible matches.
|
|
*
|
|
* If oprkind is '\0', we return all operators matching the given name,
|
|
* regardless of arguments.
|
|
*
|
|
* We search a single namespace if the operator name is qualified, else
|
|
* all namespaces in the search path. The return list will never contain
|
|
* multiple entries with identical argument lists --- in the multiple-
|
|
* namespace case, we arrange for entries in earlier namespaces to mask
|
|
* identical entries in later namespaces.
|
|
*
|
|
* The returned items always have two args[] entries --- one or the other
|
|
* will be InvalidOid for a prefix or postfix oprkind. nargs is 2, too.
|
|
*/
|
|
FuncCandidateList
|
|
OpernameGetCandidates(List *names, char oprkind)
|
|
{
|
|
FuncCandidateList resultList = NULL;
|
|
char *resultSpace = NULL;
|
|
int nextResult = 0;
|
|
char *schemaname;
|
|
char *opername;
|
|
Oid namespaceId;
|
|
CatCList *catlist;
|
|
int i;
|
|
|
|
/* deconstruct the name list */
|
|
DeconstructQualifiedName(names, &schemaname, &opername);
|
|
|
|
if (schemaname)
|
|
{
|
|
/* use exact schema given */
|
|
namespaceId = LookupExplicitNamespace(schemaname);
|
|
}
|
|
else
|
|
{
|
|
/* flag to indicate we need namespace search */
|
|
namespaceId = InvalidOid;
|
|
recomputeNamespacePath();
|
|
}
|
|
|
|
/* Search syscache by name only */
|
|
catlist = SearchSysCacheList(OPERNAMENSP, 1,
|
|
CStringGetDatum(opername),
|
|
0, 0, 0);
|
|
|
|
/*
|
|
* In typical scenarios, most if not all of the operators found by the
|
|
* catcache search will end up getting returned; and there can be quite a
|
|
* few, for common operator names such as '=' or '+'. To reduce the time
|
|
* spent in palloc, we allocate the result space as an array large enough
|
|
* to hold all the operators. The original coding of this routine did a
|
|
* separate palloc for each operator, but profiling revealed that the
|
|
* pallocs used an unreasonably large fraction of parsing time.
|
|
*/
|
|
#define SPACE_PER_OP MAXALIGN(sizeof(struct _FuncCandidateList) + sizeof(Oid))
|
|
|
|
if (catlist->n_members > 0)
|
|
resultSpace = palloc(catlist->n_members * SPACE_PER_OP);
|
|
|
|
for (i = 0; i < catlist->n_members; i++)
|
|
{
|
|
HeapTuple opertup = &catlist->members[i]->tuple;
|
|
Form_pg_operator operform = (Form_pg_operator) GETSTRUCT(opertup);
|
|
int pathpos = 0;
|
|
FuncCandidateList newResult;
|
|
|
|
/* Ignore operators of wrong kind, if specific kind requested */
|
|
if (oprkind && operform->oprkind != oprkind)
|
|
continue;
|
|
|
|
if (OidIsValid(namespaceId))
|
|
{
|
|
/* Consider only opers in specified namespace */
|
|
if (operform->oprnamespace != namespaceId)
|
|
continue;
|
|
/* No need to check args, they must all be different */
|
|
}
|
|
else
|
|
{
|
|
/*
|
|
* Consider only opers that are in the search path and are not in
|
|
* the temp namespace.
|
|
*/
|
|
ListCell *nsp;
|
|
|
|
foreach(nsp, activeSearchPath)
|
|
{
|
|
if (operform->oprnamespace == lfirst_oid(nsp) &&
|
|
operform->oprnamespace != myTempNamespace)
|
|
break;
|
|
pathpos++;
|
|
}
|
|
if (nsp == NULL)
|
|
continue; /* oper is not in search path */
|
|
|
|
/*
|
|
* Okay, it's in the search path, but does it have the same
|
|
* arguments as something we already accepted? If so, keep only
|
|
* the one that appears earlier in the search path.
|
|
*
|
|
* If we have an ordered list from SearchSysCacheList (the normal
|
|
* case), then any conflicting oper must immediately adjoin this
|
|
* one in the list, so we only need to look at the newest result
|
|
* item. If we have an unordered list, we have to scan the whole
|
|
* result list.
|
|
*/
|
|
if (resultList)
|
|
{
|
|
FuncCandidateList prevResult;
|
|
|
|
if (catlist->ordered)
|
|
{
|
|
if (operform->oprleft == resultList->args[0] &&
|
|
operform->oprright == resultList->args[1])
|
|
prevResult = resultList;
|
|
else
|
|
prevResult = NULL;
|
|
}
|
|
else
|
|
{
|
|
for (prevResult = resultList;
|
|
prevResult;
|
|
prevResult = prevResult->next)
|
|
{
|
|
if (operform->oprleft == prevResult->args[0] &&
|
|
operform->oprright == prevResult->args[1])
|
|
break;
|
|
}
|
|
}
|
|
if (prevResult)
|
|
{
|
|
/* We have a match with a previous result */
|
|
Assert(pathpos != prevResult->pathpos);
|
|
if (pathpos > prevResult->pathpos)
|
|
continue; /* keep previous result */
|
|
/* replace previous result */
|
|
prevResult->pathpos = pathpos;
|
|
prevResult->oid = HeapTupleGetOid(opertup);
|
|
continue; /* args are same, of course */
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Okay to add it to result list
|
|
*/
|
|
newResult = (FuncCandidateList) (resultSpace + nextResult);
|
|
nextResult += SPACE_PER_OP;
|
|
|
|
newResult->pathpos = pathpos;
|
|
newResult->oid = HeapTupleGetOid(opertup);
|
|
newResult->nargs = 2;
|
|
newResult->nvargs = 0;
|
|
newResult->args[0] = operform->oprleft;
|
|
newResult->args[1] = operform->oprright;
|
|
newResult->next = resultList;
|
|
resultList = newResult;
|
|
}
|
|
|
|
ReleaseSysCacheList(catlist);
|
|
|
|
return resultList;
|
|
}
|
|
|
|
/*
|
|
* OperatorIsVisible
|
|
* Determine whether an operator (identified by OID) is visible in the
|
|
* current search path. Visible means "would be found by searching
|
|
* for the unqualified operator name with exact argument matches".
|
|
*/
|
|
bool
|
|
OperatorIsVisible(Oid oprid)
|
|
{
|
|
HeapTuple oprtup;
|
|
Form_pg_operator oprform;
|
|
Oid oprnamespace;
|
|
bool visible;
|
|
|
|
oprtup = SearchSysCache(OPEROID,
|
|
ObjectIdGetDatum(oprid),
|
|
0, 0, 0);
|
|
if (!HeapTupleIsValid(oprtup))
|
|
elog(ERROR, "cache lookup failed for operator %u", oprid);
|
|
oprform = (Form_pg_operator) GETSTRUCT(oprtup);
|
|
|
|
recomputeNamespacePath();
|
|
|
|
/*
|
|
* Quick check: if it ain't in the path at all, it ain't visible. Items in
|
|
* the system namespace are surely in the path and so we needn't even do
|
|
* list_member_oid() for them.
|
|
*/
|
|
oprnamespace = oprform->oprnamespace;
|
|
if (oprnamespace != PG_CATALOG_NAMESPACE &&
|
|
!list_member_oid(activeSearchPath, oprnamespace))
|
|
visible = false;
|
|
else
|
|
{
|
|
/*
|
|
* If it is in the path, it might still not be visible; it could be
|
|
* hidden by another operator of the same name and arguments earlier
|
|
* in the path. So we must do a slow check to see if this is the same
|
|
* operator that would be found by OpernameGetOprId.
|
|
*/
|
|
char *oprname = NameStr(oprform->oprname);
|
|
|
|
visible = (OpernameGetOprid(list_make1(makeString(oprname)),
|
|
oprform->oprleft, oprform->oprright)
|
|
== oprid);
|
|
}
|
|
|
|
ReleaseSysCache(oprtup);
|
|
|
|
return visible;
|
|
}
|
|
|
|
|
|
/*
|
|
* OpclassnameGetOpcid
|
|
* Try to resolve an unqualified index opclass name.
|
|
* Returns OID if opclass found in search path, else InvalidOid.
|
|
*
|
|
* This is essentially the same as TypenameGetTypid, but we have to have
|
|
* an extra argument for the index AM OID.
|
|
*/
|
|
Oid
|
|
OpclassnameGetOpcid(Oid amid, const char *opcname)
|
|
{
|
|
Oid opcid;
|
|
ListCell *l;
|
|
|
|
recomputeNamespacePath();
|
|
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
opcid = GetSysCacheOid(CLAAMNAMENSP,
|
|
ObjectIdGetDatum(amid),
|
|
PointerGetDatum(opcname),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0);
|
|
if (OidIsValid(opcid))
|
|
return opcid;
|
|
}
|
|
|
|
/* Not found in path */
|
|
return InvalidOid;
|
|
}
|
|
|
|
/*
|
|
* OpclassIsVisible
|
|
* Determine whether an opclass (identified by OID) is visible in the
|
|
* current search path. Visible means "would be found by searching
|
|
* for the unqualified opclass name".
|
|
*/
|
|
bool
|
|
OpclassIsVisible(Oid opcid)
|
|
{
|
|
HeapTuple opctup;
|
|
Form_pg_opclass opcform;
|
|
Oid opcnamespace;
|
|
bool visible;
|
|
|
|
opctup = SearchSysCache(CLAOID,
|
|
ObjectIdGetDatum(opcid),
|
|
0, 0, 0);
|
|
if (!HeapTupleIsValid(opctup))
|
|
elog(ERROR, "cache lookup failed for opclass %u", opcid);
|
|
opcform = (Form_pg_opclass) GETSTRUCT(opctup);
|
|
|
|
recomputeNamespacePath();
|
|
|
|
/*
|
|
* Quick check: if it ain't in the path at all, it ain't visible. Items in
|
|
* the system namespace are surely in the path and so we needn't even do
|
|
* list_member_oid() for them.
|
|
*/
|
|
opcnamespace = opcform->opcnamespace;
|
|
if (opcnamespace != PG_CATALOG_NAMESPACE &&
|
|
!list_member_oid(activeSearchPath, opcnamespace))
|
|
visible = false;
|
|
else
|
|
{
|
|
/*
|
|
* If it is in the path, it might still not be visible; it could be
|
|
* hidden by another opclass of the same name earlier in the path. So
|
|
* we must do a slow check to see if this opclass would be found by
|
|
* OpclassnameGetOpcid.
|
|
*/
|
|
char *opcname = NameStr(opcform->opcname);
|
|
|
|
visible = (OpclassnameGetOpcid(opcform->opcmethod, opcname) == opcid);
|
|
}
|
|
|
|
ReleaseSysCache(opctup);
|
|
|
|
return visible;
|
|
}
|
|
|
|
/*
|
|
* OpfamilynameGetOpfid
|
|
* Try to resolve an unqualified index opfamily name.
|
|
* Returns OID if opfamily found in search path, else InvalidOid.
|
|
*
|
|
* This is essentially the same as TypenameGetTypid, but we have to have
|
|
* an extra argument for the index AM OID.
|
|
*/
|
|
Oid
|
|
OpfamilynameGetOpfid(Oid amid, const char *opfname)
|
|
{
|
|
Oid opfid;
|
|
ListCell *l;
|
|
|
|
recomputeNamespacePath();
|
|
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
opfid = GetSysCacheOid(OPFAMILYAMNAMENSP,
|
|
ObjectIdGetDatum(amid),
|
|
PointerGetDatum(opfname),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0);
|
|
if (OidIsValid(opfid))
|
|
return opfid;
|
|
}
|
|
|
|
/* Not found in path */
|
|
return InvalidOid;
|
|
}
|
|
|
|
/*
|
|
* OpfamilyIsVisible
|
|
* Determine whether an opfamily (identified by OID) is visible in the
|
|
* current search path. Visible means "would be found by searching
|
|
* for the unqualified opfamily name".
|
|
*/
|
|
bool
|
|
OpfamilyIsVisible(Oid opfid)
|
|
{
|
|
HeapTuple opftup;
|
|
Form_pg_opfamily opfform;
|
|
Oid opfnamespace;
|
|
bool visible;
|
|
|
|
opftup = SearchSysCache(OPFAMILYOID,
|
|
ObjectIdGetDatum(opfid),
|
|
0, 0, 0);
|
|
if (!HeapTupleIsValid(opftup))
|
|
elog(ERROR, "cache lookup failed for opfamily %u", opfid);
|
|
opfform = (Form_pg_opfamily) GETSTRUCT(opftup);
|
|
|
|
recomputeNamespacePath();
|
|
|
|
/*
|
|
* Quick check: if it ain't in the path at all, it ain't visible. Items in
|
|
* the system namespace are surely in the path and so we needn't even do
|
|
* list_member_oid() for them.
|
|
*/
|
|
opfnamespace = opfform->opfnamespace;
|
|
if (opfnamespace != PG_CATALOG_NAMESPACE &&
|
|
!list_member_oid(activeSearchPath, opfnamespace))
|
|
visible = false;
|
|
else
|
|
{
|
|
/*
|
|
* If it is in the path, it might still not be visible; it could be
|
|
* hidden by another opfamily of the same name earlier in the path. So
|
|
* we must do a slow check to see if this opfamily would be found by
|
|
* OpfamilynameGetOpfid.
|
|
*/
|
|
char *opfname = NameStr(opfform->opfname);
|
|
|
|
visible = (OpfamilynameGetOpfid(opfform->opfmethod, opfname) == opfid);
|
|
}
|
|
|
|
ReleaseSysCache(opftup);
|
|
|
|
return visible;
|
|
}
|
|
|
|
/*
|
|
* ConversionGetConid
|
|
* Try to resolve an unqualified conversion name.
|
|
* Returns OID if conversion found in search path, else InvalidOid.
|
|
*
|
|
* This is essentially the same as RelnameGetRelid.
|
|
*/
|
|
Oid
|
|
ConversionGetConid(const char *conname)
|
|
{
|
|
Oid conid;
|
|
ListCell *l;
|
|
|
|
recomputeNamespacePath();
|
|
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
conid = GetSysCacheOid(CONNAMENSP,
|
|
PointerGetDatum(conname),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0);
|
|
if (OidIsValid(conid))
|
|
return conid;
|
|
}
|
|
|
|
/* Not found in path */
|
|
return InvalidOid;
|
|
}
|
|
|
|
/*
|
|
* ConversionIsVisible
|
|
* Determine whether a conversion (identified by OID) is visible in the
|
|
* current search path. Visible means "would be found by searching
|
|
* for the unqualified conversion name".
|
|
*/
|
|
bool
|
|
ConversionIsVisible(Oid conid)
|
|
{
|
|
HeapTuple contup;
|
|
Form_pg_conversion conform;
|
|
Oid connamespace;
|
|
bool visible;
|
|
|
|
contup = SearchSysCache(CONVOID,
|
|
ObjectIdGetDatum(conid),
|
|
0, 0, 0);
|
|
if (!HeapTupleIsValid(contup))
|
|
elog(ERROR, "cache lookup failed for conversion %u", conid);
|
|
conform = (Form_pg_conversion) GETSTRUCT(contup);
|
|
|
|
recomputeNamespacePath();
|
|
|
|
/*
|
|
* Quick check: if it ain't in the path at all, it ain't visible. Items in
|
|
* the system namespace are surely in the path and so we needn't even do
|
|
* list_member_oid() for them.
|
|
*/
|
|
connamespace = conform->connamespace;
|
|
if (connamespace != PG_CATALOG_NAMESPACE &&
|
|
!list_member_oid(activeSearchPath, connamespace))
|
|
visible = false;
|
|
else
|
|
{
|
|
/*
|
|
* If it is in the path, it might still not be visible; it could be
|
|
* hidden by another conversion of the same name earlier in the path.
|
|
* So we must do a slow check to see if this conversion would be found
|
|
* by ConversionGetConid.
|
|
*/
|
|
char *conname = NameStr(conform->conname);
|
|
|
|
visible = (ConversionGetConid(conname) == conid);
|
|
}
|
|
|
|
ReleaseSysCache(contup);
|
|
|
|
return visible;
|
|
}
|
|
|
|
/*
|
|
* TSParserGetPrsid - find a TS parser by possibly qualified name
|
|
*
|
|
* If not found, returns InvalidOid if failOK, else throws error
|
|
*/
|
|
Oid
|
|
TSParserGetPrsid(List *names, bool failOK)
|
|
{
|
|
char *schemaname;
|
|
char *parser_name;
|
|
Oid namespaceId;
|
|
Oid prsoid = InvalidOid;
|
|
ListCell *l;
|
|
|
|
/* deconstruct the name list */
|
|
DeconstructQualifiedName(names, &schemaname, &parser_name);
|
|
|
|
if (schemaname)
|
|
{
|
|
/* use exact schema given */
|
|
namespaceId = LookupExplicitNamespace(schemaname);
|
|
prsoid = GetSysCacheOid(TSPARSERNAMENSP,
|
|
PointerGetDatum(parser_name),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0);
|
|
}
|
|
else
|
|
{
|
|
/* search for it in search path */
|
|
recomputeNamespacePath();
|
|
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
prsoid = GetSysCacheOid(TSPARSERNAMENSP,
|
|
PointerGetDatum(parser_name),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0);
|
|
if (OidIsValid(prsoid))
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!OidIsValid(prsoid) && !failOK)
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_UNDEFINED_OBJECT),
|
|
errmsg("text search parser \"%s\" does not exist",
|
|
NameListToString(names))));
|
|
|
|
return prsoid;
|
|
}
|
|
|
|
/*
|
|
* TSParserIsVisible
|
|
* Determine whether a parser (identified by OID) is visible in the
|
|
* current search path. Visible means "would be found by searching
|
|
* for the unqualified parser name".
|
|
*/
|
|
bool
|
|
TSParserIsVisible(Oid prsId)
|
|
{
|
|
HeapTuple tup;
|
|
Form_pg_ts_parser form;
|
|
Oid namespace;
|
|
bool visible;
|
|
|
|
tup = SearchSysCache(TSPARSEROID,
|
|
ObjectIdGetDatum(prsId),
|
|
0, 0, 0);
|
|
if (!HeapTupleIsValid(tup))
|
|
elog(ERROR, "cache lookup failed for text search parser %u", prsId);
|
|
form = (Form_pg_ts_parser) GETSTRUCT(tup);
|
|
|
|
recomputeNamespacePath();
|
|
|
|
/*
|
|
* Quick check: if it ain't in the path at all, it ain't visible. Items in
|
|
* the system namespace are surely in the path and so we needn't even do
|
|
* list_member_oid() for them.
|
|
*/
|
|
namespace = form->prsnamespace;
|
|
if (namespace != PG_CATALOG_NAMESPACE &&
|
|
!list_member_oid(activeSearchPath, namespace))
|
|
visible = false;
|
|
else
|
|
{
|
|
/*
|
|
* If it is in the path, it might still not be visible; it could be
|
|
* hidden by another parser of the same name earlier in the path. So
|
|
* we must do a slow check for conflicting parsers.
|
|
*/
|
|
char *name = NameStr(form->prsname);
|
|
ListCell *l;
|
|
|
|
visible = false;
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
if (namespaceId == namespace)
|
|
{
|
|
/* Found it first in path */
|
|
visible = true;
|
|
break;
|
|
}
|
|
if (SearchSysCacheExists(TSPARSERNAMENSP,
|
|
PointerGetDatum(name),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0))
|
|
{
|
|
/* Found something else first in path */
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
ReleaseSysCache(tup);
|
|
|
|
return visible;
|
|
}
|
|
|
|
/*
|
|
* TSDictionaryGetDictid - find a TS dictionary by possibly qualified name
|
|
*
|
|
* If not found, returns InvalidOid if failOK, else throws error
|
|
*/
|
|
Oid
|
|
TSDictionaryGetDictid(List *names, bool failOK)
|
|
{
|
|
char *schemaname;
|
|
char *dict_name;
|
|
Oid namespaceId;
|
|
Oid dictoid = InvalidOid;
|
|
ListCell *l;
|
|
|
|
/* deconstruct the name list */
|
|
DeconstructQualifiedName(names, &schemaname, &dict_name);
|
|
|
|
if (schemaname)
|
|
{
|
|
/* use exact schema given */
|
|
namespaceId = LookupExplicitNamespace(schemaname);
|
|
dictoid = GetSysCacheOid(TSDICTNAMENSP,
|
|
PointerGetDatum(dict_name),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0);
|
|
}
|
|
else
|
|
{
|
|
/* search for it in search path */
|
|
recomputeNamespacePath();
|
|
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
dictoid = GetSysCacheOid(TSDICTNAMENSP,
|
|
PointerGetDatum(dict_name),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0);
|
|
if (OidIsValid(dictoid))
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!OidIsValid(dictoid) && !failOK)
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_UNDEFINED_OBJECT),
|
|
errmsg("text search dictionary \"%s\" does not exist",
|
|
NameListToString(names))));
|
|
|
|
return dictoid;
|
|
}
|
|
|
|
/*
|
|
* TSDictionaryIsVisible
|
|
* Determine whether a dictionary (identified by OID) is visible in the
|
|
* current search path. Visible means "would be found by searching
|
|
* for the unqualified dictionary name".
|
|
*/
|
|
bool
|
|
TSDictionaryIsVisible(Oid dictId)
|
|
{
|
|
HeapTuple tup;
|
|
Form_pg_ts_dict form;
|
|
Oid namespace;
|
|
bool visible;
|
|
|
|
tup = SearchSysCache(TSDICTOID,
|
|
ObjectIdGetDatum(dictId),
|
|
0, 0, 0);
|
|
if (!HeapTupleIsValid(tup))
|
|
elog(ERROR, "cache lookup failed for text search dictionary %u",
|
|
dictId);
|
|
form = (Form_pg_ts_dict) GETSTRUCT(tup);
|
|
|
|
recomputeNamespacePath();
|
|
|
|
/*
|
|
* Quick check: if it ain't in the path at all, it ain't visible. Items in
|
|
* the system namespace are surely in the path and so we needn't even do
|
|
* list_member_oid() for them.
|
|
*/
|
|
namespace = form->dictnamespace;
|
|
if (namespace != PG_CATALOG_NAMESPACE &&
|
|
!list_member_oid(activeSearchPath, namespace))
|
|
visible = false;
|
|
else
|
|
{
|
|
/*
|
|
* If it is in the path, it might still not be visible; it could be
|
|
* hidden by another dictionary of the same name earlier in the path.
|
|
* So we must do a slow check for conflicting dictionaries.
|
|
*/
|
|
char *name = NameStr(form->dictname);
|
|
ListCell *l;
|
|
|
|
visible = false;
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
if (namespaceId == namespace)
|
|
{
|
|
/* Found it first in path */
|
|
visible = true;
|
|
break;
|
|
}
|
|
if (SearchSysCacheExists(TSDICTNAMENSP,
|
|
PointerGetDatum(name),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0))
|
|
{
|
|
/* Found something else first in path */
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
ReleaseSysCache(tup);
|
|
|
|
return visible;
|
|
}
|
|
|
|
/*
|
|
* TSTemplateGetTmplid - find a TS template by possibly qualified name
|
|
*
|
|
* If not found, returns InvalidOid if failOK, else throws error
|
|
*/
|
|
Oid
|
|
TSTemplateGetTmplid(List *names, bool failOK)
|
|
{
|
|
char *schemaname;
|
|
char *template_name;
|
|
Oid namespaceId;
|
|
Oid tmploid = InvalidOid;
|
|
ListCell *l;
|
|
|
|
/* deconstruct the name list */
|
|
DeconstructQualifiedName(names, &schemaname, &template_name);
|
|
|
|
if (schemaname)
|
|
{
|
|
/* use exact schema given */
|
|
namespaceId = LookupExplicitNamespace(schemaname);
|
|
tmploid = GetSysCacheOid(TSTEMPLATENAMENSP,
|
|
PointerGetDatum(template_name),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0);
|
|
}
|
|
else
|
|
{
|
|
/* search for it in search path */
|
|
recomputeNamespacePath();
|
|
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
tmploid = GetSysCacheOid(TSTEMPLATENAMENSP,
|
|
PointerGetDatum(template_name),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0);
|
|
if (OidIsValid(tmploid))
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!OidIsValid(tmploid) && !failOK)
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_UNDEFINED_OBJECT),
|
|
errmsg("text search template \"%s\" does not exist",
|
|
NameListToString(names))));
|
|
|
|
return tmploid;
|
|
}
|
|
|
|
/*
|
|
* TSTemplateIsVisible
|
|
* Determine whether a template (identified by OID) is visible in the
|
|
* current search path. Visible means "would be found by searching
|
|
* for the unqualified template name".
|
|
*/
|
|
bool
|
|
TSTemplateIsVisible(Oid tmplId)
|
|
{
|
|
HeapTuple tup;
|
|
Form_pg_ts_template form;
|
|
Oid namespace;
|
|
bool visible;
|
|
|
|
tup = SearchSysCache(TSTEMPLATEOID,
|
|
ObjectIdGetDatum(tmplId),
|
|
0, 0, 0);
|
|
if (!HeapTupleIsValid(tup))
|
|
elog(ERROR, "cache lookup failed for text search template %u", tmplId);
|
|
form = (Form_pg_ts_template) GETSTRUCT(tup);
|
|
|
|
recomputeNamespacePath();
|
|
|
|
/*
|
|
* Quick check: if it ain't in the path at all, it ain't visible. Items in
|
|
* the system namespace are surely in the path and so we needn't even do
|
|
* list_member_oid() for them.
|
|
*/
|
|
namespace = form->tmplnamespace;
|
|
if (namespace != PG_CATALOG_NAMESPACE &&
|
|
!list_member_oid(activeSearchPath, namespace))
|
|
visible = false;
|
|
else
|
|
{
|
|
/*
|
|
* If it is in the path, it might still not be visible; it could be
|
|
* hidden by another template of the same name earlier in the path. So
|
|
* we must do a slow check for conflicting templates.
|
|
*/
|
|
char *name = NameStr(form->tmplname);
|
|
ListCell *l;
|
|
|
|
visible = false;
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
if (namespaceId == namespace)
|
|
{
|
|
/* Found it first in path */
|
|
visible = true;
|
|
break;
|
|
}
|
|
if (SearchSysCacheExists(TSTEMPLATENAMENSP,
|
|
PointerGetDatum(name),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0))
|
|
{
|
|
/* Found something else first in path */
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
ReleaseSysCache(tup);
|
|
|
|
return visible;
|
|
}
|
|
|
|
/*
|
|
* TSConfigGetCfgid - find a TS config by possibly qualified name
|
|
*
|
|
* If not found, returns InvalidOid if failOK, else throws error
|
|
*/
|
|
Oid
|
|
TSConfigGetCfgid(List *names, bool failOK)
|
|
{
|
|
char *schemaname;
|
|
char *config_name;
|
|
Oid namespaceId;
|
|
Oid cfgoid = InvalidOid;
|
|
ListCell *l;
|
|
|
|
/* deconstruct the name list */
|
|
DeconstructQualifiedName(names, &schemaname, &config_name);
|
|
|
|
if (schemaname)
|
|
{
|
|
/* use exact schema given */
|
|
namespaceId = LookupExplicitNamespace(schemaname);
|
|
cfgoid = GetSysCacheOid(TSCONFIGNAMENSP,
|
|
PointerGetDatum(config_name),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0);
|
|
}
|
|
else
|
|
{
|
|
/* search for it in search path */
|
|
recomputeNamespacePath();
|
|
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
cfgoid = GetSysCacheOid(TSCONFIGNAMENSP,
|
|
PointerGetDatum(config_name),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0);
|
|
if (OidIsValid(cfgoid))
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!OidIsValid(cfgoid) && !failOK)
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_UNDEFINED_OBJECT),
|
|
errmsg("text search configuration \"%s\" does not exist",
|
|
NameListToString(names))));
|
|
|
|
return cfgoid;
|
|
}
|
|
|
|
/*
|
|
* TSConfigIsVisible
|
|
* Determine whether a text search configuration (identified by OID)
|
|
* is visible in the current search path. Visible means "would be found
|
|
* by searching for the unqualified text search configuration name".
|
|
*/
|
|
bool
|
|
TSConfigIsVisible(Oid cfgid)
|
|
{
|
|
HeapTuple tup;
|
|
Form_pg_ts_config form;
|
|
Oid namespace;
|
|
bool visible;
|
|
|
|
tup = SearchSysCache(TSCONFIGOID,
|
|
ObjectIdGetDatum(cfgid),
|
|
0, 0, 0);
|
|
if (!HeapTupleIsValid(tup))
|
|
elog(ERROR, "cache lookup failed for text search configuration %u",
|
|
cfgid);
|
|
form = (Form_pg_ts_config) GETSTRUCT(tup);
|
|
|
|
recomputeNamespacePath();
|
|
|
|
/*
|
|
* Quick check: if it ain't in the path at all, it ain't visible. Items in
|
|
* the system namespace are surely in the path and so we needn't even do
|
|
* list_member_oid() for them.
|
|
*/
|
|
namespace = form->cfgnamespace;
|
|
if (namespace != PG_CATALOG_NAMESPACE &&
|
|
!list_member_oid(activeSearchPath, namespace))
|
|
visible = false;
|
|
else
|
|
{
|
|
/*
|
|
* If it is in the path, it might still not be visible; it could be
|
|
* hidden by another configuration of the same name earlier in the
|
|
* path. So we must do a slow check for conflicting configurations.
|
|
*/
|
|
char *name = NameStr(form->cfgname);
|
|
ListCell *l;
|
|
|
|
visible = false;
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
if (namespaceId == namespace)
|
|
{
|
|
/* Found it first in path */
|
|
visible = true;
|
|
break;
|
|
}
|
|
if (SearchSysCacheExists(TSCONFIGNAMENSP,
|
|
PointerGetDatum(name),
|
|
ObjectIdGetDatum(namespaceId),
|
|
0, 0))
|
|
{
|
|
/* Found something else first in path */
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
ReleaseSysCache(tup);
|
|
|
|
return visible;
|
|
}
|
|
|
|
|
|
/*
|
|
* DeconstructQualifiedName
|
|
* Given a possibly-qualified name expressed as a list of String nodes,
|
|
* extract the schema name and object name.
|
|
*
|
|
* *nspname_p is set to NULL if there is no explicit schema name.
|
|
*/
|
|
void
|
|
DeconstructQualifiedName(List *names,
|
|
char **nspname_p,
|
|
char **objname_p)
|
|
{
|
|
char *catalogname;
|
|
char *schemaname = NULL;
|
|
char *objname = NULL;
|
|
|
|
switch (list_length(names))
|
|
{
|
|
case 1:
|
|
objname = strVal(linitial(names));
|
|
break;
|
|
case 2:
|
|
schemaname = strVal(linitial(names));
|
|
objname = strVal(lsecond(names));
|
|
break;
|
|
case 3:
|
|
catalogname = strVal(linitial(names));
|
|
schemaname = strVal(lsecond(names));
|
|
objname = strVal(lthird(names));
|
|
|
|
/*
|
|
* We check the catalog name and then ignore it.
|
|
*/
|
|
if (strcmp(catalogname, get_database_name(MyDatabaseId)) != 0)
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
|
|
errmsg("cross-database references are not implemented: %s",
|
|
NameListToString(names))));
|
|
break;
|
|
default:
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_SYNTAX_ERROR),
|
|
errmsg("improper qualified name (too many dotted names): %s",
|
|
NameListToString(names))));
|
|
break;
|
|
}
|
|
|
|
*nspname_p = schemaname;
|
|
*objname_p = objname;
|
|
}
|
|
|
|
/*
|
|
* LookupExplicitNamespace
|
|
* Process an explicitly-specified schema name: look up the schema
|
|
* and verify we have USAGE (lookup) rights in it.
|
|
*
|
|
* Returns the namespace OID. Raises ereport if any problem.
|
|
*/
|
|
Oid
|
|
LookupExplicitNamespace(const char *nspname)
|
|
{
|
|
Oid namespaceId;
|
|
AclResult aclresult;
|
|
|
|
/* check for pg_temp alias */
|
|
if (strcmp(nspname, "pg_temp") == 0)
|
|
{
|
|
if (OidIsValid(myTempNamespace))
|
|
return myTempNamespace;
|
|
|
|
/*
|
|
* Since this is used only for looking up existing objects, there is
|
|
* no point in trying to initialize the temp namespace here; and doing
|
|
* so might create problems for some callers. Just fall through and
|
|
* give the "does not exist" error.
|
|
*/
|
|
}
|
|
|
|
namespaceId = GetSysCacheOid(NAMESPACENAME,
|
|
CStringGetDatum(nspname),
|
|
0, 0, 0);
|
|
if (!OidIsValid(namespaceId))
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_UNDEFINED_SCHEMA),
|
|
errmsg("schema \"%s\" does not exist", nspname)));
|
|
|
|
aclresult = pg_namespace_aclcheck(namespaceId, GetUserId(), ACL_USAGE);
|
|
if (aclresult != ACLCHECK_OK)
|
|
aclcheck_error(aclresult, ACL_KIND_NAMESPACE,
|
|
nspname);
|
|
|
|
return namespaceId;
|
|
}
|
|
|
|
/*
|
|
* LookupCreationNamespace
|
|
* Look up the schema and verify we have CREATE rights on it.
|
|
*
|
|
* This is just like LookupExplicitNamespace except for the permission check,
|
|
* and that we are willing to create pg_temp if needed.
|
|
*
|
|
* Note: calling this may result in a CommandCounterIncrement operation,
|
|
* if we have to create or clean out the temp namespace.
|
|
*/
|
|
Oid
|
|
LookupCreationNamespace(const char *nspname)
|
|
{
|
|
Oid namespaceId;
|
|
AclResult aclresult;
|
|
|
|
/* check for pg_temp alias */
|
|
if (strcmp(nspname, "pg_temp") == 0)
|
|
{
|
|
/* Initialize temp namespace if first time through */
|
|
if (!OidIsValid(myTempNamespace))
|
|
InitTempTableNamespace();
|
|
return myTempNamespace;
|
|
}
|
|
|
|
namespaceId = GetSysCacheOid(NAMESPACENAME,
|
|
CStringGetDatum(nspname),
|
|
0, 0, 0);
|
|
if (!OidIsValid(namespaceId))
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_UNDEFINED_SCHEMA),
|
|
errmsg("schema \"%s\" does not exist", nspname)));
|
|
|
|
aclresult = pg_namespace_aclcheck(namespaceId, GetUserId(), ACL_CREATE);
|
|
if (aclresult != ACLCHECK_OK)
|
|
aclcheck_error(aclresult, ACL_KIND_NAMESPACE,
|
|
nspname);
|
|
|
|
return namespaceId;
|
|
}
|
|
|
|
/*
|
|
* QualifiedNameGetCreationNamespace
|
|
* Given a possibly-qualified name for an object (in List-of-Values
|
|
* format), determine what namespace the object should be created in.
|
|
* Also extract and return the object name (last component of list).
|
|
*
|
|
* Note: this does not apply any permissions check. Callers must check
|
|
* for CREATE rights on the selected namespace when appropriate.
|
|
*
|
|
* Note: calling this may result in a CommandCounterIncrement operation,
|
|
* if we have to create or clean out the temp namespace.
|
|
*/
|
|
Oid
|
|
QualifiedNameGetCreationNamespace(List *names, char **objname_p)
|
|
{
|
|
char *schemaname;
|
|
Oid namespaceId;
|
|
|
|
/* deconstruct the name list */
|
|
DeconstructQualifiedName(names, &schemaname, objname_p);
|
|
|
|
if (schemaname)
|
|
{
|
|
/* check for pg_temp alias */
|
|
if (strcmp(schemaname, "pg_temp") == 0)
|
|
{
|
|
/* Initialize temp namespace if first time through */
|
|
if (!OidIsValid(myTempNamespace))
|
|
InitTempTableNamespace();
|
|
return myTempNamespace;
|
|
}
|
|
/* use exact schema given */
|
|
namespaceId = GetSysCacheOid(NAMESPACENAME,
|
|
CStringGetDatum(schemaname),
|
|
0, 0, 0);
|
|
if (!OidIsValid(namespaceId))
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_UNDEFINED_SCHEMA),
|
|
errmsg("schema \"%s\" does not exist", schemaname)));
|
|
/* we do not check for USAGE rights here! */
|
|
}
|
|
else
|
|
{
|
|
/* use the default creation namespace */
|
|
recomputeNamespacePath();
|
|
if (activeTempCreationPending)
|
|
{
|
|
/* Need to initialize temp namespace */
|
|
InitTempTableNamespace();
|
|
return myTempNamespace;
|
|
}
|
|
namespaceId = activeCreationNamespace;
|
|
if (!OidIsValid(namespaceId))
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_UNDEFINED_SCHEMA),
|
|
errmsg("no schema has been selected to create in")));
|
|
}
|
|
|
|
return namespaceId;
|
|
}
|
|
|
|
/*
|
|
* makeRangeVarFromNameList
|
|
* Utility routine to convert a qualified-name list into RangeVar form.
|
|
*/
|
|
RangeVar *
|
|
makeRangeVarFromNameList(List *names)
|
|
{
|
|
RangeVar *rel = makeRangeVar(NULL, NULL, -1);
|
|
|
|
switch (list_length(names))
|
|
{
|
|
case 1:
|
|
rel->relname = strVal(linitial(names));
|
|
break;
|
|
case 2:
|
|
rel->schemaname = strVal(linitial(names));
|
|
rel->relname = strVal(lsecond(names));
|
|
break;
|
|
case 3:
|
|
rel->catalogname = strVal(linitial(names));
|
|
rel->schemaname = strVal(lsecond(names));
|
|
rel->relname = strVal(lthird(names));
|
|
break;
|
|
default:
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_SYNTAX_ERROR),
|
|
errmsg("improper relation name (too many dotted names): %s",
|
|
NameListToString(names))));
|
|
break;
|
|
}
|
|
|
|
return rel;
|
|
}
|
|
|
|
/*
|
|
* NameListToString
|
|
* Utility routine to convert a qualified-name list into a string.
|
|
*
|
|
* This is used primarily to form error messages, and so we do not quote
|
|
* the list elements, for the sake of legibility.
|
|
*
|
|
* In most scenarios the list elements should always be Value strings,
|
|
* but we also allow A_Star for the convenience of ColumnRef processing.
|
|
*/
|
|
char *
|
|
NameListToString(List *names)
|
|
{
|
|
StringInfoData string;
|
|
ListCell *l;
|
|
|
|
initStringInfo(&string);
|
|
|
|
foreach(l, names)
|
|
{
|
|
Node *name = (Node *) lfirst(l);
|
|
|
|
if (l != list_head(names))
|
|
appendStringInfoChar(&string, '.');
|
|
|
|
if (IsA(name, String))
|
|
appendStringInfoString(&string, strVal(name));
|
|
else if (IsA(name, A_Star))
|
|
appendStringInfoString(&string, "*");
|
|
else
|
|
elog(ERROR, "unexpected node type in name list: %d",
|
|
(int) nodeTag(name));
|
|
}
|
|
|
|
return string.data;
|
|
}
|
|
|
|
/*
|
|
* NameListToQuotedString
|
|
* Utility routine to convert a qualified-name list into a string.
|
|
*
|
|
* Same as above except that names will be double-quoted where necessary,
|
|
* so the string could be re-parsed (eg, by textToQualifiedNameList).
|
|
*/
|
|
char *
|
|
NameListToQuotedString(List *names)
|
|
{
|
|
StringInfoData string;
|
|
ListCell *l;
|
|
|
|
initStringInfo(&string);
|
|
|
|
foreach(l, names)
|
|
{
|
|
if (l != list_head(names))
|
|
appendStringInfoChar(&string, '.');
|
|
appendStringInfoString(&string, quote_identifier(strVal(lfirst(l))));
|
|
}
|
|
|
|
return string.data;
|
|
}
|
|
|
|
/*
|
|
* isTempNamespace - is the given namespace my temporary-table namespace?
|
|
*/
|
|
bool
|
|
isTempNamespace(Oid namespaceId)
|
|
{
|
|
if (OidIsValid(myTempNamespace) && myTempNamespace == namespaceId)
|
|
return true;
|
|
return false;
|
|
}
|
|
|
|
/*
|
|
* isTempToastNamespace - is the given namespace my temporary-toast-table
|
|
* namespace?
|
|
*/
|
|
bool
|
|
isTempToastNamespace(Oid namespaceId)
|
|
{
|
|
if (OidIsValid(myTempToastNamespace) && myTempToastNamespace == namespaceId)
|
|
return true;
|
|
return false;
|
|
}
|
|
|
|
/*
|
|
* isTempOrToastNamespace - is the given namespace my temporary-table
|
|
* namespace or my temporary-toast-table namespace?
|
|
*/
|
|
bool
|
|
isTempOrToastNamespace(Oid namespaceId)
|
|
{
|
|
if (OidIsValid(myTempNamespace) &&
|
|
(myTempNamespace == namespaceId || myTempToastNamespace == namespaceId))
|
|
return true;
|
|
return false;
|
|
}
|
|
|
|
/*
|
|
* isAnyTempNamespace - is the given namespace a temporary-table namespace
|
|
* (either my own, or another backend's)? Temporary-toast-table namespaces
|
|
* are included, too.
|
|
*/
|
|
bool
|
|
isAnyTempNamespace(Oid namespaceId)
|
|
{
|
|
bool result;
|
|
char *nspname;
|
|
|
|
/* True if the namespace name starts with "pg_temp_" or "pg_toast_temp_" */
|
|
nspname = get_namespace_name(namespaceId);
|
|
if (!nspname)
|
|
return false; /* no such namespace? */
|
|
result = (strncmp(nspname, "pg_temp_", 8) == 0) ||
|
|
(strncmp(nspname, "pg_toast_temp_", 14) == 0);
|
|
pfree(nspname);
|
|
return result;
|
|
}
|
|
|
|
/*
|
|
* isOtherTempNamespace - is the given namespace some other backend's
|
|
* temporary-table namespace (including temporary-toast-table namespaces)?
|
|
*/
|
|
bool
|
|
isOtherTempNamespace(Oid namespaceId)
|
|
{
|
|
/* If it's my own temp namespace, say "false" */
|
|
if (isTempOrToastNamespace(namespaceId))
|
|
return false;
|
|
/* Else, if it's any temp namespace, say "true" */
|
|
return isAnyTempNamespace(namespaceId);
|
|
}
|
|
|
|
/*
|
|
* GetTempNamespaceBackendId - if the given namespace is a temporary-table
|
|
* namespace (either my own, or another backend's), return the BackendId
|
|
* that owns it. Temporary-toast-table namespaces are included, too.
|
|
* If it isn't a temp namespace, return -1.
|
|
*/
|
|
int
|
|
GetTempNamespaceBackendId(Oid namespaceId)
|
|
{
|
|
int result;
|
|
char *nspname;
|
|
|
|
/* See if the namespace name starts with "pg_temp_" or "pg_toast_temp_" */
|
|
nspname = get_namespace_name(namespaceId);
|
|
if (!nspname)
|
|
return -1; /* no such namespace? */
|
|
if (strncmp(nspname, "pg_temp_", 8) == 0)
|
|
result = atoi(nspname + 8);
|
|
else if (strncmp(nspname, "pg_toast_temp_", 14) == 0)
|
|
result = atoi(nspname + 14);
|
|
else
|
|
result = -1;
|
|
pfree(nspname);
|
|
return result;
|
|
}
|
|
|
|
/*
|
|
* GetTempToastNamespace - get the OID of my temporary-toast-table namespace,
|
|
* which must already be assigned. (This is only used when creating a toast
|
|
* table for a temp table, so we must have already done InitTempTableNamespace)
|
|
*/
|
|
Oid
|
|
GetTempToastNamespace(void)
|
|
{
|
|
Assert(OidIsValid(myTempToastNamespace));
|
|
return myTempToastNamespace;
|
|
}
|
|
|
|
|
|
/*
|
|
* GetOverrideSearchPath - fetch current search path definition in form
|
|
* used by PushOverrideSearchPath.
|
|
*
|
|
* The result structure is allocated in the specified memory context
|
|
* (which might or might not be equal to CurrentMemoryContext); but any
|
|
* junk created by revalidation calculations will be in CurrentMemoryContext.
|
|
*/
|
|
OverrideSearchPath *
|
|
GetOverrideSearchPath(MemoryContext context)
|
|
{
|
|
OverrideSearchPath *result;
|
|
List *schemas;
|
|
MemoryContext oldcxt;
|
|
|
|
recomputeNamespacePath();
|
|
|
|
oldcxt = MemoryContextSwitchTo(context);
|
|
|
|
result = (OverrideSearchPath *) palloc0(sizeof(OverrideSearchPath));
|
|
schemas = list_copy(activeSearchPath);
|
|
while (schemas && linitial_oid(schemas) != activeCreationNamespace)
|
|
{
|
|
if (linitial_oid(schemas) == myTempNamespace)
|
|
result->addTemp = true;
|
|
else
|
|
{
|
|
Assert(linitial_oid(schemas) == PG_CATALOG_NAMESPACE);
|
|
result->addCatalog = true;
|
|
}
|
|
schemas = list_delete_first(schemas);
|
|
}
|
|
result->schemas = schemas;
|
|
|
|
MemoryContextSwitchTo(oldcxt);
|
|
|
|
return result;
|
|
}
|
|
|
|
/*
|
|
* PushOverrideSearchPath - temporarily override the search path
|
|
*
|
|
* We allow nested overrides, hence the push/pop terminology. The GUC
|
|
* search_path variable is ignored while an override is active.
|
|
*/
|
|
void
|
|
PushOverrideSearchPath(OverrideSearchPath *newpath)
|
|
{
|
|
OverrideStackEntry *entry;
|
|
List *oidlist;
|
|
Oid firstNS;
|
|
MemoryContext oldcxt;
|
|
|
|
/*
|
|
* Copy the list for safekeeping, and insert implicitly-searched
|
|
* namespaces as needed. This code should track recomputeNamespacePath.
|
|
*/
|
|
oldcxt = MemoryContextSwitchTo(TopMemoryContext);
|
|
|
|
oidlist = list_copy(newpath->schemas);
|
|
|
|
/*
|
|
* Remember the first member of the explicit list.
|
|
*/
|
|
if (oidlist == NIL)
|
|
firstNS = InvalidOid;
|
|
else
|
|
firstNS = linitial_oid(oidlist);
|
|
|
|
/*
|
|
* Add any implicitly-searched namespaces to the list. Note these go on
|
|
* the front, not the back; also notice that we do not check USAGE
|
|
* permissions for these.
|
|
*/
|
|
if (newpath->addCatalog)
|
|
oidlist = lcons_oid(PG_CATALOG_NAMESPACE, oidlist);
|
|
|
|
if (newpath->addTemp)
|
|
{
|
|
Assert(OidIsValid(myTempNamespace));
|
|
oidlist = lcons_oid(myTempNamespace, oidlist);
|
|
}
|
|
|
|
/*
|
|
* Build the new stack entry, then insert it at the head of the list.
|
|
*/
|
|
entry = (OverrideStackEntry *) palloc(sizeof(OverrideStackEntry));
|
|
entry->searchPath = oidlist;
|
|
entry->creationNamespace = firstNS;
|
|
entry->nestLevel = GetCurrentTransactionNestLevel();
|
|
|
|
overrideStack = lcons(entry, overrideStack);
|
|
|
|
/* And make it active. */
|
|
activeSearchPath = entry->searchPath;
|
|
activeCreationNamespace = entry->creationNamespace;
|
|
activeTempCreationPending = false; /* XXX is this OK? */
|
|
|
|
MemoryContextSwitchTo(oldcxt);
|
|
}
|
|
|
|
/*
|
|
* PopOverrideSearchPath - undo a previous PushOverrideSearchPath
|
|
*
|
|
* Any push during a (sub)transaction will be popped automatically at abort.
|
|
* But it's caller error if a push isn't popped in normal control flow.
|
|
*/
|
|
void
|
|
PopOverrideSearchPath(void)
|
|
{
|
|
OverrideStackEntry *entry;
|
|
|
|
/* Sanity checks. */
|
|
if (overrideStack == NIL)
|
|
elog(ERROR, "bogus PopOverrideSearchPath call");
|
|
entry = (OverrideStackEntry *) linitial(overrideStack);
|
|
if (entry->nestLevel != GetCurrentTransactionNestLevel())
|
|
elog(ERROR, "bogus PopOverrideSearchPath call");
|
|
|
|
/* Pop the stack and free storage. */
|
|
overrideStack = list_delete_first(overrideStack);
|
|
list_free(entry->searchPath);
|
|
pfree(entry);
|
|
|
|
/* Activate the next level down. */
|
|
if (overrideStack)
|
|
{
|
|
entry = (OverrideStackEntry *) linitial(overrideStack);
|
|
activeSearchPath = entry->searchPath;
|
|
activeCreationNamespace = entry->creationNamespace;
|
|
activeTempCreationPending = false; /* XXX is this OK? */
|
|
}
|
|
else
|
|
{
|
|
/* If not baseSearchPathValid, this is useless but harmless */
|
|
activeSearchPath = baseSearchPath;
|
|
activeCreationNamespace = baseCreationNamespace;
|
|
activeTempCreationPending = baseTempCreationPending;
|
|
}
|
|
}
|
|
|
|
|
|
/*
|
|
* FindConversionByName - find a conversion by possibly qualified name
|
|
*/
|
|
Oid
|
|
FindConversionByName(List *name)
|
|
{
|
|
char *schemaname;
|
|
char *conversion_name;
|
|
Oid namespaceId;
|
|
Oid conoid;
|
|
ListCell *l;
|
|
|
|
/* deconstruct the name list */
|
|
DeconstructQualifiedName(name, &schemaname, &conversion_name);
|
|
|
|
if (schemaname)
|
|
{
|
|
/* use exact schema given */
|
|
namespaceId = LookupExplicitNamespace(schemaname);
|
|
return FindConversion(conversion_name, namespaceId);
|
|
}
|
|
else
|
|
{
|
|
/* search for it in search path */
|
|
recomputeNamespacePath();
|
|
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
conoid = FindConversion(conversion_name, namespaceId);
|
|
if (OidIsValid(conoid))
|
|
return conoid;
|
|
}
|
|
}
|
|
|
|
/* Not found in path */
|
|
return InvalidOid;
|
|
}
|
|
|
|
/*
|
|
* FindDefaultConversionProc - find default encoding conversion proc
|
|
*/
|
|
Oid
|
|
FindDefaultConversionProc(int4 for_encoding, int4 to_encoding)
|
|
{
|
|
Oid proc;
|
|
ListCell *l;
|
|
|
|
recomputeNamespacePath();
|
|
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not look in temp namespace */
|
|
|
|
proc = FindDefaultConversion(namespaceId, for_encoding, to_encoding);
|
|
if (OidIsValid(proc))
|
|
return proc;
|
|
}
|
|
|
|
/* Not found in path */
|
|
return InvalidOid;
|
|
}
|
|
|
|
/*
|
|
* recomputeNamespacePath - recompute path derived variables if needed.
|
|
*/
|
|
static void
|
|
recomputeNamespacePath(void)
|
|
{
|
|
Oid roleid = GetUserId();
|
|
char *rawname;
|
|
List *namelist;
|
|
List *oidlist;
|
|
List *newpath;
|
|
ListCell *l;
|
|
bool temp_missing;
|
|
Oid firstNS;
|
|
MemoryContext oldcxt;
|
|
|
|
/* Do nothing if an override search spec is active. */
|
|
if (overrideStack)
|
|
return;
|
|
|
|
/* Do nothing if path is already valid. */
|
|
if (baseSearchPathValid && namespaceUser == roleid)
|
|
return;
|
|
|
|
/* Need a modifiable copy of namespace_search_path string */
|
|
rawname = pstrdup(namespace_search_path);
|
|
|
|
/* Parse string into list of identifiers */
|
|
if (!SplitIdentifierString(rawname, ',', &namelist))
|
|
{
|
|
/* syntax error in name list */
|
|
/* this should not happen if GUC checked check_search_path */
|
|
elog(ERROR, "invalid list syntax");
|
|
}
|
|
|
|
/*
|
|
* Convert the list of names to a list of OIDs. If any names are not
|
|
* recognizable or we don't have read access, just leave them out of the
|
|
* list. (We can't raise an error, since the search_path setting has
|
|
* already been accepted.) Don't make duplicate entries, either.
|
|
*/
|
|
oidlist = NIL;
|
|
temp_missing = false;
|
|
foreach(l, namelist)
|
|
{
|
|
char *curname = (char *) lfirst(l);
|
|
Oid namespaceId;
|
|
|
|
if (strcmp(curname, "$user") == 0)
|
|
{
|
|
/* $user --- substitute namespace matching user name, if any */
|
|
HeapTuple tuple;
|
|
|
|
tuple = SearchSysCache(AUTHOID,
|
|
ObjectIdGetDatum(roleid),
|
|
0, 0, 0);
|
|
if (HeapTupleIsValid(tuple))
|
|
{
|
|
char *rname;
|
|
|
|
rname = NameStr(((Form_pg_authid) GETSTRUCT(tuple))->rolname);
|
|
namespaceId = GetSysCacheOid(NAMESPACENAME,
|
|
CStringGetDatum(rname),
|
|
0, 0, 0);
|
|
ReleaseSysCache(tuple);
|
|
if (OidIsValid(namespaceId) &&
|
|
!list_member_oid(oidlist, namespaceId) &&
|
|
pg_namespace_aclcheck(namespaceId, roleid,
|
|
ACL_USAGE) == ACLCHECK_OK)
|
|
oidlist = lappend_oid(oidlist, namespaceId);
|
|
}
|
|
}
|
|
else if (strcmp(curname, "pg_temp") == 0)
|
|
{
|
|
/* pg_temp --- substitute temp namespace, if any */
|
|
if (OidIsValid(myTempNamespace))
|
|
{
|
|
if (!list_member_oid(oidlist, myTempNamespace))
|
|
oidlist = lappend_oid(oidlist, myTempNamespace);
|
|
}
|
|
else
|
|
{
|
|
/* If it ought to be the creation namespace, set flag */
|
|
if (oidlist == NIL)
|
|
temp_missing = true;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
/* normal namespace reference */
|
|
namespaceId = GetSysCacheOid(NAMESPACENAME,
|
|
CStringGetDatum(curname),
|
|
0, 0, 0);
|
|
if (OidIsValid(namespaceId) &&
|
|
!list_member_oid(oidlist, namespaceId) &&
|
|
pg_namespace_aclcheck(namespaceId, roleid,
|
|
ACL_USAGE) == ACLCHECK_OK)
|
|
oidlist = lappend_oid(oidlist, namespaceId);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Remember the first member of the explicit list. (Note: this is
|
|
* nominally wrong if temp_missing, but we need it anyway to distinguish
|
|
* explicit from implicit mention of pg_catalog.)
|
|
*/
|
|
if (oidlist == NIL)
|
|
firstNS = InvalidOid;
|
|
else
|
|
firstNS = linitial_oid(oidlist);
|
|
|
|
/*
|
|
* Add any implicitly-searched namespaces to the list. Note these go on
|
|
* the front, not the back; also notice that we do not check USAGE
|
|
* permissions for these.
|
|
*/
|
|
if (!list_member_oid(oidlist, PG_CATALOG_NAMESPACE))
|
|
oidlist = lcons_oid(PG_CATALOG_NAMESPACE, oidlist);
|
|
|
|
if (OidIsValid(myTempNamespace) &&
|
|
!list_member_oid(oidlist, myTempNamespace))
|
|
oidlist = lcons_oid(myTempNamespace, oidlist);
|
|
|
|
/*
|
|
* Now that we've successfully built the new list of namespace OIDs, save
|
|
* it in permanent storage.
|
|
*/
|
|
oldcxt = MemoryContextSwitchTo(TopMemoryContext);
|
|
newpath = list_copy(oidlist);
|
|
MemoryContextSwitchTo(oldcxt);
|
|
|
|
/* Now safe to assign to state variables. */
|
|
list_free(baseSearchPath);
|
|
baseSearchPath = newpath;
|
|
baseCreationNamespace = firstNS;
|
|
baseTempCreationPending = temp_missing;
|
|
|
|
/* Mark the path valid. */
|
|
baseSearchPathValid = true;
|
|
namespaceUser = roleid;
|
|
|
|
/* And make it active. */
|
|
activeSearchPath = baseSearchPath;
|
|
activeCreationNamespace = baseCreationNamespace;
|
|
activeTempCreationPending = baseTempCreationPending;
|
|
|
|
/* Clean up. */
|
|
pfree(rawname);
|
|
list_free(namelist);
|
|
list_free(oidlist);
|
|
}
|
|
|
|
/*
|
|
* InitTempTableNamespace
|
|
* Initialize temp table namespace on first use in a particular backend
|
|
*/
|
|
static void
|
|
InitTempTableNamespace(void)
|
|
{
|
|
char namespaceName[NAMEDATALEN];
|
|
Oid namespaceId;
|
|
Oid toastspaceId;
|
|
|
|
Assert(!OidIsValid(myTempNamespace));
|
|
|
|
/*
|
|
* First, do permission check to see if we are authorized to make temp
|
|
* tables. We use a nonstandard error message here since "databasename:
|
|
* permission denied" might be a tad cryptic.
|
|
*
|
|
* Note that ACL_CREATE_TEMP rights are rechecked in pg_namespace_aclmask;
|
|
* that's necessary since current user ID could change during the session.
|
|
* But there's no need to make the namespace in the first place until a
|
|
* temp table creation request is made by someone with appropriate rights.
|
|
*/
|
|
if (pg_database_aclcheck(MyDatabaseId, GetUserId(),
|
|
ACL_CREATE_TEMP) != ACLCHECK_OK)
|
|
ereport(ERROR,
|
|
(errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
|
|
errmsg("permission denied to create temporary tables in database \"%s\"",
|
|
get_database_name(MyDatabaseId))));
|
|
|
|
snprintf(namespaceName, sizeof(namespaceName), "pg_temp_%d", MyBackendId);
|
|
|
|
namespaceId = GetSysCacheOid(NAMESPACENAME,
|
|
CStringGetDatum(namespaceName),
|
|
0, 0, 0);
|
|
if (!OidIsValid(namespaceId))
|
|
{
|
|
/*
|
|
* First use of this temp namespace in this database; create it. The
|
|
* temp namespaces are always owned by the superuser. We leave their
|
|
* permissions at default --- i.e., no access except to superuser ---
|
|
* to ensure that unprivileged users can't peek at other backends'
|
|
* temp tables. This works because the places that access the temp
|
|
* namespace for my own backend skip permissions checks on it.
|
|
*/
|
|
namespaceId = NamespaceCreate(namespaceName, BOOTSTRAP_SUPERUSERID);
|
|
/* Advance command counter to make namespace visible */
|
|
CommandCounterIncrement();
|
|
}
|
|
else
|
|
{
|
|
/*
|
|
* If the namespace already exists, clean it out (in case the former
|
|
* owner crashed without doing so).
|
|
*/
|
|
RemoveTempRelations(namespaceId);
|
|
}
|
|
|
|
/*
|
|
* If the corresponding toast-table namespace doesn't exist yet, create it.
|
|
* (We assume there is no need to clean it out if it does exist, since
|
|
* dropping a parent table should make its toast table go away.)
|
|
*/
|
|
snprintf(namespaceName, sizeof(namespaceName), "pg_toast_temp_%d",
|
|
MyBackendId);
|
|
|
|
toastspaceId = GetSysCacheOid(NAMESPACENAME,
|
|
CStringGetDatum(namespaceName),
|
|
0, 0, 0);
|
|
if (!OidIsValid(toastspaceId))
|
|
{
|
|
toastspaceId = NamespaceCreate(namespaceName, BOOTSTRAP_SUPERUSERID);
|
|
/* Advance command counter to make namespace visible */
|
|
CommandCounterIncrement();
|
|
}
|
|
|
|
/*
|
|
* Okay, we've prepared the temp namespace ... but it's not committed yet,
|
|
* so all our work could be undone by transaction rollback. Set flag for
|
|
* AtEOXact_Namespace to know what to do.
|
|
*/
|
|
myTempNamespace = namespaceId;
|
|
myTempToastNamespace = toastspaceId;
|
|
|
|
/* It should not be done already. */
|
|
AssertState(myTempNamespaceSubID == InvalidSubTransactionId);
|
|
myTempNamespaceSubID = GetCurrentSubTransactionId();
|
|
|
|
baseSearchPathValid = false; /* need to rebuild list */
|
|
}
|
|
|
|
/*
|
|
* End-of-transaction cleanup for namespaces.
|
|
*/
|
|
void
|
|
AtEOXact_Namespace(bool isCommit)
|
|
{
|
|
/*
|
|
* If we abort the transaction in which a temp namespace was selected,
|
|
* we'll have to do any creation or cleanout work over again. So, just
|
|
* forget the namespace entirely until next time. On the other hand, if
|
|
* we commit then register an exit callback to clean out the temp tables
|
|
* at backend shutdown. (We only want to register the callback once per
|
|
* session, so this is a good place to do it.)
|
|
*/
|
|
if (myTempNamespaceSubID != InvalidSubTransactionId)
|
|
{
|
|
if (isCommit)
|
|
on_shmem_exit(RemoveTempRelationsCallback, 0);
|
|
else
|
|
{
|
|
myTempNamespace = InvalidOid;
|
|
myTempToastNamespace = InvalidOid;
|
|
baseSearchPathValid = false; /* need to rebuild list */
|
|
}
|
|
myTempNamespaceSubID = InvalidSubTransactionId;
|
|
}
|
|
|
|
/*
|
|
* Clean up if someone failed to do PopOverrideSearchPath
|
|
*/
|
|
if (overrideStack)
|
|
{
|
|
if (isCommit)
|
|
elog(WARNING, "leaked override search path");
|
|
while (overrideStack)
|
|
{
|
|
OverrideStackEntry *entry;
|
|
|
|
entry = (OverrideStackEntry *) linitial(overrideStack);
|
|
overrideStack = list_delete_first(overrideStack);
|
|
list_free(entry->searchPath);
|
|
pfree(entry);
|
|
}
|
|
/* If not baseSearchPathValid, this is useless but harmless */
|
|
activeSearchPath = baseSearchPath;
|
|
activeCreationNamespace = baseCreationNamespace;
|
|
activeTempCreationPending = baseTempCreationPending;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* AtEOSubXact_Namespace
|
|
*
|
|
* At subtransaction commit, propagate the temp-namespace-creation
|
|
* flag to the parent subtransaction.
|
|
*
|
|
* At subtransaction abort, forget the flag if we set it up.
|
|
*/
|
|
void
|
|
AtEOSubXact_Namespace(bool isCommit, SubTransactionId mySubid,
|
|
SubTransactionId parentSubid)
|
|
{
|
|
OverrideStackEntry *entry;
|
|
|
|
if (myTempNamespaceSubID == mySubid)
|
|
{
|
|
if (isCommit)
|
|
myTempNamespaceSubID = parentSubid;
|
|
else
|
|
{
|
|
myTempNamespaceSubID = InvalidSubTransactionId;
|
|
/* TEMP namespace creation failed, so reset state */
|
|
myTempNamespace = InvalidOid;
|
|
myTempToastNamespace = InvalidOid;
|
|
baseSearchPathValid = false; /* need to rebuild list */
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Clean up if someone failed to do PopOverrideSearchPath
|
|
*/
|
|
while (overrideStack)
|
|
{
|
|
entry = (OverrideStackEntry *) linitial(overrideStack);
|
|
if (entry->nestLevel < GetCurrentTransactionNestLevel())
|
|
break;
|
|
if (isCommit)
|
|
elog(WARNING, "leaked override search path");
|
|
overrideStack = list_delete_first(overrideStack);
|
|
list_free(entry->searchPath);
|
|
pfree(entry);
|
|
}
|
|
|
|
/* Activate the next level down. */
|
|
if (overrideStack)
|
|
{
|
|
entry = (OverrideStackEntry *) linitial(overrideStack);
|
|
activeSearchPath = entry->searchPath;
|
|
activeCreationNamespace = entry->creationNamespace;
|
|
activeTempCreationPending = false; /* XXX is this OK? */
|
|
}
|
|
else
|
|
{
|
|
/* If not baseSearchPathValid, this is useless but harmless */
|
|
activeSearchPath = baseSearchPath;
|
|
activeCreationNamespace = baseCreationNamespace;
|
|
activeTempCreationPending = baseTempCreationPending;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Remove all relations in the specified temp namespace.
|
|
*
|
|
* This is called at backend shutdown (if we made any temp relations).
|
|
* It is also called when we begin using a pre-existing temp namespace,
|
|
* in order to clean out any relations that might have been created by
|
|
* a crashed backend.
|
|
*/
|
|
static void
|
|
RemoveTempRelations(Oid tempNamespaceId)
|
|
{
|
|
ObjectAddress object;
|
|
|
|
/*
|
|
* We want to get rid of everything in the target namespace, but not the
|
|
* namespace itself (deleting it only to recreate it later would be a
|
|
* waste of cycles). We do this by finding everything that has a
|
|
* dependency on the namespace.
|
|
*/
|
|
object.classId = NamespaceRelationId;
|
|
object.objectId = tempNamespaceId;
|
|
object.objectSubId = 0;
|
|
|
|
deleteWhatDependsOn(&object, false);
|
|
}
|
|
|
|
/*
|
|
* Callback to remove temp relations at backend exit.
|
|
*/
|
|
static void
|
|
RemoveTempRelationsCallback(int code, Datum arg)
|
|
{
|
|
if (OidIsValid(myTempNamespace)) /* should always be true */
|
|
{
|
|
/* Need to ensure we have a usable transaction. */
|
|
AbortOutOfAnyTransaction();
|
|
StartTransactionCommand();
|
|
|
|
RemoveTempRelations(myTempNamespace);
|
|
|
|
CommitTransactionCommand();
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Remove all temp tables from the temporary namespace.
|
|
*/
|
|
void
|
|
ResetTempTableNamespace(void)
|
|
{
|
|
if (OidIsValid(myTempNamespace))
|
|
RemoveTempRelations(myTempNamespace);
|
|
}
|
|
|
|
|
|
/*
|
|
* Routines for handling the GUC variable 'search_path'.
|
|
*/
|
|
|
|
/* assign_hook: validate new search_path, do extra actions as needed */
|
|
const char *
|
|
assign_search_path(const char *newval, bool doit, GucSource source)
|
|
{
|
|
char *rawname;
|
|
List *namelist;
|
|
ListCell *l;
|
|
|
|
/* Need a modifiable copy of string */
|
|
rawname = pstrdup(newval);
|
|
|
|
/* Parse string into list of identifiers */
|
|
if (!SplitIdentifierString(rawname, ',', &namelist))
|
|
{
|
|
/* syntax error in name list */
|
|
pfree(rawname);
|
|
list_free(namelist);
|
|
return NULL;
|
|
}
|
|
|
|
/*
|
|
* If we aren't inside a transaction, we cannot do database access so
|
|
* cannot verify the individual names. Must accept the list on faith.
|
|
*/
|
|
if (source >= PGC_S_INTERACTIVE && IsTransactionState())
|
|
{
|
|
/*
|
|
* Verify that all the names are either valid namespace names or
|
|
* "$user" or "pg_temp". We do not require $user to correspond to a
|
|
* valid namespace, and pg_temp might not exist yet. We do not check
|
|
* for USAGE rights, either; should we?
|
|
*
|
|
* When source == PGC_S_TEST, we are checking the argument of an ALTER
|
|
* DATABASE SET or ALTER USER SET command. It could be that the
|
|
* intended use of the search path is for some other database, so we
|
|
* should not error out if it mentions schemas not present in the
|
|
* current database. We reduce the message to NOTICE instead.
|
|
*/
|
|
foreach(l, namelist)
|
|
{
|
|
char *curname = (char *) lfirst(l);
|
|
|
|
if (strcmp(curname, "$user") == 0)
|
|
continue;
|
|
if (strcmp(curname, "pg_temp") == 0)
|
|
continue;
|
|
if (!SearchSysCacheExists(NAMESPACENAME,
|
|
CStringGetDatum(curname),
|
|
0, 0, 0))
|
|
ereport((source == PGC_S_TEST) ? NOTICE : ERROR,
|
|
(errcode(ERRCODE_UNDEFINED_SCHEMA),
|
|
errmsg("schema \"%s\" does not exist", curname)));
|
|
}
|
|
}
|
|
|
|
pfree(rawname);
|
|
list_free(namelist);
|
|
|
|
/*
|
|
* We mark the path as needing recomputation, but don't do anything until
|
|
* it's needed. This avoids trying to do database access during GUC
|
|
* initialization.
|
|
*/
|
|
if (doit)
|
|
baseSearchPathValid = false;
|
|
|
|
return newval;
|
|
}
|
|
|
|
/*
|
|
* InitializeSearchPath: initialize module during InitPostgres.
|
|
*
|
|
* This is called after we are up enough to be able to do catalog lookups.
|
|
*/
|
|
void
|
|
InitializeSearchPath(void)
|
|
{
|
|
if (IsBootstrapProcessingMode())
|
|
{
|
|
/*
|
|
* In bootstrap mode, the search path must be 'pg_catalog' so that
|
|
* tables are created in the proper namespace; ignore the GUC setting.
|
|
*/
|
|
MemoryContext oldcxt;
|
|
|
|
oldcxt = MemoryContextSwitchTo(TopMemoryContext);
|
|
baseSearchPath = list_make1_oid(PG_CATALOG_NAMESPACE);
|
|
MemoryContextSwitchTo(oldcxt);
|
|
baseCreationNamespace = PG_CATALOG_NAMESPACE;
|
|
baseTempCreationPending = false;
|
|
baseSearchPathValid = true;
|
|
namespaceUser = GetUserId();
|
|
activeSearchPath = baseSearchPath;
|
|
activeCreationNamespace = baseCreationNamespace;
|
|
activeTempCreationPending = baseTempCreationPending;
|
|
}
|
|
else
|
|
{
|
|
/*
|
|
* In normal mode, arrange for a callback on any syscache invalidation
|
|
* of pg_namespace rows.
|
|
*/
|
|
CacheRegisterSyscacheCallback(NAMESPACEOID,
|
|
NamespaceCallback,
|
|
(Datum) 0);
|
|
/* Force search path to be recomputed on next use */
|
|
baseSearchPathValid = false;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* NamespaceCallback
|
|
* Syscache inval callback function
|
|
*/
|
|
static void
|
|
NamespaceCallback(Datum arg, int cacheid, ItemPointer tuplePtr)
|
|
{
|
|
/* Force search path to be recomputed on next use */
|
|
baseSearchPathValid = false;
|
|
}
|
|
|
|
/*
|
|
* Fetch the active search path. The return value is a palloc'ed list
|
|
* of OIDs; the caller is responsible for freeing this storage as
|
|
* appropriate.
|
|
*
|
|
* The returned list includes the implicitly-prepended namespaces only if
|
|
* includeImplicit is true.
|
|
*
|
|
* Note: calling this may result in a CommandCounterIncrement operation,
|
|
* if we have to create or clean out the temp namespace.
|
|
*/
|
|
List *
|
|
fetch_search_path(bool includeImplicit)
|
|
{
|
|
List *result;
|
|
|
|
recomputeNamespacePath();
|
|
|
|
/*
|
|
* If the temp namespace should be first, force it to exist. This is so
|
|
* that callers can trust the result to reflect the actual default
|
|
* creation namespace. It's a bit bogus to do this here, since
|
|
* current_schema() is supposedly a stable function without side-effects,
|
|
* but the alternatives seem worse.
|
|
*/
|
|
if (activeTempCreationPending)
|
|
{
|
|
InitTempTableNamespace();
|
|
recomputeNamespacePath();
|
|
}
|
|
|
|
result = list_copy(activeSearchPath);
|
|
if (!includeImplicit)
|
|
{
|
|
while (result && linitial_oid(result) != activeCreationNamespace)
|
|
result = list_delete_first(result);
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
/*
|
|
* Fetch the active search path into a caller-allocated array of OIDs.
|
|
* Returns the number of path entries. (If this is more than sarray_len,
|
|
* then the data didn't fit and is not all stored.)
|
|
*
|
|
* The returned list always includes the implicitly-prepended namespaces,
|
|
* but never includes the temp namespace. (This is suitable for existing
|
|
* users, which would want to ignore the temp namespace anyway.) This
|
|
* definition allows us to not worry about initializing the temp namespace.
|
|
*/
|
|
int
|
|
fetch_search_path_array(Oid *sarray, int sarray_len)
|
|
{
|
|
int count = 0;
|
|
ListCell *l;
|
|
|
|
recomputeNamespacePath();
|
|
|
|
foreach(l, activeSearchPath)
|
|
{
|
|
Oid namespaceId = lfirst_oid(l);
|
|
|
|
if (namespaceId == myTempNamespace)
|
|
continue; /* do not include temp namespace */
|
|
|
|
if (count < sarray_len)
|
|
sarray[count] = namespaceId;
|
|
count++;
|
|
}
|
|
|
|
return count;
|
|
}
|
|
|
|
|
|
/*
|
|
* Export the FooIsVisible functions as SQL-callable functions.
|
|
*/
|
|
|
|
Datum
|
|
pg_table_is_visible(PG_FUNCTION_ARGS)
|
|
{
|
|
Oid oid = PG_GETARG_OID(0);
|
|
|
|
PG_RETURN_BOOL(RelationIsVisible(oid));
|
|
}
|
|
|
|
Datum
|
|
pg_type_is_visible(PG_FUNCTION_ARGS)
|
|
{
|
|
Oid oid = PG_GETARG_OID(0);
|
|
|
|
PG_RETURN_BOOL(TypeIsVisible(oid));
|
|
}
|
|
|
|
Datum
|
|
pg_function_is_visible(PG_FUNCTION_ARGS)
|
|
{
|
|
Oid oid = PG_GETARG_OID(0);
|
|
|
|
PG_RETURN_BOOL(FunctionIsVisible(oid));
|
|
}
|
|
|
|
Datum
|
|
pg_operator_is_visible(PG_FUNCTION_ARGS)
|
|
{
|
|
Oid oid = PG_GETARG_OID(0);
|
|
|
|
PG_RETURN_BOOL(OperatorIsVisible(oid));
|
|
}
|
|
|
|
Datum
|
|
pg_opclass_is_visible(PG_FUNCTION_ARGS)
|
|
{
|
|
Oid oid = PG_GETARG_OID(0);
|
|
|
|
PG_RETURN_BOOL(OpclassIsVisible(oid));
|
|
}
|
|
|
|
Datum
|
|
pg_conversion_is_visible(PG_FUNCTION_ARGS)
|
|
{
|
|
Oid oid = PG_GETARG_OID(0);
|
|
|
|
PG_RETURN_BOOL(ConversionIsVisible(oid));
|
|
}
|
|
|
|
Datum
|
|
pg_ts_parser_is_visible(PG_FUNCTION_ARGS)
|
|
{
|
|
Oid oid = PG_GETARG_OID(0);
|
|
|
|
PG_RETURN_BOOL(TSParserIsVisible(oid));
|
|
}
|
|
|
|
Datum
|
|
pg_ts_dict_is_visible(PG_FUNCTION_ARGS)
|
|
{
|
|
Oid oid = PG_GETARG_OID(0);
|
|
|
|
PG_RETURN_BOOL(TSDictionaryIsVisible(oid));
|
|
}
|
|
|
|
Datum
|
|
pg_ts_template_is_visible(PG_FUNCTION_ARGS)
|
|
{
|
|
Oid oid = PG_GETARG_OID(0);
|
|
|
|
PG_RETURN_BOOL(TSTemplateIsVisible(oid));
|
|
}
|
|
|
|
Datum
|
|
pg_ts_config_is_visible(PG_FUNCTION_ARGS)
|
|
{
|
|
Oid oid = PG_GETARG_OID(0);
|
|
|
|
PG_RETURN_BOOL(TSConfigIsVisible(oid));
|
|
}
|
|
|
|
Datum
|
|
pg_my_temp_schema(PG_FUNCTION_ARGS)
|
|
{
|
|
PG_RETURN_OID(myTempNamespace);
|
|
}
|
|
|
|
Datum
|
|
pg_is_other_temp_schema(PG_FUNCTION_ARGS)
|
|
{
|
|
Oid oid = PG_GETARG_OID(0);
|
|
|
|
PG_RETURN_BOOL(isOtherTempNamespace(oid));
|
|
}
|