{
relname = args2[0];
- /*
- * For 'R'estrict action we construct SELECT query - SELECT 1
- * FROM _referencing_relation_ WHERE Fkey1 = $1 [AND Fkey2 =
- * $2 [...]] - to check is tuple referenced or not.
+ /*---------
+ * For 'R'estrict action we construct SELECT query:
+ *
+ * SELECT 1
+ * FROM _referencing_relation_
+ * WHERE Fkey1 = $1 [AND Fkey2 = $2 [...]]
+ *
+ * to check is tuple referenced or not.
+ *---------
*/
if (action == 'r')
sprintf(sql, "select 1 from %s where ", relname);
- /*
- * For 'C'ascade action we construct DELETE query - DELETE
- * FROM _referencing_relation_ WHERE Fkey1 = $1 [AND Fkey2 =
- * $2 [...]] - to delete all referencing tuples.
+ /*---------
+ * For 'C'ascade action we construct DELETE query
+ *
+ * DELETE
+ * FROM _referencing_relation_
+ * WHERE Fkey1 = $1 [AND Fkey2 = $2 [...]]
+ *
+ * to delete all referencing tuples.
+ *---------
*/
/*
for (i = 0; i < s->numberOfKeys; i++)
{
- /*
+ /*----------
* s->keyData[i].sk_procedure =
- * index_getprocid(s->relation, 1, GIST_CONSISTENT_PROC);
+ * index_getprocid(s->relation, 1, GIST_CONSISTENT_PROC);
+ *----------
*/
s->keyData[i].sk_procedure
= RelationGetGISTStrategy(s->relation, s->keyData[i].sk_attno,
while (offnum > maxoff)
{
- /*
- * either this page is empty (maxoff ==
- * InvalidOffsetNumber) or we ran off the end.
+ /*--------
+ * either this page is empty
+ * (maxoff == InvalidOffsetNumber)
+ * or we ran off the end.
+ *--------
*/
_hash_readnext(rel, &buf, &page, &opaque);
if (BufferIsInvalid(buf))
while (offnum < FirstOffsetNumber)
{
- /*
- * either this page is empty (offnum ==
- * InvalidOffsetNumber) or we ran off the end.
+ /*---------
+ * either this page is empty
+ * (offnum == InvalidOffsetNumber)
+ * or we ran off the end.
+ *---------
*/
_hash_readprev(rel, &buf, &page, &opaque);
if (BufferIsInvalid(buf))
int32 biggest_size = MAXALIGN(sizeof(varattrib));
Datum old_value;
- /*
- * Search for the biggest yet inlined attribute with attstorage =
- * 'x' or 'e'
+ /*------
+ * Search for the biggest yet inlined attribute with
+ * attstorage equals 'x' or 'e'
+ *------
*/
for (i = 0; i < numAttrs; i++)
{
int32 biggest_size = MAXALIGN(sizeof(varattrib));
Datum old_value;
- /*
- * Search for the biggest yet inlined attribute with attstorage =
- * 'm'
+ /*--------
+ * Search for the biggest yet inlined attribute with
+ * attstorage = 'm'
+ *--------
*/
for (i = 0; i < numAttrs; i++)
{
/*
* At this point we are positioned at the first item >= scan key, or
- * possibly at the end of a page on which all the existing items are <
- * scan key and we know that everything on later pages is >= scan key.
+ * possibly at the end of a page on which all the existing items are
+ * greater than the scan key and we know that everything on later pages
+ * is less than or equal to scan key.
+ *
* We could step forward in the latter case, but that'd be a waste of
* time if we want to scan backwards. So, it's now time to examine
* the scan strategy to find the exact place to start the scan.
if (DatumGetBool(test))
xform[j].sk_argument = cur->sk_argument;
else if (j == (BTEqualStrategyNumber - 1))
- so->qual_ok = false; /* key == a && key == b, but a !=
- * b */
+ so->qual_ok = false;
+ /* key == a && key == b, but a != b */
}
else
{
eval_as_new_xact(char *query)
{
- /*
+ /*------
* WARNING! do not uncomment the following lines WARNING!
- * CommitTransactionCommand(); StartTransactionCommand();
+ *
+ * CommitTransactionCommand();
+ * StartTransactionCommand();
+ *------
*/
CommandCounterIncrement();
pg_exec_query(query);
ScanKeyEntryInitialize(&scankeys[0], 0x0, Anum_pg_attrdef_adrelid,
F_OIDEQ, ObjectIdGetDatum(myrelid));
- /*
+ /*--------
* Oops pg_attrdef doesn't have (adrelid,adnum) index
- * ScanKeyEntryInitialize(&scankeys[1], 0x0, Anum_pg_attrdef_adnum,
- * F_INT2EQ, Int16GetDatum(attnum)); sysscan =
- * systable_beginscan(adrel, AttrDefaultIndex, 2, scankeys);
+ *
+ * ScanKeyEntryInitialize(&scankeys[1], 0x0, Anum_pg_attrdef_adnum,
+ * F_INT2EQ, Int16GetDatum(attnum));
+ * sysscan = systable_beginscan(adrel, AttrDefaultIndex, 2, scankeys);
+ *--------
*/
sysscan = systable_beginscan(adrel, AttrDefaultIndex, 1, scankeys);
while (HeapTupleIsValid(tup = systable_getnext(sysscan)))
* and another array that holds the isDone status for each targetlist
* item. The isDone status is needed so that we can iterate,
* generating multiple tuples, when one or more tlist items return
- * sets. (We expect the caller to call us again if we return *isDone
- * = ExprMultipleResult.)
+ * sets. (We expect the caller to call us again if we return:
+ *
+ * isDone = ExprMultipleResult.)
*/
if (nodomains > NPREALLOCDOMAINS)
{
* tuple in the offset region before we can return NULL.
* Otherwise we won't be correctly aligned to start going forward
* again. So, although you might think we can quit when position
- * = offset + 1, we have to fetch a subplan tuple first, and then
- * exit when position = offset.
+ * equals offset + 1, we have to fetch a subplan tuple first, and
+ * then exit when position = offset.
*/
if (ScanDirectionIsForward(direction))
{
break;
}
- /*
+ /*-----------
* ok, the compare clause failed so we test if the keys are
- * equal... if key1 != key2, we return false. otherwise key1 =
- * key2 so we move on to the next pair of keys.
+ * equal... if key1 != key2, we return false. otherwise
+ * key1 = key2 so we move on to the next pair of keys.
+ *-----------
*/
const_value = ExecEvalExpr((Node *) lfirst(eqclause),
econtext,
else
{
- /*
- * We have found two similar clauses, such as x < y AND x
- * < z. Keep only the more restrictive one.
+ /*------
+ * We have found two similar clauses, such as
+ * x < y AND x < z.
+ * Keep only the more restrictive one.
+ *------
*/
if (rqelem->lobound > s2)
rqelem->lobound = s2;
else
{
- /*
- * We have found two similar clauses, such as x > y AND x
- * > z. Keep only the more restrictive one.
+ /*------
+ * We have found two similar clauses, such as
+ * x > y AND x > z.
+ * Keep only the more restrictive one.
+ *------
*/
if (rqelem->hibound > s2)
rqelem->hibound = s2;
expr = make_opclause(op, leftop, (Var *) con);
result = makeList1(expr);
- /*
- * If we can create a string larger than the prefix, we can say "x <
- * greaterstr".
+ /*-------
+ * If we can create a string larger than the prefix, we can say
+ * "x < greaterstr".
+ *-------
*/
greaterstr = make_greater_string(prefix, datatype);
if (greaterstr)
#ifdef NOT_USED
- /*
+ /*---------
* on retrieve to class.attribute do instead nothing is converted to
- * 'on retrieve to class.attribute do instead retrieve (attribute =
- * NULL)' --- this is also a terrible hack that works well -- glass
+ * 'on retrieve to class.attribute do instead:
+ *
+ * retrieve (attribute = NULL)'
+ *
+ * this is also a terrible hack that works well -- glass
+ *---------
*/
if (is_instead && !*action && eslot_string && event_type == CMD_SELECT)
{
* and entering the semop() call. If a cancel/die interrupt occurs in
* that window, we would fail to notice it until after we acquire the
* lock (or get another interrupt to escape the semop()). We can
- * avoid this problem by temporarily setting ImmediateInterruptOK =
+ * avoid this problem by temporarily setting ImmediateInterruptOK to
* true before we do CHECK_FOR_INTERRUPTS; then, a die() interrupt in
* this interval will execute directly. However, there is a huge
* pitfall: there is another window of a few instructions after the
xid < FirstTransactionId || xid >= snapshot->xmax)
{
- /*
- * Seems that there is no sense to store xid >=
- * snapshot->xmax (what we got from ReadNewTransactionId
- * above) in snapshot->xip - we just assume that all xacts
+ /*--------
+ * Seems that there is no sense to store
+ * xid >= snapshot->xmax
+ * (what we got from ReadNewTransactionId above)
+ * in snapshot->xip. We just assume that all xacts
* with such xid-s are running and may be ignored.
+ *--------
*/
continue;
}
else if (tmfc->yy)
{
- /*
- * 2-digit year: '00' ... '69' = 2000 ... 2069 '70' ... '99' =
- * 1970 ... 1999
+ /*---------
+ * 2-digit year:
+ * '00' ... '69' = 2000 ... 2069
+ * '70' ... '99' = 1970 ... 1999
+ *---------
*/
tm->tm_year = tmfc->yy;
else if (tmfc->yyy)
{
- /*
- * 3-digit year: '100' ... '999' = 1100 ... 1999 '000' ... '099' =
- * 2000 ... 2099
+ /*---------
+ * 3-digit year:
+ * '100' ... '999' = 1100 ... 1999
+ * '000' ... '099' = 2000 ... 2099
+ *---------
*/
tm->tm_year = tmfc->yyy;
Int32GetDatum(SEL_CONSTANT | SEL_RIGHT)));
pfree(DatumGetPointer(prefixcon));
- /*
- * If we can create a string larger than the prefix, say "x <
- * greaterstr".
+ /*-------
+ * If we can create a string larger than the prefix, say
+ * "x < greaterstr".
+ *-------
*/
greaterstr = make_greater_string(prefix, datatype);
if (greaterstr)
/*
* VACUUM ANALYZE has not been run for this table. Produce an estimate
- * = 1/numtuples. This may produce unreasonably small estimates for
+ * of 1/numtuples. This may produce unreasonably small estimates for
* large tables, so limit the estimate to no less than min_estimate.
*/
dispersion = 1.0 / (double) ntuples;
* the descriptors, nail them into cache so we never lose them.
*/
- /*
- * Removed the following ProcessingMode change -- inoue At this point
- * 1) Catalog Cache isn't initialized 2) Relation Cache for the
- * following critical indexes aren't built oldmode =
- * GetProcessingMode(); SetProcessingMode(BootstrapProcessing);
+ /*---------
+ * Removed the following ProcessingMode change -- inoue
+ * At this point
+ * 1) Catalog Cache isn't initialized
+ * 2) Relation Cache for the following critical indexes aren't built
+ * oldmode = GetProcessingMode();
+ * SetProcessingMode(BootstrapProcessing);
+ *---------
*/
bi.infotype = INFO_RELNAME;
* kind of tuple we are sorting from the routines that don't need to
* know it. They are set up by the tuplesort_begin_xxx routines.
*
- * Function to compare two tuples; result is per qsort() convention, ie,
- * <0, 0, >0 according as a<b, a=b, a>b.
+ * Function to compare two tuples; result is per qsort() convention,
+ * ie:
+ *
+ * <0, 0, >0 according as a<b, a=b, a>b.
*/
int (*comparetup) (Tuplesortstate *state, const void *a, const void *b);
qry += loc + 1;
isEnd = (strcmp(AH->pgCopyBuf->data, "\\.\n") == 0);
- /*
- * fprintf(stderr, "Sending '%s' via COPY (at end =
- * %d)\n\n", AH->pgCopyBuf->data, isEnd);
+ /*---------
+ * fprintf(stderr, "Sending '%s' via
+ * COPY (at end = %d)\n\n", AH->pgCopyBuf->data, isEnd);
+ *---------
*/
if (PQputline(AH->connection, AH->pgCopyBuf->data) != 0)
/*
* The logic we use for restoring sequences is as follows: - Add a
* basic CREATE SEQUENCE statement (use last_val for start if called
- * == 'f', else use min_val for start_val). - Add a 'SETVAL(seq,
- * last_val, iscalled)' at restore-time iff we load data
+ * with 'f', else use min_val for start_val).
+ *
+ * Add a 'SETVAL(seq, last_val, iscalled)' at restore-time iff
+ * we load data
*/
if (!dataOnly)
{
char *oid;
char *oprname;
- char *oprkind; /* "b" = binary, "l" = left unary, "r" =
- * right unary */
+ char *oprkind; /*----------
+ * b = binary,
+ * l = left unary
+ * r = right unary
+ *----------
+ */
char *oprcode; /* operator function name */
char *oprleft; /* left operand type */
char *oprright; /* right operand type */
* be a "real" array type; some ordinary fixed-length types can also
* be subscripted (e.g., oidvector). Variable-length types can *not*
* be turned into pseudo-arrays like that. Hence, the way to determine
- * whether a type is a "true" array type is typelem != 0 and typlen <
- * 0.
+ * whether a type is a "true" array type is if:
+ *
+ * typelem != 0 and typlen < 0.
*/
Oid typelem;
regproc typinput;
typedef struct AlterTableStmt
{
NodeTag type;
- char subtype; /* A = add column, T = alter column, D =
- * drop column, C = add constraint, X =
- * drop constraint, E = add toast table, U
- * = change owner */
+ char subtype; /*------------
+ * A = add column
+ * T = alter column
+ * D = drop column
+ * C = add constraint
+ * X = drop constraint
+ * E = add toast table,
+ * U = change owner
+ *------------
+ */
char *relname; /* table to work on */
InhOption inhOpt; /* recursively act on children? */
char *name; /* column or constraint name to act on, or
if (strncmp(dbname + offset, "postgresql://", strlen("postgresql://")) == 0)
{
- /*
+ /*------
* new style:
- * <tcp|unix>:postgresql://server[:port|:/unixsocket/path:][/db
- * name][?options]
+ * <tcp|unix>:postgresql://server[:port|:/unixsocket/path:]
+ * [/db name][?options]
+ *------
*/
offset += strlen("postgresql://");
if (strncmp(conn->dbName + offset, "postgresql://", strlen("postgresql://")) == 0)
{
- /*
+ /*-------
* new style:
- * <tcp|unix>:postgresql://server[:port|:/unixsocket/path:][/db
- * name][?options]
+ * <tcp|unix>:postgresql://server[:port|:/unixsocket/path:]
+ * [/db name][?options]
+ *-------
*/
offset += strlen("postgresql://");
set_tuplefield_string(&row->tuple[5], field_type_name);
- /*
+ /*----------
* Some Notes about Postgres Data Types:
*
* VARCHAR - the length is stored in the pg_attribute.atttypmod field
* BPCHAR - the length is also stored as varchar is
*
- * NUMERIC - the scale is stored in atttypmod as follows: precision =
- * ((atttypmod - VARHDRSZ) >> 16) & 0xffff scale = (atttypmod
- * - VARHDRSZ) & 0xffff
+ * NUMERIC - the scale is stored in atttypmod as follows:
*
+ * precision =((atttypmod - VARHDRSZ) >> 16) & 0xffff
+ * scale = (atttypmod - VARHDRSZ) & 0xffff
*
+ *----------
*/
qlog("SQLColumns: table='%s',field_name='%s',type=%d,sqltype=%d,name='%s'\n",
table_name, field_name, field_type, pgtype_to_sqltype, field_type_name);
stmt->options.scroll_concurrency = vParam;
break;
- /*
- * if (globals.lie) { if (conn)
- * conn->stmtOptions.scroll_concurrency = vParam; if (stmt)
- * stmt->options.scroll_concurrency = vParam; } else {
- *
- * if (conn) conn->stmtOptions.scroll_concurrency =
- * SQL_CONCUR_READ_ONLY; if (stmt)
- * stmt->options.scroll_concurrency = SQL_CONCUR_READ_ONLY;
+ /*----------
+ * if (globals.lie)
+ * {
+ * if (conn)
+ * conn->stmtOptions.scroll_concurrency = vParam;
+ * if (stmt)
+ * stmt->options.scroll_concurrency = vParam;
+ * } else {
+ * if (conn)
+ * conn->stmtOptions.scroll_concurrency =
+ * SQL_CONCUR_READ_ONLY;
+ * if (stmt)
+ * stmt->options.scroll_concurrency =
+ * SQL_CONCUR_READ_ONLY;
*
- * if (vParam != SQL_CONCUR_READ_ONLY) changed = TRUE; } break;
+ * if (vParam != SQL_CONCUR_READ_ONLY)
+ * changed = TRUE;
+ * }
+ * break;
+ * }
+ *----------
*/
case SQL_CURSOR_TYPE:
projects / users / bernd / postgres.git / commitdiff