mirror of
https://git.postgresql.org/git/postgresql.git
synced 2026-02-12 01:18:35 +08:00
Another pgindent run. Sorry folks.
This commit is contained in:
Bruce Momjian
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: hash.h,v 1.23 1999/05/25 16:13:27 momjian Exp $
|
||||
* $Id: hash.h,v 1.24 1999/05/25 22:42:30 momjian Exp $
|
||||
*
|
||||
* NOTES
|
||||
* modeled after Margo Seltzer's hash implementation for unix.
|
||||
@ -265,7 +265,7 @@ extern void hashdelete(Relation rel, ItemPointer tid);
|
||||
/* hashfunc.c */
|
||||
extern uint32 hashint2(int16 key);
|
||||
extern uint32 hashint4(uint32 key);
|
||||
extern uint32 hashint8(int64 * key);
|
||||
extern uint32 hashint8(int64 *key);
|
||||
extern uint32 hashfloat4(float32 keyp);
|
||||
extern uint32 hashfloat8(float64 keyp);
|
||||
extern uint32 hashoid(Oid key);
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: htup.h,v 1.15 1999/05/25 16:13:31 momjian Exp $
|
||||
* $Id: htup.h,v 1.16 1999/05/25 22:42:32 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -48,7 +48,7 @@ typedef struct HeapTupleHeaderData
|
||||
/* bit map of domains */
|
||||
|
||||
/* MORE DATA FOLLOWS AT END OF STRUCT */
|
||||
} HeapTupleHeaderData;
|
||||
} HeapTupleHeaderData;
|
||||
|
||||
typedef HeapTupleHeaderData *HeapTupleHeader;
|
||||
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: printtup.h,v 1.9 1999/05/25 16:13:33 momjian Exp $
|
||||
* $Id: printtup.h,v 1.10 1999/05/25 22:42:32 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -18,13 +18,13 @@
|
||||
extern DestReceiver *printtup_create_DR(void);
|
||||
extern void showatts(char *name, TupleDesc attinfo);
|
||||
extern void debugtup(HeapTuple tuple, TupleDesc typeinfo,
|
||||
DestReceiver * self);
|
||||
DestReceiver *self);
|
||||
extern void printtup_internal(HeapTuple tuple, TupleDesc typeinfo,
|
||||
DestReceiver * self);
|
||||
DestReceiver *self);
|
||||
|
||||
/* XXX this one is really in executor/spi.c */
|
||||
extern void spi_printtup(HeapTuple tuple, TupleDesc tupdesc,
|
||||
DestReceiver * self);
|
||||
DestReceiver *self);
|
||||
|
||||
extern int getTypeOutAndElem(Oid type, Oid *typOutput, Oid *typElem);
|
||||
|
||||
|
||||
@ -7,7 +7,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: strat.h,v 1.14 1999/05/25 22:04:56 momjian Exp $
|
||||
* $Id: strat.h,v 1.15 1999/05/25 22:42:34 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -33,6 +33,7 @@ typedef struct StrategyTransformMapData
|
||||
*
|
||||
*
|
||||
*
|
||||
*
|
||||
* STRUCTURE */
|
||||
|
||||
typedef StrategyTransformMapData *StrategyTransformMap;
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: transam.h,v 1.20 1999/05/25 16:13:35 momjian Exp $
|
||||
* $Id: transam.h,v 1.21 1999/05/25 22:42:35 momjian Exp $
|
||||
*
|
||||
* NOTES
|
||||
* Transaction System Version 101 now support proper oid
|
||||
@ -128,7 +128,7 @@ typedef struct VariableCacheData
|
||||
TransactionId nextXid;
|
||||
uint32 oid_count; /* not implemented, yet */
|
||||
Oid nextOid;
|
||||
} VariableCacheData;
|
||||
} VariableCacheData;
|
||||
|
||||
typedef VariableCacheData *VariableCache;
|
||||
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: tupdesc.h,v 1.21 1999/02/13 23:20:59 momjian Exp $
|
||||
* $Id: tupdesc.h,v 1.22 1999/05/25 22:42:36 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -57,7 +57,7 @@ typedef struct tupleDesc
|
||||
|
||||
extern TupleDesc CreateTemplateTupleDesc(int natts);
|
||||
|
||||
extern TupleDesc CreateTupleDesc(int natts, Form_pg_attribute * attrs);
|
||||
extern TupleDesc CreateTupleDesc(int natts, Form_pg_attribute *attrs);
|
||||
|
||||
extern TupleDesc CreateTupleDescCopy(TupleDesc tupdesc);
|
||||
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: command.h,v 1.13 1999/05/25 16:13:49 momjian Exp $
|
||||
* $Id: command.h,v 1.14 1999/05/25 22:42:41 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -44,6 +44,6 @@ extern void PortalCleanup(Portal portal);
|
||||
extern void PerformAddAttribute(char *relationName, char *userName,
|
||||
bool inh, ColumnDef *colDef);
|
||||
|
||||
extern void LockTableCommand(LockStmt * lockstmt);
|
||||
extern void LockTableCommand(LockStmt *lockstmt);
|
||||
|
||||
#endif /* COMMAND_H */
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: vacuum.h,v 1.19 1999/05/25 16:13:50 momjian Exp $
|
||||
* $Id: vacuum.h,v 1.20 1999/05/25 22:42:43 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -99,7 +99,7 @@ typedef struct VTupleLinkData
|
||||
{
|
||||
ItemPointerData new_tid;
|
||||
ItemPointerData this_tid;
|
||||
} VTupleLinkData;
|
||||
} VTupleLinkData;
|
||||
|
||||
typedef VTupleLinkData *VTupleLink;
|
||||
|
||||
@ -108,7 +108,7 @@ typedef struct VTupleMoveData
|
||||
ItemPointerData tid; /* tuple ID */
|
||||
VPageDescr vpd; /* where to move */
|
||||
bool cleanVpd; /* clean vpd before using */
|
||||
} VTupleMoveData;
|
||||
} VTupleMoveData;
|
||||
|
||||
typedef VTupleMoveData *VTupleMove;
|
||||
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: hashjoin.h,v 1.12 1999/05/25 16:13:54 momjian Exp $
|
||||
* $Id: hashjoin.h,v 1.13 1999/05/25 22:42:45 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -44,7 +44,7 @@ typedef struct HashJoinTupleData
|
||||
struct HashJoinTupleData *next; /* link to next tuple in same
|
||||
* bucket */
|
||||
HeapTupleData htup; /* tuple header */
|
||||
} HashJoinTupleData;
|
||||
} HashJoinTupleData;
|
||||
|
||||
typedef HashJoinTupleData *HashJoinTuple;
|
||||
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: nodeHashjoin.h,v 1.13 1999/05/25 16:13:56 momjian Exp $
|
||||
* $Id: nodeHashjoin.h,v 1.14 1999/05/25 22:42:46 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -21,7 +21,7 @@ extern TupleTableSlot *ExecHashJoin(HashJoin *node);
|
||||
extern bool ExecInitHashJoin(HashJoin *node, EState *estate, Plan *parent);
|
||||
extern int ExecCountSlotsHashJoin(HashJoin *node);
|
||||
extern void ExecEndHashJoin(HashJoin *node);
|
||||
extern void ExecHashJoinSaveTuple(HeapTuple heapTuple, BufFile * file);
|
||||
extern void ExecHashJoinSaveTuple(HeapTuple heapTuple, BufFile *file);
|
||||
extern void ExecReScanHashJoin(HashJoin *node, ExprContext *exprCtxt, Plan *parent);
|
||||
|
||||
#endif /* NODEHASHJOIN_H */
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: libpq.h,v 1.29 1999/05/25 16:14:00 momjian Exp $
|
||||
* $Id: libpq.h,v 1.30 1999/05/25 22:42:50 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -220,7 +220,7 @@ extern PortalEntry *be_newportal(void);
|
||||
extern void be_typeinit(PortalEntry *entry, TupleDesc attrs,
|
||||
int natts);
|
||||
extern void be_printtup(HeapTuple tuple, TupleDesc typeinfo,
|
||||
DestReceiver * self);
|
||||
DestReceiver *self);
|
||||
|
||||
|
||||
/* in be-pqexec.c */
|
||||
|
||||
@ -8,7 +8,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: pqcomm.h,v 1.35 1999/05/03 19:10:24 momjian Exp $
|
||||
* $Id: pqcomm.h,v 1.36 1999/05/25 22:42:51 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -156,6 +156,6 @@ typedef struct CancelRequestPacket
|
||||
* request */
|
||||
uint32 backendPID; /* PID of client's backend */
|
||||
uint32 cancelAuthCode; /* secret key to authorize cancel */
|
||||
} CancelRequestPacket;
|
||||
} CancelRequestPacket;
|
||||
|
||||
#endif /* PQCOMM_H */
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: execnodes.h,v 1.29 1999/05/25 16:14:07 momjian Exp $
|
||||
* $Id: execnodes.h,v 1.30 1999/05/25 22:42:54 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -698,7 +698,7 @@ typedef struct TeeState
|
||||
MemoryContext tee_mcxt;
|
||||
HeapScanDesc tee_leftScanDesc,
|
||||
tee_rightScanDesc;
|
||||
} TeeState;
|
||||
} TeeState;
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: memnodes.h,v 1.12 1999/05/25 16:14:09 momjian Exp $
|
||||
* $Id: memnodes.h,v 1.13 1999/05/25 22:42:55 momjian Exp $
|
||||
*
|
||||
* XXX the typedefs in this file are different from the other ???nodes.h;
|
||||
* they are pointers to structures instead of the structures themselves.
|
||||
@ -60,7 +60,7 @@ typedef struct MemoryContextData
|
||||
{
|
||||
NodeTag type;
|
||||
MemoryContextMethods method;
|
||||
} MemoryContextData;
|
||||
} MemoryContextData;
|
||||
|
||||
/* utils/mcxt.h contains typedef struct MemoryContextData *MemoryContext */
|
||||
|
||||
@ -73,7 +73,7 @@ typedef struct GlobalMemoryData
|
||||
AllocSetData setData;
|
||||
char *name;
|
||||
OrderedElemData elemData;
|
||||
} GlobalMemoryData;
|
||||
} GlobalMemoryData;
|
||||
|
||||
/* utils/mcxt.h contains typedef struct GlobalMemoryData *GlobalMemory */
|
||||
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: parsenodes.h,v 1.73 1999/05/25 16:14:09 momjian Exp $
|
||||
* $Id: parsenodes.h,v 1.74 1999/05/25 22:42:57 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -457,7 +457,7 @@ typedef struct UnlistenStmt
|
||||
{
|
||||
NodeTag type;
|
||||
char *relname; /* relation to unlisten on */
|
||||
} UnlistenStmt;
|
||||
} UnlistenStmt;
|
||||
|
||||
/* ----------------------
|
||||
* {Begin|Abort|End} Transaction Statement
|
||||
@ -590,7 +590,7 @@ typedef struct LockStmt
|
||||
NodeTag type;
|
||||
char *relname; /* relation to lock */
|
||||
int mode; /* lock mode */
|
||||
} LockStmt;
|
||||
} LockStmt;
|
||||
|
||||
/*****************************************************************************
|
||||
* Optimizable Statements
|
||||
@ -748,7 +748,7 @@ typedef struct CaseExpr
|
||||
Node *arg; /* implicit equality comparison argument */
|
||||
List *args; /* the arguments (list of WHEN clauses) */
|
||||
Node *defresult; /* the default result (ELSE clause) */
|
||||
} CaseExpr;
|
||||
} CaseExpr;
|
||||
|
||||
/*
|
||||
* CaseWhen - an argument to a CASE expression
|
||||
@ -758,7 +758,7 @@ typedef struct CaseWhen
|
||||
NodeTag type;
|
||||
Node *expr; /* comparison expression */
|
||||
Node *result; /* substitution result */
|
||||
} CaseWhen;
|
||||
} CaseWhen;
|
||||
|
||||
/*
|
||||
* ColumnDef - column definition (used in various creates)
|
||||
@ -896,7 +896,7 @@ typedef struct JoinExpr
|
||||
RangeVar *larg;
|
||||
Node *rarg;
|
||||
List *quals;
|
||||
} JoinExpr;
|
||||
} JoinExpr;
|
||||
|
||||
|
||||
/****************************************************************************
|
||||
@ -972,6 +972,6 @@ typedef struct RowMark
|
||||
NodeTag type;
|
||||
Index rti; /* index in Query->rtable */
|
||||
bits8 info; /* as above */
|
||||
} RowMark;
|
||||
} RowMark;
|
||||
|
||||
#endif /* PARSENODES_H */
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: plannodes.h,v 1.26 1999/05/25 16:14:10 momjian Exp $
|
||||
* $Id: plannodes.h,v 1.27 1999/05/25 22:42:58 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -264,7 +264,7 @@ typedef struct Noname
|
||||
Plan plan;
|
||||
Oid nonameid;
|
||||
int keycount;
|
||||
} Noname;
|
||||
} Noname;
|
||||
|
||||
/* ----------------
|
||||
* materialization node
|
||||
@ -338,7 +338,7 @@ typedef struct Tee
|
||||
List *rtentries; /* the range table for the plan below the
|
||||
* Tee may be different than the parent
|
||||
* plans */
|
||||
} Tee;
|
||||
} Tee;
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: primnodes.h,v 1.28 1999/05/25 16:14:11 momjian Exp $
|
||||
* $Id: primnodes.h,v 1.29 1999/05/25 22:42:59 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -273,7 +273,7 @@ typedef struct Aggref
|
||||
Node *target;
|
||||
int aggno;
|
||||
bool usenulls;
|
||||
} Aggref;
|
||||
} Aggref;
|
||||
|
||||
/* ----------------
|
||||
* SubLink
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: relation.h,v 1.31 1999/05/25 16:14:12 momjian Exp $
|
||||
* $Id: relation.h,v 1.32 1999/05/25 22:43:01 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -100,7 +100,7 @@ typedef struct RelOptInfo
|
||||
List *restrictinfo; /* RestrictInfo structures */
|
||||
List *joininfo; /* JoinInfo structures */
|
||||
List *innerjoin;
|
||||
} RelOptInfo;
|
||||
} RelOptInfo;
|
||||
|
||||
extern Var *get_expr(TargetEntry *foo);
|
||||
extern Var *get_groupclause_expr(GroupClause *groupClause, List *targetList);
|
||||
@ -167,7 +167,7 @@ typedef struct NestPath
|
||||
List *pathinfo;
|
||||
Path *outerjoinpath;
|
||||
Path *innerjoinpath;
|
||||
} NestPath;
|
||||
} NestPath;
|
||||
|
||||
typedef NestPath JoinPath;
|
||||
|
||||
@ -223,7 +223,7 @@ typedef struct RestrictInfo
|
||||
/* hashjoin only */
|
||||
Oid hashjoinoperator;
|
||||
Relids restrictinfojoinid;
|
||||
} RestrictInfo;
|
||||
} RestrictInfo;
|
||||
|
||||
typedef struct JoinMethod
|
||||
{
|
||||
@ -236,13 +236,13 @@ typedef struct HashInfo
|
||||
{
|
||||
JoinMethod jmethod;
|
||||
Oid hashop;
|
||||
} HashInfo;
|
||||
} HashInfo;
|
||||
|
||||
typedef struct MergeInfo
|
||||
{
|
||||
JoinMethod jmethod;
|
||||
MergeOrder *m_ordering;
|
||||
} MergeInfo;
|
||||
} MergeInfo;
|
||||
|
||||
typedef struct JoinInfo
|
||||
{
|
||||
@ -251,7 +251,7 @@ typedef struct JoinInfo
|
||||
List *jinfo_restrictinfo;
|
||||
bool mergejoinable;
|
||||
bool hashjoinable;
|
||||
} JoinInfo;
|
||||
} JoinInfo;
|
||||
|
||||
typedef struct Iter
|
||||
{
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: clauses.h,v 1.17 1999/05/25 16:14:15 momjian Exp $
|
||||
* $Id: clauses.h,v 1.18 1999/05/25 22:43:03 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -38,7 +38,7 @@ extern Expr *make_andclause(List *andclauses);
|
||||
extern bool case_clause(Node *clause);
|
||||
|
||||
extern List *pull_constant_clauses(List *quals, List **constantQual);
|
||||
extern void clause_get_relids_vars(Node *clause, Relids * relids, List **vars);
|
||||
extern void clause_get_relids_vars(Node *clause, Relids *relids, List **vars);
|
||||
extern int NumRelids(Node *clause);
|
||||
extern bool contains_not(Node *clause);
|
||||
extern bool is_joinable(Node *clause);
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: cost.h,v 1.19 1999/05/25 16:14:16 momjian Exp $
|
||||
* $Id: cost.h,v 1.20 1999/05/25 22:43:04 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -43,8 +43,8 @@ extern Cost cost_mergejoin(Cost outercost, Cost innercost,
|
||||
extern Cost cost_hashjoin(Cost outercost, Cost innercost, List *outerkeys,
|
||||
List *innerkeys, int outersize, int innersize,
|
||||
int outerwidth, int innerwidth);
|
||||
extern int compute_rel_size(RelOptInfo * rel);
|
||||
extern int compute_rel_width(RelOptInfo * rel);
|
||||
extern int compute_rel_size(RelOptInfo *rel);
|
||||
extern int compute_rel_width(RelOptInfo *rel);
|
||||
extern int compute_joinrel_size(JoinPath *joinpath);
|
||||
extern int page_size(int tuples, int width);
|
||||
|
||||
|
||||
@ -5,7 +5,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: geqo.h,v 1.15 1999/05/25 16:14:16 momjian Exp $
|
||||
* $Id: geqo.h,v 1.16 1999/05/25 22:43:05 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -72,6 +72,6 @@ extern void geqo_params(int string_length);
|
||||
extern void geqo_eval_startup(void);
|
||||
extern Cost geqo_eval(Query *root, Gene *tour, int num_gene);
|
||||
extern RelOptInfo *gimme_tree(Query *root, Gene *tour, int rel_count,
|
||||
int num_gene, RelOptInfo * old_rel);
|
||||
int num_gene, RelOptInfo *old_rel);
|
||||
|
||||
#endif /* GEQO_H */
|
||||
|
||||
@ -5,7 +5,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: geqo_misc.h,v 1.10 1999/05/25 16:14:17 momjian Exp $
|
||||
* $Id: geqo_misc.h,v 1.11 1999/05/25 22:43:07 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -31,7 +31,7 @@ extern void print_pool(FILE *fp, Pool *pool, int start, int stop);
|
||||
extern void print_gen(FILE *fp, Pool *pool, int generation);
|
||||
extern void print_edge_table(FILE *fp, Edge *edge_table, int num_gene);
|
||||
|
||||
extern void geqo_print_rel(Query *root, RelOptInfo * rel);
|
||||
extern void geqo_print_rel(Query *root, RelOptInfo *rel);
|
||||
extern void geqo_print_path(Query *root, Path *path, int indent);
|
||||
extern void geqo_print_joinclauses(Query *root, List *clauses);
|
||||
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: joininfo.h,v 1.11 1999/05/25 16:14:19 momjian Exp $
|
||||
* $Id: joininfo.h,v 1.12 1999/05/25 22:43:08 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -18,7 +18,7 @@
|
||||
#include "nodes/primnodes.h"
|
||||
|
||||
extern JoinInfo *joininfo_member(List *join_relids, List *joininfo_list);
|
||||
extern JoinInfo *find_joininfo_node(RelOptInfo * this_rel, List *join_relids);
|
||||
extern JoinInfo *find_joininfo_node(RelOptInfo *this_rel, List *join_relids);
|
||||
extern Var *other_join_clause_var(Var *var, Expr *clause);
|
||||
|
||||
#endif /* JOININFO_H */
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: keys.h,v 1.14 1999/05/25 16:14:19 momjian Exp $
|
||||
* $Id: keys.h,v 1.15 1999/05/25 22:43:09 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -16,7 +16,7 @@
|
||||
#include "nodes/nodes.h"
|
||||
#include "nodes/relation.h"
|
||||
|
||||
extern bool match_indexkey_operand(int indexkey, Var *operand, RelOptInfo * rel);
|
||||
extern bool match_indexkey_operand(int indexkey, Var *operand, RelOptInfo *rel);
|
||||
extern Var *extract_join_key(JoinKey *jk, int outer_or_inner);
|
||||
extern bool pathkeys_match(List *keys1, List *keys2, int *better_key);
|
||||
extern List *collect_index_pathkeys(int *index_keys, List *tlist);
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: pathnode.h,v 1.16 1999/05/25 16:14:20 momjian Exp $
|
||||
* $Id: pathnode.h,v 1.17 1999/05/25 22:43:10 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -21,20 +21,20 @@
|
||||
* prototypes for pathnode.c
|
||||
*/
|
||||
extern bool path_is_cheaper(Path *path1, Path *path2);
|
||||
extern Path *set_cheapest(RelOptInfo * parent_rel, List *pathlist);
|
||||
extern List *add_pathlist(RelOptInfo * parent_rel, List *unique_paths,
|
||||
extern Path *set_cheapest(RelOptInfo *parent_rel, List *pathlist);
|
||||
extern List *add_pathlist(RelOptInfo *parent_rel, List *unique_paths,
|
||||
List *new_paths);
|
||||
extern Path *create_seqscan_path(RelOptInfo * rel);
|
||||
extern IndexPath *create_index_path(Query *root, RelOptInfo * rel, RelOptInfo * index,
|
||||
extern Path *create_seqscan_path(RelOptInfo *rel);
|
||||
extern IndexPath *create_index_path(Query *root, RelOptInfo *rel, RelOptInfo *index,
|
||||
List *restriction_clauses, bool is_join_scan);
|
||||
extern NestPath *create_nestloop_path(RelOptInfo * joinrel, RelOptInfo * outer_rel,
|
||||
extern NestPath *create_nestloop_path(RelOptInfo *joinrel, RelOptInfo *outer_rel,
|
||||
Path *outer_path, Path *inner_path, List *pathkeys);
|
||||
extern MergePath *create_mergejoin_path(RelOptInfo * joinrel, int outersize,
|
||||
extern MergePath *create_mergejoin_path(RelOptInfo *joinrel, int outersize,
|
||||
int innersize, int outerwidth, int innerwidth, Path *outer_path,
|
||||
Path *inner_path, List *pathkeys, MergeOrder *order,
|
||||
List *mergeclauses, List *outersortkeys, List *innersortkeys);
|
||||
|
||||
extern HashPath *create_hashjoin_path(RelOptInfo * joinrel, int outersize,
|
||||
extern HashPath *create_hashjoin_path(RelOptInfo *joinrel, int outersize,
|
||||
int innersize, int outerwidth, int innerwidth, Path *outer_path,
|
||||
Path *inner_path, List *pathkeys, Oid operator, List *hashclauses,
|
||||
List *outerkeys, List *innerkeys);
|
||||
@ -49,6 +49,6 @@ extern RelOptInfo *get_join_rel(Query *root, Relids relid);
|
||||
/*
|
||||
* prototypes for indexnode.h
|
||||
*/
|
||||
extern List *find_relation_indices(Query *root, RelOptInfo * rel);
|
||||
extern List *find_relation_indices(Query *root, RelOptInfo *rel);
|
||||
|
||||
#endif /* PATHNODE_H */
|
||||
|
||||
@ -7,7 +7,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: paths.h,v 1.28 1999/05/25 16:14:21 momjian Exp $
|
||||
* $Id: paths.h,v 1.29 1999/05/25 22:43:11 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -27,7 +27,7 @@ extern RelOptInfo *make_one_rel(Query *root, List *rels);
|
||||
* indxpath.h
|
||||
* routines to generate index paths
|
||||
*/
|
||||
extern List *create_index_paths(Query *root, RelOptInfo * rel, List *indices,
|
||||
extern List *create_index_paths(Query *root, RelOptInfo *rel, List *indices,
|
||||
List *restrictinfo_list,
|
||||
List *joininfo_list);
|
||||
|
||||
@ -41,7 +41,7 @@ extern void update_rels_pathlist_for_joins(Query *root, List *joinrels);
|
||||
/*
|
||||
* orindxpath.h
|
||||
*/
|
||||
extern List *create_or_index_paths(Query *root, RelOptInfo * rel, List *clauses);
|
||||
extern List *create_or_index_paths(Query *root, RelOptInfo *rel, List *clauses);
|
||||
|
||||
/*
|
||||
* hashutils.h
|
||||
@ -79,11 +79,11 @@ extern MergeInfo *match_order_mergeinfo(PathOrder *ordering,
|
||||
* routines to determine which relations to join
|
||||
*/
|
||||
extern List *make_rels_by_joins(Query *root, List *old_rels);
|
||||
extern List *make_rels_by_clause_joins(Query *root, RelOptInfo * old_rel,
|
||||
extern List *make_rels_by_clause_joins(Query *root, RelOptInfo *old_rel,
|
||||
List *joininfo_list, Relids only_relids);
|
||||
extern List *make_rels_by_clauseless_joins(RelOptInfo * old_rel,
|
||||
extern List *make_rels_by_clauseless_joins(RelOptInfo *old_rel,
|
||||
List *inner_rels);
|
||||
extern RelOptInfo *make_join_rel(RelOptInfo * outer_rel, RelOptInfo * inner_rel, JoinInfo * joininfo);
|
||||
extern RelOptInfo *make_join_rel(RelOptInfo *outer_rel, RelOptInfo *inner_rel, JoinInfo *joininfo);
|
||||
extern List *new_join_tlist(List *tlist, int first_resdomno);
|
||||
extern RelOptInfo *get_cheapest_complete_rel(List *join_rel_list);
|
||||
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: restrictinfo.h,v 1.3 1999/05/25 16:14:22 momjian Exp $
|
||||
* $Id: restrictinfo.h,v 1.4 1999/05/25 22:43:12 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -16,7 +16,7 @@
|
||||
#include "nodes/pg_list.h"
|
||||
#include "nodes/relation.h"
|
||||
|
||||
extern bool valid_or_clause(RestrictInfo * restrictinfo);
|
||||
extern bool valid_or_clause(RestrictInfo *restrictinfo);
|
||||
extern List *get_actual_clauses(List *restrictinfo_list);
|
||||
extern void get_relattvals(List *restrictinfo_list, List **attnos,
|
||||
List **values, List **flags);
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: tlist.h,v 1.17 1999/05/25 16:14:23 momjian Exp $
|
||||
* $Id: tlist.h,v 1.18 1999/05/25 22:43:13 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -19,7 +19,7 @@
|
||||
|
||||
extern TargetEntry *tlistentry_member(Var *var, List *targetlist);
|
||||
extern Expr *matching_tlist_var(Var *var, List *targetlist);
|
||||
extern void add_var_to_tlist(RelOptInfo * rel, Var *var);
|
||||
extern void add_var_to_tlist(RelOptInfo *rel, Var *var);
|
||||
extern TargetEntry *create_tl_element(Var *var, int resdomno);
|
||||
extern List *get_actual_tlist(List *tlist);
|
||||
extern Resdom *tlist_member(Var *var, List *tlist);
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: xfunc.h,v 1.17 1999/05/25 16:14:23 momjian Exp $
|
||||
* $Id: xfunc.h,v 1.18 1999/05/25 22:43:14 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -49,10 +49,10 @@ extern int XfuncMode; /* defined in tcop/postgres.c */
|
||||
#define is_join(pathnode) (length(get_relids(get_parent(pathnode))) > 1 ? 1 : 0)
|
||||
|
||||
/* function prototypes from planner/path/xfunc.c */
|
||||
extern void xfunc_trypullup(RelOptInfo * rel);
|
||||
extern void xfunc_trypullup(RelOptInfo *rel);
|
||||
extern int xfunc_shouldpull(Path *childpath, JoinPath *parentpath,
|
||||
int whichchild, RestrictInfo * maxcinfopt);
|
||||
extern RestrictInfo *xfunc_pullup(Path *childpath, JoinPath *parentpath, RestrictInfo * cinfo,
|
||||
int whichchild, RestrictInfo *maxcinfopt);
|
||||
extern RestrictInfo *xfunc_pullup(Path *childpath, JoinPath *parentpath, RestrictInfo *cinfo,
|
||||
int whichchild, int clausetype);
|
||||
extern Cost xfunc_rank(Expr *clause);
|
||||
extern Cost xfunc_expense(Query *queryInfo, Expr *clause);
|
||||
@ -69,7 +69,7 @@ extern List *xfunc_primary_join(JoinPath *pathnode);
|
||||
extern Cost xfunc_get_path_cost(Path *pathnode);
|
||||
extern Cost xfunc_total_path_cost(JoinPath *pathnode);
|
||||
extern Cost xfunc_expense_per_tuple(JoinPath *joinnode, int whichchild);
|
||||
extern void xfunc_fixvars(Expr *clause, RelOptInfo * rel, int varno);
|
||||
extern void xfunc_fixvars(Expr *clause, RelOptInfo *rel, int varno);
|
||||
extern int xfunc_cinfo_compare(void *arg1, void *arg2);
|
||||
extern int xfunc_clause_compare(void *arg1, void *arg2);
|
||||
extern void xfunc_disjunct_sort(List *clause_list);
|
||||
@ -78,7 +78,7 @@ extern int xfunc_func_width(RegProcedure funcid, List *args);
|
||||
extern int xfunc_tuple_width(Relation rd);
|
||||
extern int xfunc_num_join_clauses(JoinPath *path);
|
||||
extern List *xfunc_LispRemove(List *foo, List *bar);
|
||||
extern bool xfunc_copyrel(RelOptInfo * from, RelOptInfo ** to);
|
||||
extern bool xfunc_copyrel(RelOptInfo *from, RelOptInfo **to);
|
||||
|
||||
/*
|
||||
* function prototypes for path/predmig.c
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: parse_agg.h,v 1.9 1999/05/25 16:14:26 momjian Exp $
|
||||
* $Id: parse_agg.h,v 1.10 1999/05/25 22:43:16 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -18,7 +18,7 @@
|
||||
#include <nodes/primnodes.h>
|
||||
#include <parser/parse_node.h>
|
||||
|
||||
extern void AddAggToParseState(ParseState *pstate, Aggref * aggref);
|
||||
extern void AddAggToParseState(ParseState *pstate, Aggref *aggref);
|
||||
extern void parseCheckAggregates(ParseState *pstate, Query *qry);
|
||||
extern Aggref *ParseAgg(ParseState *pstate, char *aggname, Oid basetype,
|
||||
List *target, int precedence);
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: parse_coerce.h,v 1.11 1999/05/25 16:14:26 momjian Exp $
|
||||
* $Id: parse_coerce.h,v 1.12 1999/05/25 22:43:17 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -26,7 +26,7 @@ typedef enum CATEGORY
|
||||
NETWORK_TYPE,
|
||||
USER_TYPE,
|
||||
MIXED_TYPE
|
||||
} CATEGORY;
|
||||
} CATEGORY;
|
||||
|
||||
|
||||
/* IS_BUILTIN_TYPE()
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: fd.h,v 1.14 1999/05/25 16:14:41 momjian Exp $
|
||||
* $Id: fd.h,v 1.15 1999/05/25 22:43:24 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -91,11 +91,11 @@ extern void FreeFile(FILE *);
|
||||
* atop virtual Files...
|
||||
*/
|
||||
extern BufFile *BufFileCreate(File file);
|
||||
extern void BufFileClose(BufFile * file);
|
||||
extern size_t BufFileRead(BufFile * file, void *ptr, size_t size);
|
||||
extern size_t BufFileWrite(BufFile * file, void *ptr, size_t size);
|
||||
extern int BufFileFlush(BufFile * file);
|
||||
extern long BufFileSeek(BufFile * file, long offset, int whence);
|
||||
extern void BufFileClose(BufFile *file);
|
||||
extern size_t BufFileRead(BufFile *file, void *ptr, size_t size);
|
||||
extern size_t BufFileWrite(BufFile *file, void *ptr, size_t size);
|
||||
extern int BufFileFlush(BufFile *file);
|
||||
extern long BufFileSeek(BufFile *file, long offset, int whence);
|
||||
|
||||
/* Miscellaneous support routines */
|
||||
extern int FileNameUnlink(char *filename);
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: lmgr.h,v 1.19 1999/05/07 01:23:05 vadim Exp $
|
||||
* $Id: lmgr.h,v 1.20 1999/05/25 22:43:26 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -32,7 +32,7 @@ typedef struct LockRelId
|
||||
{
|
||||
Oid relId; /* a relation identifier */
|
||||
Oid dbId; /* a database identifier */
|
||||
} LockRelId;
|
||||
} LockRelId;
|
||||
|
||||
typedef struct LockInfoData
|
||||
{
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: lock.h,v 1.27 1999/05/25 16:14:42 momjian Exp $
|
||||
* $Id: lock.h,v 1.28 1999/05/25 22:43:26 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -100,7 +100,7 @@ typedef struct LOCKMETHODCTL
|
||||
int conflictTab[MAX_LOCKMODES];
|
||||
int prio[MAX_LOCKMODES];
|
||||
SPINLOCK masterLock;
|
||||
} LOCKMETHODCTL;
|
||||
} LOCKMETHODCTL;
|
||||
|
||||
/*
|
||||
* lockHash -- hash table on lock Ids,
|
||||
@ -113,7 +113,7 @@ typedef struct LOCKMETHODTABLE
|
||||
HTAB *lockHash;
|
||||
HTAB *xidHash;
|
||||
LOCKMETHODCTL *ctl;
|
||||
} LOCKMETHODTABLE;
|
||||
} LOCKMETHODTABLE;
|
||||
|
||||
/* -----------------------
|
||||
* A transaction never conflicts with its own locks. Hence, if
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: proc.h,v 1.23 1999/05/25 16:14:45 momjian Exp $
|
||||
* $Id: proc.h,v 1.24 1999/05/25 22:43:27 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -119,7 +119,7 @@ extern bool ProcRemove(int pid);
|
||||
/* make static in storage/lmgr/proc.c -- jolly */
|
||||
|
||||
extern void ProcQueueInit(PROC_QUEUE *queue);
|
||||
extern int ProcSleep(PROC_QUEUE *queue, LOCKMETHODCTL * lockctl, int token,
|
||||
extern int ProcSleep(PROC_QUEUE *queue, LOCKMETHODCTL *lockctl, int token,
|
||||
LOCK *lock);
|
||||
extern PROC *ProcWakeup(PROC *proc, int errType);
|
||||
extern int ProcLockWakeup(PROC_QUEUE *queue, LOCKMETHOD lockmethod,
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: shmem.h,v 1.17 1999/05/25 16:14:45 momjian Exp $
|
||||
* $Id: shmem.h,v 1.18 1999/05/25 22:43:27 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -90,7 +90,7 @@ typedef struct
|
||||
char key[SHMEM_INDEX_KEYSIZE]; /* string name */
|
||||
unsigned long location; /* location in shared mem */
|
||||
unsigned long size; /* numbytes allocated for the structure */
|
||||
} ShmemIndexEnt;
|
||||
} ShmemIndexEnt;
|
||||
|
||||
/*
|
||||
* prototypes for functions in shmqueue.c
|
||||
|
||||
@ -44,7 +44,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: dest.h,v 1.19 1999/05/25 16:14:47 momjian Exp $
|
||||
* $Id: dest.h,v 1.20 1999/05/25 22:43:29 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -82,10 +82,10 @@ struct _DestReceiver
|
||||
{
|
||||
/* Called for each tuple to be output: */
|
||||
void (*receiveTuple) (HeapTuple tuple, TupleDesc typeinfo,
|
||||
DestReceiver * self);
|
||||
DestReceiver *self);
|
||||
/* Initialization and teardown: */
|
||||
void (*setup) (DestReceiver * self, TupleDesc typeinfo);
|
||||
void (*cleanup) (DestReceiver * self);
|
||||
void (*setup) (DestReceiver *self, TupleDesc typeinfo);
|
||||
void (*cleanup) (DestReceiver *self);
|
||||
/* Private fields might appear beyond this point... */
|
||||
};
|
||||
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: builtins.h,v 1.79 1999/05/25 16:14:52 momjian Exp $
|
||||
* $Id: builtins.h,v 1.80 1999/05/25 22:43:31 momjian Exp $
|
||||
*
|
||||
* NOTES
|
||||
* This should normally only be included by fmgr.h.
|
||||
@ -164,7 +164,7 @@ extern void ltoa(int32 l, char *a);
|
||||
*/
|
||||
extern int32 btint2cmp(int16 a, int16 b);
|
||||
extern int32 btint4cmp(int32 a, int32 b);
|
||||
extern int32 btint8cmp(int64 * a, int64 * b);
|
||||
extern int32 btint8cmp(int64 *a, int64 *b);
|
||||
extern int32 btint24cmp(int16 a, int32 b);
|
||||
extern int32 btint42cmp(int32 a, int16 b);
|
||||
extern int32 btfloat4cmp(float32 a, float32 b);
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: inet.h,v 1.4 1999/05/25 16:14:54 momjian Exp $
|
||||
* $Id: inet.h,v 1.5 1999/05/25 22:43:34 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -27,7 +27,7 @@ typedef struct
|
||||
unsigned int ipv4_addr; /* network byte order */
|
||||
/* add IPV6 address type here */
|
||||
} addr;
|
||||
} inet_struct;
|
||||
} inet_struct;
|
||||
|
||||
typedef struct varlena inet;
|
||||
|
||||
@ -51,7 +51,7 @@ typedef struct manufacturer
|
||||
unsigned char b;
|
||||
unsigned char c;
|
||||
char *name;
|
||||
} manufacturer;
|
||||
} manufacturer;
|
||||
|
||||
extern manufacturer manufacturers[];
|
||||
|
||||
|
||||
@ -6,7 +6,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: int8.h,v 1.13 1999/05/25 16:14:55 momjian Exp $
|
||||
* $Id: int8.h,v 1.14 1999/05/25 22:43:35 momjian Exp $
|
||||
*
|
||||
* NOTES
|
||||
* These data types are supported on all 64-bit architectures, and may
|
||||
@ -47,60 +47,60 @@ typedef long int int64;
|
||||
|
||||
|
||||
extern int64 *int8in(char *str);
|
||||
extern char *int8out(int64 * val);
|
||||
extern char *int8out(int64 *val);
|
||||
|
||||
extern bool int8eq(int64 * val1, int64 * val2);
|
||||
extern bool int8ne(int64 * val1, int64 * val2);
|
||||
extern bool int8lt(int64 * val1, int64 * val2);
|
||||
extern bool int8gt(int64 * val1, int64 * val2);
|
||||
extern bool int8le(int64 * val1, int64 * val2);
|
||||
extern bool int8ge(int64 * val1, int64 * val2);
|
||||
extern bool int8eq(int64 *val1, int64 *val2);
|
||||
extern bool int8ne(int64 *val1, int64 *val2);
|
||||
extern bool int8lt(int64 *val1, int64 *val2);
|
||||
extern bool int8gt(int64 *val1, int64 *val2);
|
||||
extern bool int8le(int64 *val1, int64 *val2);
|
||||
extern bool int8ge(int64 *val1, int64 *val2);
|
||||
|
||||
extern bool int84eq(int64 * val1, int32 val2);
|
||||
extern bool int84ne(int64 * val1, int32 val2);
|
||||
extern bool int84lt(int64 * val1, int32 val2);
|
||||
extern bool int84gt(int64 * val1, int32 val2);
|
||||
extern bool int84le(int64 * val1, int32 val2);
|
||||
extern bool int84ge(int64 * val1, int32 val2);
|
||||
extern bool int84eq(int64 *val1, int32 val2);
|
||||
extern bool int84ne(int64 *val1, int32 val2);
|
||||
extern bool int84lt(int64 *val1, int32 val2);
|
||||
extern bool int84gt(int64 *val1, int32 val2);
|
||||
extern bool int84le(int64 *val1, int32 val2);
|
||||
extern bool int84ge(int64 *val1, int32 val2);
|
||||
|
||||
extern bool int48eq(int32 val1, int64 * val2);
|
||||
extern bool int48ne(int32 val1, int64 * val2);
|
||||
extern bool int48lt(int32 val1, int64 * val2);
|
||||
extern bool int48gt(int32 val1, int64 * val2);
|
||||
extern bool int48le(int32 val1, int64 * val2);
|
||||
extern bool int48ge(int32 val1, int64 * val2);
|
||||
extern bool int48eq(int32 val1, int64 *val2);
|
||||
extern bool int48ne(int32 val1, int64 *val2);
|
||||
extern bool int48lt(int32 val1, int64 *val2);
|
||||
extern bool int48gt(int32 val1, int64 *val2);
|
||||
extern bool int48le(int32 val1, int64 *val2);
|
||||
extern bool int48ge(int32 val1, int64 *val2);
|
||||
|
||||
extern int64 *int8um(int64 * val);
|
||||
extern int64 *int8pl(int64 * val1, int64 * val2);
|
||||
extern int64 *int8mi(int64 * val1, int64 * val2);
|
||||
extern int64 *int8mul(int64 * val1, int64 * val2);
|
||||
extern int64 *int8div(int64 * val1, int64 * val2);
|
||||
extern int64 *int8larger(int64 * val1, int64 * val2);
|
||||
extern int64 *int8smaller(int64 * val1, int64 * val2);
|
||||
extern int64 *int8um(int64 *val);
|
||||
extern int64 *int8pl(int64 *val1, int64 *val2);
|
||||
extern int64 *int8mi(int64 *val1, int64 *val2);
|
||||
extern int64 *int8mul(int64 *val1, int64 *val2);
|
||||
extern int64 *int8div(int64 *val1, int64 *val2);
|
||||
extern int64 *int8larger(int64 *val1, int64 *val2);
|
||||
extern int64 *int8smaller(int64 *val1, int64 *val2);
|
||||
|
||||
extern int64 *int84pl(int64 * val1, int32 val2);
|
||||
extern int64 *int84mi(int64 * val1, int32 val2);
|
||||
extern int64 *int84mul(int64 * val1, int32 val2);
|
||||
extern int64 *int84div(int64 * val1, int32 val2);
|
||||
extern int64 *int84pl(int64 *val1, int32 val2);
|
||||
extern int64 *int84mi(int64 *val1, int32 val2);
|
||||
extern int64 *int84mul(int64 *val1, int32 val2);
|
||||
extern int64 *int84div(int64 *val1, int32 val2);
|
||||
|
||||
extern int64 *int48pl(int32 val1, int64 * val2);
|
||||
extern int64 *int48mi(int32 val1, int64 * val2);
|
||||
extern int64 *int48mul(int32 val1, int64 * val2);
|
||||
extern int64 *int48div(int32 val1, int64 * val2);
|
||||
extern int64 *int48pl(int32 val1, int64 *val2);
|
||||
extern int64 *int48mi(int32 val1, int64 *val2);
|
||||
extern int64 *int48mul(int32 val1, int64 *val2);
|
||||
extern int64 *int48div(int32 val1, int64 *val2);
|
||||
|
||||
extern int64 *int48(int32 val);
|
||||
extern int32 int84(int64 * val);
|
||||
extern int32 int84(int64 *val);
|
||||
|
||||
#if NOT_USED
|
||||
extern int64 *int28 (int16 val);
|
||||
extern int16 int82(int64 * val);
|
||||
extern int16 int82(int64 *val);
|
||||
|
||||
#endif
|
||||
|
||||
extern float64 i8tod(int64 * val);
|
||||
extern float64 i8tod(int64 *val);
|
||||
extern int64 *dtoi8(float64 val);
|
||||
|
||||
extern text *int8_text(int64 * val);
|
||||
extern text *int8_text(int64 *val);
|
||||
extern int64 *text_int8(text *str);
|
||||
|
||||
#endif /* INT8_H */
|
||||
|
||||
@ -15,7 +15,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: memutils.h,v 1.25 1999/05/25 16:14:56 momjian Exp $
|
||||
* $Id: memutils.h,v 1.26 1999/05/25 22:43:36 momjian Exp $
|
||||
*
|
||||
* NOTES
|
||||
* some of the information in this file will be moved to
|
||||
@ -168,7 +168,7 @@ typedef struct AllocBlockData
|
||||
struct AllocBlockData *next;
|
||||
char *freeptr;
|
||||
char *endptr;
|
||||
} AllocBlockData;
|
||||
} AllocBlockData;
|
||||
|
||||
typedef AllocBlockData *AllocBlock;
|
||||
|
||||
@ -182,7 +182,7 @@ typedef struct AllocChunkData
|
||||
void *aset;
|
||||
/* size is always the chunk size */
|
||||
Size size;
|
||||
} AllocChunkData;
|
||||
} AllocChunkData;
|
||||
|
||||
typedef AllocChunkData *AllocChunk;
|
||||
|
||||
|
||||
@ -5,7 +5,7 @@
|
||||
*
|
||||
* 1998 Jan Wieck
|
||||
*
|
||||
* $Header: /cvsroot/pgsql/src/include/utils/numeric.h,v 1.5 1999/05/25 16:14:56 momjian Exp $
|
||||
* $Header: /cvsroot/pgsql/src/include/utils/numeric.h,v 1.6 1999/05/25 22:43:37 momjian Exp $
|
||||
*
|
||||
* ----------
|
||||
*/
|
||||
@ -58,7 +58,7 @@ typedef struct NumericData
|
||||
uint16 n_rscale; /* Result scale */
|
||||
uint16 n_sign_dscale; /* Sign + display scale */
|
||||
unsigned char n_data[1]; /* Digit data */
|
||||
} NumericData;
|
||||
} NumericData;
|
||||
typedef NumericData *Numeric;
|
||||
|
||||
#define NUMERIC_HDRSZ (sizeof(int32) + sizeof(uint16) * 3)
|
||||
|
||||
@ -7,7 +7,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: tqual.h,v 1.21 1999/05/25 16:14:58 momjian Exp $
|
||||
* $Id: tqual.h,v 1.22 1999/05/25 22:43:39 momjian Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -23,7 +23,7 @@ typedef struct SnapshotData
|
||||
uint32 xcnt; /* # of xact below */
|
||||
TransactionId *xip; /* array of xacts in progress */
|
||||
ItemPointerData tid; /* required for Dirty snapshot -:( */
|
||||
} SnapshotData;
|
||||
} SnapshotData;
|
||||
|
||||
typedef SnapshotData *Snapshot;
|
||||
|
||||
|
||||
Reference in New Issue
Block a user